/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/weaver/unroll-cond-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:56:48,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:56:48,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:56:48,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:56:48,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:56:48,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:56:48,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:56:48,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:56:48,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:56:48,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:56:48,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:56:48,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:56:48,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:56:48,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:56:48,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:56:48,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:56:48,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:56:48,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:56:48,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:56:48,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:56:48,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:56:48,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:56:48,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:56:48,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:56:48,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:56:48,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:56:48,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:56:48,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:56:48,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:56:48,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:56:48,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:56:48,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:56:48,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:56:48,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:56:48,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:56:48,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:56:48,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:56:48,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:56:48,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:56:48,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:56:48,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:56:48,981 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-06 07:56:49,012 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:56:49,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:56:49,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:56:49,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:56:49,015 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:56:49,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:56:49,016 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:56:49,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:56:49,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:56:49,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:56:49,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:56:49,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:56:49,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:56:49,017 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:56:49,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:56:49,018 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:56:49,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:56:49,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:56:49,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:56:49,018 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:56:49,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:56:49,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:56:49,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:56:49,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:56:49,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:56:49,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:56:49,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:56:49,020 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:56:49,020 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-06 07:56:49,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:56:49,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:56:49,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:56:49,360 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:56:49,360 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:56:49,361 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2022-12-06 07:56:50,520 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:56:50,721 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:56:50,721 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2022-12-06 07:56:50,729 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7c90fdc4/73888186f1064e04aae19172795b009e/FLAG0ea9ea12e [2022-12-06 07:56:50,747 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7c90fdc4/73888186f1064e04aae19172795b009e [2022-12-06 07:56:50,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:56:50,750 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:56:50,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:56:50,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:56:50,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:56:50,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:56:50" (1/1) ... [2022-12-06 07:56:50,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f25b852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:50, skipping insertion in model container [2022-12-06 07:56:50,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:56:50" (1/1) ... [2022-12-06 07:56:50,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:56:50,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:56:50,948 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c[2975,2988] [2022-12-06 07:56:50,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:56:50,961 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:56:50,987 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c[2975,2988] [2022-12-06 07:56:50,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:56:51,000 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:56:51,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:51 WrapperNode [2022-12-06 07:56:51,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:56:51,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:56:51,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:56:51,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:56:51,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:51" (1/1) ... [2022-12-06 07:56:51,013 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:51" (1/1) ... [2022-12-06 07:56:51,035 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 204 [2022-12-06 07:56:51,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:56:51,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:56:51,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:56:51,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:56:51,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:51" (1/1) ... [2022-12-06 07:56:51,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:51" (1/1) ... [2022-12-06 07:56:51,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:51" (1/1) ... [2022-12-06 07:56:51,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:51" (1/1) ... [2022-12-06 07:56:51,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:51" (1/1) ... [2022-12-06 07:56:51,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:51" (1/1) ... [2022-12-06 07:56:51,058 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:51" (1/1) ... [2022-12-06 07:56:51,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:51" (1/1) ... [2022-12-06 07:56:51,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:56:51,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:56:51,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:56:51,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:56:51,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:51" (1/1) ... [2022-12-06 07:56:51,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:56:51,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:56:51,089 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:56:51,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:56:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:56:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:56:51,129 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:56:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:56:51,130 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:56:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:56:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:56:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:56:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:56:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:56:51,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:56:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:56:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:56:51,134 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:56:51,208 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:56:51,209 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:56:51,637 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:56:51,653 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:56:51,653 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 07:56:51,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:56:51 BoogieIcfgContainer [2022-12-06 07:56:51,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:56:51,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:56:51,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:56:51,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:56:51,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:56:50" (1/3) ... [2022-12-06 07:56:51,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45258fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:56:51, skipping insertion in model container [2022-12-06 07:56:51,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:56:51" (2/3) ... [2022-12-06 07:56:51,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45258fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:56:51, skipping insertion in model container [2022-12-06 07:56:51,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:56:51" (3/3) ... [2022-12-06 07:56:51,662 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2022-12-06 07:56:51,678 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:56:51,678 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:56:51,679 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:56:51,791 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:56:51,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 247 transitions, 510 flow [2022-12-06 07:56:51,900 INFO L130 PetriNetUnfolder]: 24/245 cut-off events. [2022-12-06 07:56:51,900 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:56:51,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 245 events. 24/245 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 480 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2022-12-06 07:56:51,908 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 247 transitions, 510 flow [2022-12-06 07:56:51,916 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 237 transitions, 486 flow [2022-12-06 07:56:51,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:51,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 237 transitions, 486 flow [2022-12-06 07:56:51,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 237 transitions, 486 flow [2022-12-06 07:56:52,010 INFO L130 PetriNetUnfolder]: 24/237 cut-off events. [2022-12-06 07:56:52,010 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:56:52,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 237 events. 24/237 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 460 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2022-12-06 07:56:52,017 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 237 transitions, 486 flow [2022-12-06 07:56:52,017 INFO L188 LiptonReduction]: Number of co-enabled transitions 6892 [2022-12-06 07:57:13,974 WARN L233 SmtUtils]: Spent 8.92s on a formula simplification. DAG size of input: 199 DAG size of output: 197 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 07:57:19,533 INFO L203 LiptonReduction]: Total number of compositions: 216 [2022-12-06 07:57:19,546 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:57:19,549 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;@3e62b60c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:57:19,549 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:57:19,555 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 07:57:19,555 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:57:19,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:19,556 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:19,556 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:19,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:19,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1113317458, now seen corresponding path program 1 times [2022-12-06 07:57:19,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:19,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813577903] [2022-12-06 07:57:19,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:19,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:19,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:19,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813577903] [2022-12-06 07:57:19,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813577903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:19,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:19,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:57:19,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482530803] [2022-12-06 07:57:19,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:19,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:57:19,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:20,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:57:20,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:57:20,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 07:57:20,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-06 07:57:20,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:20,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 07:57:20,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:20,118 INFO L130 PetriNetUnfolder]: 49/84 cut-off events. [2022-12-06 07:57:20,118 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 07:57:20,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 84 events. 49/84 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 19 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 129. Up to 81 conditions per place. [2022-12-06 07:57:20,120 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-06 07:57:20,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-06 07:57:20,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:57:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:57:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 07:57:20,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 07:57:20,132 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-06 07:57:20,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-06 07:57:20,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:57:20,136 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-06 07:57:20,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2022-12-06 07:57:20,141 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 07:57:20,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:20,142 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 07:57:20,144 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:20,144 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:20,144 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 07:57:20,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 07:57:20,155 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 07:57:20,155 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:57:20,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2022-12-06 07:57:20,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 07:57:20,158 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 07:57:21,000 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:57:21,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 860 [2022-12-06 07:57:21,002 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-06 07:57:21,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-06 07:57:21,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:21,002 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:21,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:57:21,002 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:21,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash 139568478, now seen corresponding path program 1 times [2022-12-06 07:57:21,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:21,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583777057] [2022-12-06 07:57:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:21,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:21,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:21,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583777057] [2022-12-06 07:57:21,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583777057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:21,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:21,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:57:21,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991914595] [2022-12-06 07:57:21,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:21,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:57:21,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:21,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:57:21,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:57:21,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 07:57:21,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-06 07:57:21,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:21,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 07:57:21,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:21,521 INFO L130 PetriNetUnfolder]: 72/134 cut-off events. [2022-12-06 07:57:21,522 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:57:21,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 134 events. 72/134 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 371 event pairs, 24 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 274. Up to 76 conditions per place. [2022-12-06 07:57:21,523 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 34 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2022-12-06 07:57:21,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 39 transitions, 173 flow [2022-12-06 07:57:21,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:57:21,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:57:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 07:57:21,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-06 07:57:21,525 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 5 states and 40 transitions. [2022-12-06 07:57:21,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 39 transitions, 173 flow [2022-12-06 07:57:21,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 39 transitions, 165 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:57:21,526 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 74 flow [2022-12-06 07:57:21,526 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2022-12-06 07:57:21,527 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-06 07:57:21,527 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:21,527 INFO L89 Accepts]: Start accepts. Operand has 24 places, 21 transitions, 74 flow [2022-12-06 07:57:21,528 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:21,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:21,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 21 transitions, 74 flow [2022-12-06 07:57:21,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 74 flow [2022-12-06 07:57:21,533 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2022-12-06 07:57:21,533 INFO L131 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2022-12-06 07:57:21,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 28 events. 4/28 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 32. Up to 6 conditions per place. [2022-12-06 07:57:21,534 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 21 transitions, 74 flow [2022-12-06 07:57:21,534 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 07:57:21,659 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:57:21,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-06 07:57:21,660 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 65 flow [2022-12-06 07:57:21,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-06 07:57:21,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:21,661 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:21,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:57:21,661 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:21,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:21,661 INFO L85 PathProgramCache]: Analyzing trace with hash 3272215, now seen corresponding path program 1 times [2022-12-06 07:57:21,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:21,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552089296] [2022-12-06 07:57:21,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:21,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:21,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:21,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552089296] [2022-12-06 07:57:21,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552089296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:21,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:21,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:57:21,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937062728] [2022-12-06 07:57:21,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:21,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:57:21,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:21,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:57:21,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:57:21,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 07:57:21,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-06 07:57:21,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:21,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 07:57:21,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:22,062 INFO L130 PetriNetUnfolder]: 87/169 cut-off events. [2022-12-06 07:57:22,062 INFO L131 PetriNetUnfolder]: For 142/142 co-relation queries the response was YES. [2022-12-06 07:57:22,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 169 events. 87/169 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 525 event pairs, 33 based on Foata normal form. 2/134 useless extension candidates. Maximal degree in co-relation 220. Up to 109 conditions per place. [2022-12-06 07:57:22,063 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 32 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2022-12-06 07:57:22,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 36 transitions, 199 flow [2022-12-06 07:57:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:57:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:57:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 07:57:22,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 07:57:22,065 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 65 flow. Second operand 4 states and 36 transitions. [2022-12-06 07:57:22,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 36 transitions, 199 flow [2022-12-06 07:57:22,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 36 transitions, 169 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 07:57:22,066 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 72 flow [2022-12-06 07:57:22,067 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2022-12-06 07:57:22,067 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 07:57:22,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:22,068 INFO L89 Accepts]: Start accepts. Operand has 26 places, 20 transitions, 72 flow [2022-12-06 07:57:22,068 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:22,068 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:22,068 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 20 transitions, 72 flow [2022-12-06 07:57:22,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 72 flow [2022-12-06 07:57:22,075 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-06 07:57:22,075 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 07:57:22,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 32 events. 3/32 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 62 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 30. Up to 6 conditions per place. [2022-12-06 07:57:22,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 72 flow [2022-12-06 07:57:22,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 07:57:22,227 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:57:22,228 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:57:22,229 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 75 flow [2022-12-06 07:57:22,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-06 07:57:22,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:22,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:22,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:57:22,229 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:22,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:22,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1295872819, now seen corresponding path program 2 times [2022-12-06 07:57:22,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:22,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826579338] [2022-12-06 07:57:22,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:22,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:22,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826579338] [2022-12-06 07:57:22,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826579338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:22,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:22,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:57:22,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223751293] [2022-12-06 07:57:22,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:22,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:57:22,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:22,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:57:22,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:57:22,389 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 07:57:22,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-06 07:57:22,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:22,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 07:57:22,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:22,530 INFO L130 PetriNetUnfolder]: 77/149 cut-off events. [2022-12-06 07:57:22,532 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-06 07:57:22,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 149 events. 77/149 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 420 event pairs, 42 based on Foata normal form. 4/128 useless extension candidates. Maximal degree in co-relation 272. Up to 126 conditions per place. [2022-12-06 07:57:22,538 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 24 selfloop transitions, 2 changer transitions 4/30 dead transitions. [2022-12-06 07:57:22,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 161 flow [2022-12-06 07:57:22,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:57:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:57:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-06 07:57:22,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40789473684210525 [2022-12-06 07:57:22,540 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 75 flow. Second operand 4 states and 31 transitions. [2022-12-06 07:57:22,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 161 flow [2022-12-06 07:57:22,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 148 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 07:57:22,544 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 70 flow [2022-12-06 07:57:22,544 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2022-12-06 07:57:22,546 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2022-12-06 07:57:22,546 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:22,546 INFO L89 Accepts]: Start accepts. Operand has 27 places, 20 transitions, 70 flow [2022-12-06 07:57:22,547 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:22,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:22,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 20 transitions, 70 flow [2022-12-06 07:57:22,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 20 transitions, 70 flow [2022-12-06 07:57:22,553 INFO L130 PetriNetUnfolder]: 3/29 cut-off events. [2022-12-06 07:57:22,553 INFO L131 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-12-06 07:57:22,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 29 events. 3/29 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2022-12-06 07:57:22,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 20 transitions, 70 flow [2022-12-06 07:57:22,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 07:57:23,709 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:57:23,710 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1164 [2022-12-06 07:57:23,710 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 19 transitions, 64 flow [2022-12-06 07:57:23,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-06 07:57:23,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:23,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:23,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:57:23,711 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:23,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:23,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1544279474, now seen corresponding path program 1 times [2022-12-06 07:57:23,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:23,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606061457] [2022-12-06 07:57:23,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:23,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:23,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:23,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606061457] [2022-12-06 07:57:23,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606061457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:23,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:23,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:57:23,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219081289] [2022-12-06 07:57:23,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:23,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:57:23,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:23,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:57:23,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:57:23,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 07:57:23,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 19 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-06 07:57:23,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:23,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 07:57:23,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:24,045 INFO L130 PetriNetUnfolder]: 89/161 cut-off events. [2022-12-06 07:57:24,046 INFO L131 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2022-12-06 07:57:24,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 161 events. 89/161 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 461 event pairs, 38 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 367. Up to 138 conditions per place. [2022-12-06 07:57:24,047 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 27 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2022-12-06 07:57:24,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 32 transitions, 168 flow [2022-12-06 07:57:24,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:57:24,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:57:24,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 07:57:24,048 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4342105263157895 [2022-12-06 07:57:24,048 INFO L175 Difference]: Start difference. First operand has 24 places, 19 transitions, 64 flow. Second operand 4 states and 33 transitions. [2022-12-06 07:57:24,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 32 transitions, 168 flow [2022-12-06 07:57:24,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 32 transitions, 148 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 07:57:24,049 INFO L231 Difference]: Finished difference. Result has 26 places, 23 transitions, 88 flow [2022-12-06 07:57:24,050 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=26, PETRI_TRANSITIONS=23} [2022-12-06 07:57:24,050 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 07:57:24,050 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:24,050 INFO L89 Accepts]: Start accepts. Operand has 26 places, 23 transitions, 88 flow [2022-12-06 07:57:24,051 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:24,051 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:24,051 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 23 transitions, 88 flow [2022-12-06 07:57:24,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 23 transitions, 88 flow [2022-12-06 07:57:24,058 INFO L130 PetriNetUnfolder]: 7/37 cut-off events. [2022-12-06 07:57:24,058 INFO L131 PetriNetUnfolder]: For 16/18 co-relation queries the response was YES. [2022-12-06 07:57:24,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 37 events. 7/37 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 66 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 50. Up to 9 conditions per place. [2022-12-06 07:57:24,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 23 transitions, 88 flow [2022-12-06 07:57:24,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-06 07:57:24,863 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1028] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_233| v_~f~0.base_181))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_181 (* v_~x2~0_436 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_181 (* .cse3 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_181 (* .cse2 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_181 (* .cse4 4))))) (and (= (ite (and (< .cse0 v_~size~0_187) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_258|) (= v_~x2~0_435 (select .cse1 (+ v_~f~0.offset_181 (* .cse0 4)))) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_346|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_344| 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_187)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_187)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_258| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_344|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_187)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_436) (< v_~x2~0_436 v_~size~0_187)) 1 0) 0)) (< (mod (+ 4294967291 |v_thread2Thread1of1ForFork1_~i~1#1_346|) 4294967296) (mod (+ 4294967292 v_~n~0_125) 4294967296)))))))) InVars {~x2~0=v_~x2~0_436, ~size~0=v_~size~0_187, ~f~0.base=v_~f~0.base_181, #memory_int=|v_#memory_int_233|, ~n~0=v_~n~0_125, ~f~0.offset=v_~f~0.offset_181} OutVars{~x2~0=v_~x2~0_435, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_47|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_31|, ~size~0=v_~size~0_187, ~f~0.base=v_~f~0.base_181, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_33|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_29|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_258|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_346|, ~f~0.offset=v_~f~0.offset_181, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_344|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_43|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_39|, #memory_int=|v_#memory_int_233|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_45|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_125, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] and [1026] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_11| 0) (= |v_thread1Thread1of1ForFork0_~i~0#1_39| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_39| 4294967296) (mod v_~n~0_121 4294967296))) (= |v_thread1Thread1of1ForFork0_#res#1.base_11| 0)) InVars {~n~0=v_~n~0_121} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_11|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_39|, ~n~0=v_~n~0_121, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:57:30,893 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1032] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse2 (select |v_#memory_int_239| v_~f~0.base_187))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_187 (* v_~x2~0_468 4))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_187 (* 4 .cse3))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_187 (* .cse4 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_187 (* .cse0 4))))) (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_13| 0) (not (= (ite (and (< .cse0 v_~size~0_193) (<= 0 .cse0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_13| 0) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_376|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_286| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_193)) 1 0)) (not (= (ite (and (<= 0 v_~x2~0_468) (< v_~x2~0_468 v_~size~0_193)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_187 (* .cse1 4))) v_~x2~0_467) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_286| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_372|) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_45| 4294967296) (mod v_~n~0_131 4294967296))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_372| 0)) (not (= (ite (and (< .cse3 v_~size~0_193) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| 0) (not (= 0 (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_193)) 1 0))))))))) InVars {~x2~0=v_~x2~0_468, ~size~0=v_~size~0_193, ~f~0.base=v_~f~0.base_187, #memory_int=|v_#memory_int_239|, ~n~0=v_~n~0_131, ~f~0.offset=v_~f~0.offset_187} OutVars{~x2~0=v_~x2~0_467, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_53|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_13|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_37|, ~size~0=v_~size~0_193, ~f~0.base=v_~f~0.base_187, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_286|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_376|, ~f~0.offset=v_~f~0.offset_187, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_372|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_49|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_45|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, #memory_int=|v_#memory_int_239|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_51|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_43|, ~n~0=v_~n~0_131, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_13|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#res#1.base] and [1024] L59-2-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_225| v_~f~0.base_175))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_175 (* v_~x2~0_420 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_175 (* .cse2 4))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_175 (* .cse0 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_175 (* .cse1 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_181) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_181)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_331| 0)) (not (= (ite (and (< .cse2 v_~size~0_181) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_331| (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_333|)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_333| 4294967296) (mod (+ 4294967292 v_~n~0_117) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_181)) 1 0)) (not (= (ite (and (< v_~x2~0_420 v_~size~0_181) (<= 0 v_~x2~0_420)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_175 (* 4 .cse3))) v_~x2~0_418) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_331|))))))) InVars {~x2~0=v_~x2~0_420, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_175, #memory_int=|v_#memory_int_225|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_333|, ~n~0=v_~n~0_117, ~f~0.offset=v_~f~0.offset_175} OutVars{~x2~0=v_~x2~0_418, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_45|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_23|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_29|, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_175, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_31|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_331|, ~f~0.offset=v_~f~0.offset_175, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_331|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_41|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_37|, #memory_int=|v_#memory_int_225|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_43|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_35|, ~n~0=v_~n~0_117, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_35|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:57:31,464 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:57:31,465 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7415 [2022-12-06 07:57:31,465 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 93 flow [2022-12-06 07:57:31,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-06 07:57:31,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:31,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:31,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:57:31,465 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:31,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:31,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1716468714, now seen corresponding path program 1 times [2022-12-06 07:57:31,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:31,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677799235] [2022-12-06 07:57:31,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:31,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:31,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:31,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677799235] [2022-12-06 07:57:31,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677799235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:31,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:31,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:57:31,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303707079] [2022-12-06 07:57:31,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:31,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:57:31,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:31,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:57:31,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:57:31,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:57:31,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:31,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:31,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:57:31,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:31,723 INFO L130 PetriNetUnfolder]: 87/157 cut-off events. [2022-12-06 07:57:31,723 INFO L131 PetriNetUnfolder]: For 178/178 co-relation queries the response was YES. [2022-12-06 07:57:31,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 157 events. 87/157 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 456 event pairs, 18 based on Foata normal form. 2/130 useless extension candidates. Maximal degree in co-relation 363. Up to 108 conditions per place. [2022-12-06 07:57:31,724 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 31 selfloop transitions, 3 changer transitions 2/36 dead transitions. [2022-12-06 07:57:31,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 36 transitions, 223 flow [2022-12-06 07:57:31,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:57:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:57:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 07:57:31,725 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2022-12-06 07:57:31,725 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 93 flow. Second operand 3 states and 37 transitions. [2022-12-06 07:57:31,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 36 transitions, 223 flow [2022-12-06 07:57:31,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 207 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 07:57:31,727 INFO L231 Difference]: Finished difference. Result has 28 places, 24 transitions, 110 flow [2022-12-06 07:57:31,727 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=28, PETRI_TRANSITIONS=24} [2022-12-06 07:57:31,728 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 7 predicate places. [2022-12-06 07:57:31,728 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:31,728 INFO L89 Accepts]: Start accepts. Operand has 28 places, 24 transitions, 110 flow [2022-12-06 07:57:31,729 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:31,729 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:31,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 24 transitions, 110 flow [2022-12-06 07:57:31,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 24 transitions, 110 flow [2022-12-06 07:57:31,757 INFO L130 PetriNetUnfolder]: 9/38 cut-off events. [2022-12-06 07:57:31,757 INFO L131 PetriNetUnfolder]: For 43/52 co-relation queries the response was YES. [2022-12-06 07:57:31,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 38 events. 9/38 cut-off events. For 43/52 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 86 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 76. Up to 10 conditions per place. [2022-12-06 07:57:31,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 24 transitions, 110 flow [2022-12-06 07:57:31,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 07:57:31,758 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:57:31,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 07:57:31,759 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 110 flow [2022-12-06 07:57:31,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:31,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:31,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:31,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:57:31,760 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:31,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash 815055265, now seen corresponding path program 1 times [2022-12-06 07:57:31,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:31,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433224329] [2022-12-06 07:57:31,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:31,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:31,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:31,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433224329] [2022-12-06 07:57:31,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433224329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:31,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:31,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:57:31,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890488574] [2022-12-06 07:57:31,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:31,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:57:31,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:31,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:57:31,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:57:31,895 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 07:57:31,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:31,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:31,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 07:57:31,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:31,994 INFO L130 PetriNetUnfolder]: 79/145 cut-off events. [2022-12-06 07:57:31,994 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2022-12-06 07:57:31,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 145 events. 79/145 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 390 event pairs, 39 based on Foata normal form. 4/138 useless extension candidates. Maximal degree in co-relation 403. Up to 141 conditions per place. [2022-12-06 07:57:31,995 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 26 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-06 07:57:31,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 28 transitions, 177 flow [2022-12-06 07:57:31,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:57:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:57:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 07:57:31,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2022-12-06 07:57:31,996 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 110 flow. Second operand 3 states and 26 transitions. [2022-12-06 07:57:31,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 28 transitions, 177 flow [2022-12-06 07:57:31,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 170 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 07:57:32,000 INFO L231 Difference]: Finished difference. Result has 28 places, 25 transitions, 117 flow [2022-12-06 07:57:32,000 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=28, PETRI_TRANSITIONS=25} [2022-12-06 07:57:32,000 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 7 predicate places. [2022-12-06 07:57:32,001 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:32,001 INFO L89 Accepts]: Start accepts. Operand has 28 places, 25 transitions, 117 flow [2022-12-06 07:57:32,001 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:32,001 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:32,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 25 transitions, 117 flow [2022-12-06 07:57:32,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 117 flow [2022-12-06 07:57:32,014 INFO L130 PetriNetUnfolder]: 8/40 cut-off events. [2022-12-06 07:57:32,014 INFO L131 PetriNetUnfolder]: For 44/53 co-relation queries the response was YES. [2022-12-06 07:57:32,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 40 events. 8/40 cut-off events. For 44/53 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 94 event pairs, 1 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 75. Up to 10 conditions per place. [2022-12-06 07:57:32,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 25 transitions, 117 flow [2022-12-06 07:57:32,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:57:33,051 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:57:33,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1051 [2022-12-06 07:57:33,052 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 113 flow [2022-12-06 07:57:33,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:33,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:33,053 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:33,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:57:33,053 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:33,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:33,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1919790320, now seen corresponding path program 1 times [2022-12-06 07:57:33,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:33,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061996512] [2022-12-06 07:57:33,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:33,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:33,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:33,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061996512] [2022-12-06 07:57:33,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061996512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:33,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:33,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:57:33,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801174] [2022-12-06 07:57:33,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:33,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:57:33,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:33,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:57:33,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:57:33,156 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 07:57:33,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-06 07:57:33,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:33,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 07:57:33,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:33,386 INFO L130 PetriNetUnfolder]: 110/204 cut-off events. [2022-12-06 07:57:33,387 INFO L131 PetriNetUnfolder]: For 348/348 co-relation queries the response was YES. [2022-12-06 07:57:33,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 204 events. 110/204 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 678 event pairs, 29 based on Foata normal form. 8/191 useless extension candidates. Maximal degree in co-relation 565. Up to 137 conditions per place. [2022-12-06 07:57:33,388 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 40 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2022-12-06 07:57:33,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 44 transitions, 277 flow [2022-12-06 07:57:33,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:57:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:57:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 07:57:33,391 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2022-12-06 07:57:33,393 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 113 flow. Second operand 4 states and 43 transitions. [2022-12-06 07:57:33,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 44 transitions, 277 flow [2022-12-06 07:57:33,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 44 transitions, 261 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 07:57:33,397 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 130 flow [2022-12-06 07:57:33,397 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2022-12-06 07:57:33,399 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 9 predicate places. [2022-12-06 07:57:33,399 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:33,399 INFO L89 Accepts]: Start accepts. Operand has 30 places, 26 transitions, 130 flow [2022-12-06 07:57:33,400 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:33,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:33,400 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 130 flow [2022-12-06 07:57:33,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 130 flow [2022-12-06 07:57:33,409 INFO L130 PetriNetUnfolder]: 10/53 cut-off events. [2022-12-06 07:57:33,409 INFO L131 PetriNetUnfolder]: For 54/65 co-relation queries the response was YES. [2022-12-06 07:57:33,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 53 events. 10/53 cut-off events. For 54/65 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 161 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 75. Up to 10 conditions per place. [2022-12-06 07:57:33,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 130 flow [2022-12-06 07:57:33,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-06 07:57:33,411 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:57:33,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 07:57:33,412 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 130 flow [2022-12-06 07:57:33,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-06 07:57:33,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:33,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:33,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:57:33,413 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:33,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:33,413 INFO L85 PathProgramCache]: Analyzing trace with hash -858517705, now seen corresponding path program 1 times [2022-12-06 07:57:33,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:33,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350997623] [2022-12-06 07:57:33,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:33,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:33,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:33,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350997623] [2022-12-06 07:57:33,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350997623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:33,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:33,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:57:33,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106412656] [2022-12-06 07:57:33,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:33,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:57:33,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:33,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:57:33,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:57:33,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 07:57:33,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:33,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:33,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 07:57:33,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:33,664 INFO L130 PetriNetUnfolder]: 113/211 cut-off events. [2022-12-06 07:57:33,664 INFO L131 PetriNetUnfolder]: For 394/394 co-relation queries the response was YES. [2022-12-06 07:57:33,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 211 events. 113/211 cut-off events. For 394/394 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 690 event pairs, 61 based on Foata normal form. 4/204 useless extension candidates. Maximal degree in co-relation 444. Up to 207 conditions per place. [2022-12-06 07:57:33,665 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 28 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-06 07:57:33,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 199 flow [2022-12-06 07:57:33,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:57:33,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:57:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 07:57:33,666 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2022-12-06 07:57:33,666 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 130 flow. Second operand 3 states and 26 transitions. [2022-12-06 07:57:33,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 199 flow [2022-12-06 07:57:33,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 194 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 07:57:33,668 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 137 flow [2022-12-06 07:57:33,668 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2022-12-06 07:57:33,669 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2022-12-06 07:57:33,669 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:33,669 INFO L89 Accepts]: Start accepts. Operand has 32 places, 27 transitions, 137 flow [2022-12-06 07:57:33,669 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:33,670 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:33,670 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 27 transitions, 137 flow [2022-12-06 07:57:33,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 137 flow [2022-12-06 07:57:33,696 INFO L130 PetriNetUnfolder]: 9/55 cut-off events. [2022-12-06 07:57:33,696 INFO L131 PetriNetUnfolder]: For 61/70 co-relation queries the response was YES. [2022-12-06 07:57:33,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 55 events. 9/55 cut-off events. For 61/70 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 191 event pairs, 1 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 103. Up to 10 conditions per place. [2022-12-06 07:57:33,696 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 27 transitions, 137 flow [2022-12-06 07:57:33,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 07:57:35,630 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:57:35,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1962 [2022-12-06 07:57:35,631 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 133 flow [2022-12-06 07:57:35,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:35,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:35,631 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:35,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:57:35,632 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:35,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:35,632 INFO L85 PathProgramCache]: Analyzing trace with hash -965779772, now seen corresponding path program 1 times [2022-12-06 07:57:35,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:35,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686010517] [2022-12-06 07:57:35,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:35,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:35,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:35,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686010517] [2022-12-06 07:57:35,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686010517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:35,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:35,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:57:35,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344191405] [2022-12-06 07:57:35,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:35,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:57:35,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:35,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:57:35,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:57:35,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 07:57:35,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-06 07:57:35,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:35,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 07:57:35,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:36,003 INFO L130 PetriNetUnfolder]: 111/207 cut-off events. [2022-12-06 07:57:36,004 INFO L131 PetriNetUnfolder]: For 390/390 co-relation queries the response was YES. [2022-12-06 07:57:36,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 207 events. 111/207 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 700 event pairs, 33 based on Foata normal form. 2/198 useless extension candidates. Maximal degree in co-relation 639. Up to 139 conditions per place. [2022-12-06 07:57:36,005 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 35 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2022-12-06 07:57:36,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 270 flow [2022-12-06 07:57:36,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:57:36,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:57:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 07:57:36,006 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2022-12-06 07:57:36,006 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 133 flow. Second operand 4 states and 38 transitions. [2022-12-06 07:57:36,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 270 flow [2022-12-06 07:57:36,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 258 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 07:57:36,009 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 157 flow [2022-12-06 07:57:36,010 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2022-12-06 07:57:36,010 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2022-12-06 07:57:36,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:36,010 INFO L89 Accepts]: Start accepts. Operand has 34 places, 28 transitions, 157 flow [2022-12-06 07:57:36,013 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:36,013 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:36,013 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 28 transitions, 157 flow [2022-12-06 07:57:36,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 28 transitions, 157 flow [2022-12-06 07:57:36,024 INFO L130 PetriNetUnfolder]: 12/60 cut-off events. [2022-12-06 07:57:36,025 INFO L131 PetriNetUnfolder]: For 95/106 co-relation queries the response was YES. [2022-12-06 07:57:36,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 60 events. 12/60 cut-off events. For 95/106 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 201 event pairs, 0 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 99. Up to 11 conditions per place. [2022-12-06 07:57:36,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 28 transitions, 157 flow [2022-12-06 07:57:36,025 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 07:57:36,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1033] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse1 (select |v_#memory_int_241| v_~f~0.base_189))) (let ((.cse12 (select .cse1 (+ v_~f~0.offset_189 (* v_~x2~0_476 4))))) (let ((.cse10 (select .cse1 (+ v_~f~0.offset_189 (* .cse12 4))))) (let ((.cse11 (select .cse1 (+ v_~f~0.offset_189 (* .cse10 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_189 (* .cse11 4))))) (let ((.cse8 (mod (+ 4294967292 v_~n~0_133) 4294967296)) (.cse6 (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_195)) 1 0))) (and (let ((.cse0 (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_380| 4294967296) (mod v_~n~0_133 4294967296))) (.cse2 (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_21|)) (.cse3 (= |v_thread2Thread1of1ForFork1_#res#1.offset_21| 0))) (or (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374| 0)) .cse0 (= |v_thread2Thread1of1ForFork1_~i~1#1_378| (+ |v_thread2Thread1of1ForFork1_~i~1#1_380| 1)) (= (select .cse1 (+ v_~f~0.offset_189 (* v_~x2~0_475 4))) v_~x2~0_471) .cse2 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_288| (ite (and (< v_~x2~0_475 v_~size~0_195) (<= 0 v_~x2~0_475)) 1 0)) .cse3 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_288| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|)) (and (= |v_thread2Thread1of1ForFork1_#t~post20#1_44| |v_thread2Thread1of1ForFork1_#t~post20#1_43|) (not .cse0) (= |v_thread2Thread1of1ForFork1_#t~mem19#1_56| |v_thread2Thread1of1ForFork1_#t~mem19#1_55|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_288| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_291|) (= v_~x2~0_475 v_~x2~0_471) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_377| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|) (= |v_thread2Thread1of1ForFork1_~i~1#1_378| |v_thread2Thread1of1ForFork1_~i~1#1_380|) .cse2 .cse3))) (let ((.cse5 (< 5 (mod (+ v_~n~0_133 4294967293) 4294967296))) (.cse4 (select .cse1 (+ v_~f~0.offset_189 (* .cse7 4))))) (or (and (= (ite (and (< .cse4 v_~size~0_195) (<= 0 .cse4)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_292|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_378| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_292| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_378|) .cse5 (= (select .cse1 (+ v_~f~0.offset_189 (* .cse4 4))) v_~x2~0_473) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_381|)) (and (= .cse6 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_378|) (= |v_thread2Thread1of1ForFork1_#t~post14#1_48| |v_thread2Thread1of1ForFork1_#t~post14#1_47|) (not .cse5) (= .cse4 v_~x2~0_473) (= |v_thread2Thread1of1ForFork1_#t~mem13#1_59| |v_thread2Thread1of1ForFork1_#t~mem13#1_60|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_292| .cse6) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_381|)))) (< 0 .cse8) (let ((.cse9 (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_381| 4294967296) (mod (+ 4294967294 v_~n~0_133) 4294967296)))) (or (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_376| 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_381| 1) |v_thread2Thread1of1ForFork1_~i~1#1_382|) .cse9 (= v_~x2~0_474 (select .cse1 (+ (* v_~x2~0_473 4) v_~f~0.offset_189))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_290| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_376|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_290| (ite (and (< v_~x2~0_473 v_~size~0_195) (<= 0 v_~x2~0_473)) 1 0))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_292| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_290|) (not .cse9) (= v_~x2~0_474 v_~x2~0_473) (= |v_thread2Thread1of1ForFork1_~i~1#1_382| |v_thread2Thread1of1ForFork1_~i~1#1_381|) (= |v_thread2Thread1of1ForFork1_#t~post16#1_44| |v_thread2Thread1of1ForFork1_#t~post16#1_43|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_376| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_378|) (= |v_thread2Thread1of1ForFork1_#t~mem15#1_59| |v_thread2Thread1of1ForFork1_#t~mem15#1_60|)))) (<= .cse8 5) (not (= (ite (and (< v_~x2~0_476 v_~size~0_195) (<= 0 v_~x2~0_476)) 1 0) 0)) (not (= .cse6 0)) (not (= (ite (and (< .cse10 v_~size~0_195) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_195)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_195) (<= 0 .cse12)) 1 0) 0)) (let ((.cse13 (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_382| 4294967296) (mod (+ 4294967295 v_~n~0_133) 4294967296)))) (or (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_291| (ite (and (< v_~x2~0_474 v_~size~0_195) (<= 0 v_~x2~0_474)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_291| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_377|) (= |v_thread2Thread1of1ForFork1_~i~1#1_380| (+ |v_thread2Thread1of1ForFork1_~i~1#1_382| 1)) (= (select .cse1 (+ v_~f~0.offset_189 (* v_~x2~0_474 4))) v_~x2~0_475) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_377| 0)) .cse13) (and (= |v_thread2Thread1of1ForFork1_#t~mem17#1_54| |v_thread2Thread1of1ForFork1_#t~mem17#1_53|) (= |v_thread2Thread1of1ForFork1_#t~post18#1_44| |v_thread2Thread1of1ForFork1_#t~post18#1_43|) (not .cse13) (= |v_thread2Thread1of1ForFork1_~i~1#1_380| |v_thread2Thread1of1ForFork1_~i~1#1_382|) (= v_~x2~0_475 v_~x2~0_474) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_377| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_376|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_291| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_290|))))))))))) InVars {~x2~0=v_~x2~0_476, thread2Thread1of1ForFork1_#t~mem13#1=|v_thread2Thread1of1ForFork1_#t~mem13#1_60|, ~size~0=v_~size~0_195, ~f~0.base=v_~f~0.base_189, ~f~0.offset=v_~f~0.offset_189, thread2Thread1of1ForFork1_#t~post16#1=|v_thread2Thread1of1ForFork1_#t~post16#1_44|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_48|, thread2Thread1of1ForFork1_#t~post20#1=|v_thread2Thread1of1ForFork1_#t~post20#1_44|, #memory_int=|v_#memory_int_241|, thread2Thread1of1ForFork1_#t~post18#1=|v_thread2Thread1of1ForFork1_#t~post18#1_44|, thread2Thread1of1ForFork1_#t~mem15#1=|v_thread2Thread1of1ForFork1_#t~mem15#1_60|, ~n~0=v_~n~0_133, thread2Thread1of1ForFork1_#t~mem17#1=|v_thread2Thread1of1ForFork1_#t~mem17#1_54|, thread2Thread1of1ForFork1_#t~mem19#1=|v_thread2Thread1of1ForFork1_#t~mem19#1_56|} OutVars{thread2Thread1of1ForFork1_#t~mem13#1=|v_thread2Thread1of1ForFork1_#t~mem13#1_59|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_55|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_33|, ~f~0.base=v_~f~0.base_189, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_21|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_288|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_378|, ~f~0.offset=v_~f~0.offset_189, thread2Thread1of1ForFork1_#t~post16#1=|v_thread2Thread1of1ForFork1_#t~post16#1_43|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_51|, thread2Thread1of1ForFork1_#t~post20#1=|v_thread2Thread1of1ForFork1_#t~post20#1_43|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_45|, thread2Thread1of1ForFork1_#t~mem15#1=|v_thread2Thread1of1ForFork1_#t~mem15#1_59|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_45|, thread2Thread1of1ForFork1_#t~mem19#1=|v_thread2Thread1of1ForFork1_#t~mem19#1_55|, ~x2~0=v_~x2~0_471, ~size~0=v_~size~0_195, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_39|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_21|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_47|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_47|, #memory_int=|v_#memory_int_241|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_53|, thread2Thread1of1ForFork1_#t~post18#1=|v_thread2Thread1of1ForFork1_#t~post18#1_43|, ~n~0=v_~n~0_133, thread2Thread1of1ForFork1_#t~mem17#1=|v_thread2Thread1of1ForFork1_#t~mem17#1_53|} AuxVars[|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_376|, |v_thread2Thread1of1ForFork1_~i~1#1_380|, |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_377|, |v_thread2Thread1of1ForFork1_~i~1#1_382|, |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_290|, |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_378|, |v_thread2Thread1of1ForFork1_~i~1#1_381|, v_~x2~0_475, v_~x2~0_474, v_~x2~0_473, |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_292|, |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_291|] AssignedVars[thread2Thread1of1ForFork1_#t~mem13#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post16#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~post20#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post18#1, thread2Thread1of1ForFork1_#t~mem15#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~mem17#1, thread2Thread1of1ForFork1_#t~mem19#1] and [998] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_10 (select (select |v_#memory_int_In_41| v_~f~0.base_In_29) (+ v_~f~0.offset_In_29 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (mod v_~n~0_In_1 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_20) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_8|)) InVars {~size~0=v_~size~0_In_20, ~f~0.base=v_~f~0.base_In_29, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_41|, ~n~0=v_~n~0_In_1, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_29} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_20, ~f~0.base=v_~f~0.base_In_29, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_8|, #memory_int=|v_#memory_int_In_41|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_1, ~x1~0=v_~x1~0_Out_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_14|, ~f~0.offset=v_~f~0.offset_In_29} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:57:42,728 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:57:42,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6719 [2022-12-06 07:57:42,729 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 155 flow [2022-12-06 07:57:42,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-06 07:57:42,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:42,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:42,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:57:42,730 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:42,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:42,730 INFO L85 PathProgramCache]: Analyzing trace with hash 916489657, now seen corresponding path program 1 times [2022-12-06 07:57:42,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:42,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946118673] [2022-12-06 07:57:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:42,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:42,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:42,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946118673] [2022-12-06 07:57:42,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946118673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:42,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:42,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:57:42,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351827676] [2022-12-06 07:57:42,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:42,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:57:42,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:42,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:57:42,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:57:42,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:57:42,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:42,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:42,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:57:42,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:42,982 INFO L130 PetriNetUnfolder]: 113/211 cut-off events. [2022-12-06 07:57:42,982 INFO L131 PetriNetUnfolder]: For 509/509 co-relation queries the response was YES. [2022-12-06 07:57:42,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 211 events. 113/211 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 688 event pairs, 55 based on Foata normal form. 4/204 useless extension candidates. Maximal degree in co-relation 556. Up to 207 conditions per place. [2022-12-06 07:57:42,984 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-12-06 07:57:42,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 226 flow [2022-12-06 07:57:42,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:57:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:57:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-06 07:57:42,985 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-06 07:57:42,986 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 155 flow. Second operand 3 states and 27 transitions. [2022-12-06 07:57:42,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 226 flow [2022-12-06 07:57:42,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 214 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 07:57:42,987 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 155 flow [2022-12-06 07:57:42,988 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2022-12-06 07:57:42,988 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 12 predicate places. [2022-12-06 07:57:42,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:42,988 INFO L89 Accepts]: Start accepts. Operand has 33 places, 28 transitions, 155 flow [2022-12-06 07:57:42,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:42,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:42,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 28 transitions, 155 flow [2022-12-06 07:57:42,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 28 transitions, 155 flow [2022-12-06 07:57:42,999 INFO L130 PetriNetUnfolder]: 11/61 cut-off events. [2022-12-06 07:57:42,999 INFO L131 PetriNetUnfolder]: For 88/99 co-relation queries the response was YES. [2022-12-06 07:57:42,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 61 events. 11/61 cut-off events. For 88/99 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 224 event pairs, 1 based on Foata normal form. 1/56 useless extension candidates. Maximal degree in co-relation 120. Up to 11 conditions per place. [2022-12-06 07:57:43,000 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 28 transitions, 155 flow [2022-12-06 07:57:43,000 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 07:57:46,102 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:57:46,103 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3115 [2022-12-06 07:57:46,103 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 151 flow [2022-12-06 07:57:46,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:46,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:46,103 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:46,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:57:46,103 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:46,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1080296376, now seen corresponding path program 2 times [2022-12-06 07:57:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:46,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863139182] [2022-12-06 07:57:46,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:46,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:46,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:46,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863139182] [2022-12-06 07:57:46,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863139182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:46,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:46,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:57:46,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500743150] [2022-12-06 07:57:46,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:46,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:57:46,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:46,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:57:46,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:57:46,183 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:57:46,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-06 07:57:46,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:46,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:57:46,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:46,438 INFO L130 PetriNetUnfolder]: 111/207 cut-off events. [2022-12-06 07:57:46,438 INFO L131 PetriNetUnfolder]: For 442/442 co-relation queries the response was YES. [2022-12-06 07:57:46,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 207 events. 111/207 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 694 event pairs, 33 based on Foata normal form. 2/198 useless extension candidates. Maximal degree in co-relation 661. Up to 141 conditions per place. [2022-12-06 07:57:46,440 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 34 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2022-12-06 07:57:46,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 279 flow [2022-12-06 07:57:46,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:57:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:57:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 07:57:46,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2022-12-06 07:57:46,441 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 151 flow. Second operand 4 states and 38 transitions. [2022-12-06 07:57:46,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 279 flow [2022-12-06 07:57:46,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 267 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 07:57:46,443 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 179 flow [2022-12-06 07:57:46,443 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2022-12-06 07:57:46,443 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-06 07:57:46,443 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:46,443 INFO L89 Accepts]: Start accepts. Operand has 35 places, 29 transitions, 179 flow [2022-12-06 07:57:46,444 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:46,444 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:46,444 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 179 flow [2022-12-06 07:57:46,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 179 flow [2022-12-06 07:57:46,455 INFO L130 PetriNetUnfolder]: 13/62 cut-off events. [2022-12-06 07:57:46,456 INFO L131 PetriNetUnfolder]: For 133/148 co-relation queries the response was YES. [2022-12-06 07:57:46,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 62 events. 13/62 cut-off events. For 133/148 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 205 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 117. Up to 13 conditions per place. [2022-12-06 07:57:46,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 179 flow [2022-12-06 07:57:46,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 07:57:46,462 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1029] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_235| v_~f~0.base_183))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_183 (* v_~x2~0_446 4))))) (let ((.cse1 (select .cse3 (+ (* .cse0 4) v_~f~0.offset_183)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_183 (* .cse1 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_266| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_352|) (not (= (ite (and (< .cse0 v_~size~0_189) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_189)) 1 0) 0)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_19|) (= |v_thread2Thread1of1ForFork1_~i~1#1_356| 4) (<= (mod (+ 4294967292 v_~n~0_127) 4294967296) (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_356|) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_266| (ite (and (< .cse2 v_~size~0_189) (<= 0 .cse2)) 1 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_19| 0) (not (= (ite (and (<= 0 v_~x2~0_446) (< v_~x2~0_446 v_~size~0_189)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_352| 0)) (= v_~x2~0_445 (select .cse3 (+ v_~f~0.offset_183 (* .cse2 4))))))))) InVars {~x2~0=v_~x2~0_446, ~size~0=v_~size~0_189, ~f~0.base=v_~f~0.base_183, ~f~0.offset=v_~f~0.offset_183, #memory_int=|v_#memory_int_235|, ~n~0=v_~n~0_127} OutVars{~x2~0=v_~x2~0_445, thread2Thread1of1ForFork1_#t~mem13#1=|v_thread2Thread1of1ForFork1_#t~mem13#1_55|, ~size~0=v_~size~0_189, ~f~0.base=v_~f~0.base_183, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_19|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_266|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_356|, ~f~0.offset=v_~f~0.offset_183, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_352|, thread2Thread1of1ForFork1_#t~post16#1=|v_thread2Thread1of1ForFork1_#t~post16#1_39|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_19|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_43|, thread2Thread1of1ForFork1_#t~post20#1=|v_thread2Thread1of1ForFork1_#t~post20#1_39|, #memory_int=|v_#memory_int_235|, thread2Thread1of1ForFork1_#t~post18#1=|v_thread2Thread1of1ForFork1_#t~post18#1_39|, thread2Thread1of1ForFork1_#t~mem15#1=|v_thread2Thread1of1ForFork1_#t~mem15#1_55|, ~n~0=v_~n~0_127, thread2Thread1of1ForFork1_#t~mem17#1=|v_thread2Thread1of1ForFork1_#t~mem17#1_49|, thread2Thread1of1ForFork1_#t~mem19#1=|v_thread2Thread1of1ForFork1_#t~mem19#1_51|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~mem13#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post16#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~post20#1, thread2Thread1of1ForFork1_#t~post18#1, thread2Thread1of1ForFork1_#t~mem15#1, thread2Thread1of1ForFork1_#t~mem17#1, thread2Thread1of1ForFork1_#t~mem19#1] and [998] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_10 (select (select |v_#memory_int_In_41| v_~f~0.base_In_29) (+ v_~f~0.offset_In_29 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (mod v_~n~0_In_1 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_20) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_8|)) InVars {~size~0=v_~size~0_In_20, ~f~0.base=v_~f~0.base_In_29, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_41|, ~n~0=v_~n~0_In_1, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_29} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_20, ~f~0.base=v_~f~0.base_In_29, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_8|, #memory_int=|v_#memory_int_In_41|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_1, ~x1~0=v_~x1~0_Out_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_14|, ~f~0.offset=v_~f~0.offset_In_29} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:57:46,813 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:57:46,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 371 [2022-12-06 07:57:46,814 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 177 flow [2022-12-06 07:57:46,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-06 07:57:46,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:46,814 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:46,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:57:46,814 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:46,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:46,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1015459322, now seen corresponding path program 1 times [2022-12-06 07:57:46,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:46,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439489379] [2022-12-06 07:57:46,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:46,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:46,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:46,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439489379] [2022-12-06 07:57:46,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439489379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:46,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:46,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:57:46,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210426834] [2022-12-06 07:57:46,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:46,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:57:46,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:46,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:57:46,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:57:46,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:57:46,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:46,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:46,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:57:46,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:47,186 INFO L130 PetriNetUnfolder]: 113/211 cut-off events. [2022-12-06 07:57:47,186 INFO L131 PetriNetUnfolder]: For 601/601 co-relation queries the response was YES. [2022-12-06 07:57:47,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 211 events. 113/211 cut-off events. For 601/601 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 691 event pairs, 49 based on Foata normal form. 4/204 useless extension candidates. Maximal degree in co-relation 580. Up to 207 conditions per place. [2022-12-06 07:57:47,188 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 30 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2022-12-06 07:57:47,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 250 flow [2022-12-06 07:57:47,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:57:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:57:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-06 07:57:47,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4057971014492754 [2022-12-06 07:57:47,189 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 177 flow. Second operand 3 states and 28 transitions. [2022-12-06 07:57:47,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 250 flow [2022-12-06 07:57:47,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 228 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 07:57:47,191 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 167 flow [2022-12-06 07:57:47,191 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2022-12-06 07:57:47,191 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2022-12-06 07:57:47,191 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:47,191 INFO L89 Accepts]: Start accepts. Operand has 34 places, 29 transitions, 167 flow [2022-12-06 07:57:47,192 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:47,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:47,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 29 transitions, 167 flow [2022-12-06 07:57:47,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 29 transitions, 167 flow [2022-12-06 07:57:47,202 INFO L130 PetriNetUnfolder]: 13/67 cut-off events. [2022-12-06 07:57:47,202 INFO L131 PetriNetUnfolder]: For 105/118 co-relation queries the response was YES. [2022-12-06 07:57:47,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 67 events. 13/67 cut-off events. For 105/118 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 251 event pairs, 1 based on Foata normal form. 2/63 useless extension candidates. Maximal degree in co-relation 137. Up to 15 conditions per place. [2022-12-06 07:57:47,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 29 transitions, 167 flow [2022-12-06 07:57:47,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 07:57:52,337 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:57:52,338 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5147 [2022-12-06 07:57:52,338 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 163 flow [2022-12-06 07:57:52,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:52,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:52,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:52,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 07:57:52,339 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:52,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:52,339 INFO L85 PathProgramCache]: Analyzing trace with hash -765375715, now seen corresponding path program 1 times [2022-12-06 07:57:52,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:52,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75723712] [2022-12-06 07:57:52,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:52,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:52,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:52,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75723712] [2022-12-06 07:57:52,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75723712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:52,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:52,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:57:52,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766093663] [2022-12-06 07:57:52,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:52,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:57:52,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:52,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:57:52,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:57:52,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:57:52,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-06 07:57:52,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:52,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:57:52,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:52,907 INFO L130 PetriNetUnfolder]: 111/207 cut-off events. [2022-12-06 07:57:52,908 INFO L131 PetriNetUnfolder]: For 505/505 co-relation queries the response was YES. [2022-12-06 07:57:52,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 207 events. 111/207 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 688 event pairs, 33 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 677. Up to 141 conditions per place. [2022-12-06 07:57:52,909 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 34 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2022-12-06 07:57:52,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 282 flow [2022-12-06 07:57:52,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:57:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:57:52,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 07:57:52,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41304347826086957 [2022-12-06 07:57:52,910 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 163 flow. Second operand 4 states and 38 transitions. [2022-12-06 07:57:52,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 282 flow [2022-12-06 07:57:52,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 270 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 07:57:52,912 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 177 flow [2022-12-06 07:57:52,912 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2022-12-06 07:57:52,913 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-06 07:57:52,913 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:52,913 INFO L89 Accepts]: Start accepts. Operand has 35 places, 29 transitions, 177 flow [2022-12-06 07:57:52,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:52,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:52,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 177 flow [2022-12-06 07:57:52,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 177 flow [2022-12-06 07:57:52,925 INFO L130 PetriNetUnfolder]: 13/62 cut-off events. [2022-12-06 07:57:52,925 INFO L131 PetriNetUnfolder]: For 115/129 co-relation queries the response was YES. [2022-12-06 07:57:52,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 62 events. 13/62 cut-off events. For 115/129 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 202 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 118. Up to 14 conditions per place. [2022-12-06 07:57:52,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 177 flow [2022-12-06 07:57:52,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 07:57:52,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:57:52,932 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork1_~i~1#1_418 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) 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) [2022-12-06 07:57:52,936 INFO L158 Benchmark]: Toolchain (without parser) took 62185.52ms. Allocated memory was 188.7MB in the beginning and 339.7MB in the end (delta: 151.0MB). Free memory was 165.1MB in the beginning and 272.0MB in the end (delta: -106.9MB). Peak memory consumption was 44.6MB. Max. memory is 8.0GB. [2022-12-06 07:57:52,936 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 164.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:57:52,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.81ms. Allocated memory is still 188.7MB. Free memory was 164.6MB in the beginning and 152.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 07:57:52,936 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.60ms. Allocated memory is still 188.7MB. Free memory was 152.5MB in the beginning and 150.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:57:52,937 INFO L158 Benchmark]: Boogie Preprocessor took 25.72ms. Allocated memory is still 188.7MB. Free memory was 150.4MB in the beginning and 148.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:57:52,937 INFO L158 Benchmark]: RCFGBuilder took 592.55ms. Allocated memory is still 188.7MB. Free memory was 148.3MB in the beginning and 128.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 07:57:52,937 INFO L158 Benchmark]: TraceAbstraction took 61278.29ms. Allocated memory was 188.7MB in the beginning and 339.7MB in the end (delta: 151.0MB). Free memory was 127.9MB in the beginning and 272.0MB in the end (delta: -144.1MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2022-12-06 07:57:52,938 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 164.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.81ms. Allocated memory is still 188.7MB. Free memory was 164.6MB in the beginning and 152.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.60ms. Allocated memory is still 188.7MB. Free memory was 152.5MB in the beginning and 150.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.72ms. Allocated memory is still 188.7MB. Free memory was 150.4MB in the beginning and 148.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 592.55ms. Allocated memory is still 188.7MB. Free memory was 148.3MB in the beginning and 128.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 61278.29ms. Allocated memory was 188.7MB in the beginning and 339.7MB in the end (delta: 151.0MB). Free memory was 127.9MB in the beginning and 272.0MB in the end (delta: -144.1MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.5s, 220 PlacesBefore, 21 PlacesAfterwards, 237 TransitionsBefore, 17 TransitionsAfterwards, 6892 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 64 TrivialYvCompositions, 135 ConcurrentYvCompositions, 17 ChoiceCompositions, 216 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4270, independent: 4268, independent conditional: 4268, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4270, independent: 4268, independent conditional: 0, independent unconditional: 4268, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4270, independent: 4268, independent conditional: 0, independent unconditional: 4268, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4270, independent: 4268, independent conditional: 0, independent unconditional: 4268, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3913, independent: 3911, independent conditional: 0, independent unconditional: 3911, 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: 3913, independent: 3911, independent conditional: 0, independent unconditional: 3911, 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: 4270, independent: 357, independent conditional: 0, independent unconditional: 357, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3913, unknown conditional: 0, unknown unconditional: 3913] , Statistics on independence cache: Total cache size (in pairs): 7727, Positive cache size: 7725, Positive conditional cache size: 0, Positive unconditional cache size: 7725, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 24 PlacesBefore, 23 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 15, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 3, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 3, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 17, Positive conditional cache size: 10, Positive unconditional cache size: 7, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 26 PlacesBefore, 24 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 10, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4s, 26 PlacesBefore, 25 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 3, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 35, Positive conditional cache size: 13, Positive unconditional cache size: 22, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 35, Positive conditional cache size: 13, Positive unconditional cache size: 22, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 28 PlacesBefore, 27 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 38, Positive conditional cache size: 16, Positive unconditional cache size: 22, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 38, Positive conditional cache size: 16, Positive unconditional cache size: 22, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 32 PlacesBefore, 31 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 41, Positive conditional cache size: 19, Positive unconditional cache size: 22, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 34 PlacesBefore, 33 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 42, Positive conditional cache size: 20, Positive unconditional cache size: 22, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 33 PlacesBefore, 32 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 45, Positive conditional cache size: 23, Positive unconditional cache size: 22, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 35 PlacesBefore, 34 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 46, Positive conditional cache size: 24, Positive unconditional cache size: 22, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 34 PlacesBefore, 33 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 49, Positive conditional cache size: 27, Positive unconditional cache size: 22, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork1_~i~1#1_418 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork1_~i~1#1_418 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:57:52,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...