/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 03:53:38,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 03:53:38,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 03:53:38,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 03:53:38,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 03:53:38,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 03:53:38,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 03:53:38,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 03:53:38,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 03:53:38,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 03:53:38,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 03:53:38,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 03:53:38,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 03:53:38,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 03:53:38,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 03:53:38,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 03:53:38,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 03:53:38,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 03:53:38,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 03:53:38,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 03:53:38,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 03:53:38,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 03:53:38,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 03:53:38,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 03:53:38,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 03:53:38,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 03:53:38,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 03:53:38,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 03:53:38,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 03:53:38,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 03:53:38,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 03:53:38,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 03:53:38,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 03:53:38,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 03:53:38,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 03:53:38,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 03:53:38,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 03:53:38,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 03:53:38,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 03:53:38,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 03:53:38,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 03:53:38,796 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 03:53:38,825 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 03:53:38,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 03:53:38,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 03:53:38,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 03:53:38,826 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 03:53:38,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 03:53:38,827 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 03:53:38,827 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 03:53:38,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 03:53:38,827 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 03:53:38,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 03:53:38,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 03:53:38,828 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 03:53:38,828 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 03:53:38,828 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 03:53:38,828 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 03:53:38,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 03:53:38,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 03:53:38,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 03:53:38,829 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 03:53:38,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 03:53:38,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:53:38,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 03:53:38,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 03:53:38,829 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 03:53:38,829 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 03:53:38,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 03:53:38,830 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 03:53:38,830 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 03:53:39,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 03:53:39,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 03:53:39,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 03:53:39,118 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 03:53:39,119 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 03:53:39,119 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2022-12-06 03:53:40,157 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 03:53:40,391 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 03:53:40,392 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2022-12-06 03:53:40,401 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b3ae1ab4/6047da07526a45d7bc277a325e32a773/FLAGc734f05a7 [2022-12-06 03:53:40,414 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b3ae1ab4/6047da07526a45d7bc277a325e32a773 [2022-12-06 03:53:40,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 03:53:40,416 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 03:53:40,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 03:53:40,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 03:53:40,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 03:53:40,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:53:40" (1/1) ... [2022-12-06 03:53:40,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c391254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:53:40, skipping insertion in model container [2022-12-06 03:53:40,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:53:40" (1/1) ... [2022-12-06 03:53:40,427 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 03:53:40,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 03:53:40,808 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2022-12-06 03:53:40,814 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2022-12-06 03:53:40,817 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2022-12-06 03:53:40,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:53:40,829 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 03:53:40,870 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2022-12-06 03:53:40,874 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2022-12-06 03:53:40,878 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2022-12-06 03:53:40,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:53:40,932 INFO L208 MainTranslator]: Completed translation [2022-12-06 03:53:40,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:53:40 WrapperNode [2022-12-06 03:53:40,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 03:53:40,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 03:53:40,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 03:53:40,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 03:53:40,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:53:40" (1/1) ... [2022-12-06 03:53:40,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:53:40" (1/1) ... [2022-12-06 03:53:40,991 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2022-12-06 03:53:40,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 03:53:40,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 03:53:40,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 03:53:40,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 03:53:40,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:53:40" (1/1) ... [2022-12-06 03:53:40,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:53:40" (1/1) ... [2022-12-06 03:53:41,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:53:40" (1/1) ... [2022-12-06 03:53:41,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:53:40" (1/1) ... [2022-12-06 03:53:41,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:53:40" (1/1) ... [2022-12-06 03:53:41,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:53:40" (1/1) ... [2022-12-06 03:53:41,030 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:53:40" (1/1) ... [2022-12-06 03:53:41,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:53:40" (1/1) ... [2022-12-06 03:53:41,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 03:53:41,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 03:53:41,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 03:53:41,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 03:53:41,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:53:40" (1/1) ... [2022-12-06 03:53:41,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:53:41,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:41,063 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 03:53:41,068 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 03:53:41,104 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 03:53:41,104 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 03:53:41,104 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 03:53:41,105 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 03:53:41,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 03:53:41,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 03:53:41,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 03:53:41,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 03:53:41,105 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 03:53:41,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 03:53:41,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 03:53:41,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 03:53:41,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 03:53:41,106 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 03:53:41,288 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 03:53:41,290 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 03:53:41,705 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 03:53:41,714 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 03:53:41,714 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 03:53:41,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:53:41 BoogieIcfgContainer [2022-12-06 03:53:41,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 03:53:41,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 03:53:41,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 03:53:41,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 03:53:41,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 03:53:40" (1/3) ... [2022-12-06 03:53:41,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c00c420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:53:41, skipping insertion in model container [2022-12-06 03:53:41,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:53:40" (2/3) ... [2022-12-06 03:53:41,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c00c420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:53:41, skipping insertion in model container [2022-12-06 03:53:41,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:53:41" (3/3) ... [2022-12-06 03:53:41,724 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2022-12-06 03:53:41,741 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 03:53:41,741 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-06 03:53:41,742 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 03:53:41,849 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 03:53:41,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 256 transitions, 528 flow [2022-12-06 03:53:41,954 INFO L130 PetriNetUnfolder]: 15/254 cut-off events. [2022-12-06 03:53:41,955 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:53:41,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 254 events. 15/254 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 363 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 183. Up to 2 conditions per place. [2022-12-06 03:53:41,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 256 transitions, 528 flow [2022-12-06 03:53:41,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 237 places, 245 transitions, 499 flow [2022-12-06 03:53:41,985 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:41,998 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 245 transitions, 499 flow [2022-12-06 03:53:42,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 245 transitions, 499 flow [2022-12-06 03:53:42,036 INFO L130 PetriNetUnfolder]: 15/245 cut-off events. [2022-12-06 03:53:42,036 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 03:53:42,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 245 events. 15/245 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 332 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 183. Up to 2 conditions per place. [2022-12-06 03:53:42,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 245 transitions, 499 flow [2022-12-06 03:53:42,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 15600 [2022-12-06 03:53:49,988 INFO L203 LiptonReduction]: Total number of compositions: 192 [2022-12-06 03:53:50,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 03:53:50,022 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;@14a90d83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 03:53:50,022 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 03:53:50,023 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-06 03:53:50,023 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:53:50,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:50,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1] [2022-12-06 03:53:50,024 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:53:50,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:50,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1001, now seen corresponding path program 1 times [2022-12-06 03:53:50,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:50,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109914013] [2022-12-06 03:53:50,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:50,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:50,124 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 03:53:50,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:50,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109914013] [2022-12-06 03:53:50,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109914013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:50,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:53:50,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-06 03:53:50,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951447846] [2022-12-06 03:53:50,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:50,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 03:53:50,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:50,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 03:53:50,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 03:53:50,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 72 [2022-12-06 03:53:50,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 72 transitions, 153 flow. Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:50,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:50,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 72 [2022-12-06 03:53:50,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:50,380 INFO L130 PetriNetUnfolder]: 1465/2555 cut-off events. [2022-12-06 03:53:50,380 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-06 03:53:50,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4904 conditions, 2555 events. 1465/2555 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 12526 event pairs, 1167 based on Foata normal form. 28/2017 useless extension candidates. Maximal degree in co-relation 4773. Up to 2271 conditions per place. [2022-12-06 03:53:50,391 INFO L137 encePairwiseOnDemand]: 66/72 looper letters, 54 selfloop transitions, 0 changer transitions 0/66 dead transitions. [2022-12-06 03:53:50,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 249 flow [2022-12-06 03:53:50,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 03:53:50,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 03:53:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2022-12-06 03:53:50,400 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 03:53:50,401 INFO L175 Difference]: Start difference. First operand has 68 places, 72 transitions, 153 flow. Second operand 2 states and 84 transitions. [2022-12-06 03:53:50,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 249 flow [2022-12-06 03:53:50,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 66 transitions, 244 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 03:53:50,406 INFO L231 Difference]: Finished difference. Result has 63 places, 66 transitions, 136 flow [2022-12-06 03:53:50,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=136, PETRI_PLACES=63, PETRI_TRANSITIONS=66} [2022-12-06 03:53:50,409 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2022-12-06 03:53:50,410 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:50,410 INFO L89 Accepts]: Start accepts. Operand has 63 places, 66 transitions, 136 flow [2022-12-06 03:53:50,411 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:50,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:50,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 66 transitions, 136 flow [2022-12-06 03:53:50,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 66 transitions, 136 flow [2022-12-06 03:53:50,420 INFO L130 PetriNetUnfolder]: 8/66 cut-off events. [2022-12-06 03:53:50,421 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:53:50,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 66 events. 8/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 123 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2022-12-06 03:53:50,422 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 66 transitions, 136 flow [2022-12-06 03:53:50,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 1874 [2022-12-06 03:53:50,543 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:53:50,547 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 03:53:50,548 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 65 transitions, 134 flow [2022-12-06 03:53:50,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:50,548 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:50,548 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:50,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 03:53:50,549 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:53:50,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:50,554 INFO L85 PathProgramCache]: Analyzing trace with hash 21675408, now seen corresponding path program 1 times [2022-12-06 03:53:50,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:50,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118786354] [2022-12-06 03:53:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:50,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:50,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:50,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118786354] [2022-12-06 03:53:50,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118786354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:50,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:53:50,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:53:50,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512733874] [2022-12-06 03:53:50,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:50,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:53:50,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:50,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:53:50,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:53:50,769 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 65 [2022-12-06 03:53:50,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 65 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 03:53:50,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:50,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 65 [2022-12-06 03:53:50,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:50,949 INFO L130 PetriNetUnfolder]: 1308/2296 cut-off events. [2022-12-06 03:53:50,949 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 03:53:50,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4508 conditions, 2296 events. 1308/2296 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9503 event pairs, 668 based on Foata normal form. 62/1821 useless extension candidates. Maximal degree in co-relation 3872. Up to 1123 conditions per place. [2022-12-06 03:53:50,996 INFO L137 encePairwiseOnDemand]: 61/65 looper letters, 74 selfloop transitions, 3 changer transitions 5/91 dead transitions. [2022-12-06 03:53:50,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 91 transitions, 353 flow [2022-12-06 03:53:50,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:53:50,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:53:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-12-06 03:53:50,998 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-06 03:53:50,998 INFO L175 Difference]: Start difference. First operand has 61 places, 65 transitions, 134 flow. Second operand 3 states and 110 transitions. [2022-12-06 03:53:50,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 91 transitions, 353 flow [2022-12-06 03:53:50,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 91 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 03:53:51,000 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 141 flow [2022-12-06 03:53:51,000 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2022-12-06 03:53:51,001 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2022-12-06 03:53:51,001 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:51,001 INFO L89 Accepts]: Start accepts. Operand has 64 places, 62 transitions, 141 flow [2022-12-06 03:53:51,001 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:51,001 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:51,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 62 transitions, 141 flow [2022-12-06 03:53:51,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 62 transitions, 141 flow [2022-12-06 03:53:51,007 INFO L130 PetriNetUnfolder]: 17/113 cut-off events. [2022-12-06 03:53:51,008 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 03:53:51,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 113 events. 17/113 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 155 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2022-12-06 03:53:51,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 62 transitions, 141 flow [2022-12-06 03:53:51,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 1280 [2022-12-06 03:53:51,067 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:51,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 03:53:51,068 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 141 flow [2022-12-06 03:53:51,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 03:53:51,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:51,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:51,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 03:53:51,069 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:53:51,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1954713350, now seen corresponding path program 1 times [2022-12-06 03:53:51,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:51,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784144632] [2022-12-06 03:53:51,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:51,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:51,749 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 03:53:51,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:51,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784144632] [2022-12-06 03:53:51,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784144632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:51,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:53:51,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 03:53:51,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539917006] [2022-12-06 03:53:51,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:51,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:53:51,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:51,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:53:51,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:53:51,751 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2022-12-06 03:53:51,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 141 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 03:53:51,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:51,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2022-12-06 03:53:51,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:52,651 INFO L130 PetriNetUnfolder]: 1321/2298 cut-off events. [2022-12-06 03:53:52,651 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-06 03:53:52,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4589 conditions, 2298 events. 1321/2298 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9291 event pairs, 975 based on Foata normal form. 12/1830 useless extension candidates. Maximal degree in co-relation 4090. Up to 2071 conditions per place. [2022-12-06 03:53:52,660 INFO L137 encePairwiseOnDemand]: 53/61 looper letters, 56 selfloop transitions, 9 changer transitions 9/83 dead transitions. [2022-12-06 03:53:52,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 333 flow [2022-12-06 03:53:52,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 03:53:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 03:53:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2022-12-06 03:53:52,664 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28688524590163933 [2022-12-06 03:53:52,664 INFO L175 Difference]: Start difference. First operand has 60 places, 62 transitions, 141 flow. Second operand 8 states and 140 transitions. [2022-12-06 03:53:52,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 333 flow [2022-12-06 03:53:52,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 03:53:52,668 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 200 flow [2022-12-06 03:53:52,668 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=200, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2022-12-06 03:53:52,669 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 4 predicate places. [2022-12-06 03:53:52,669 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:52,669 INFO L89 Accepts]: Start accepts. Operand has 72 places, 70 transitions, 200 flow [2022-12-06 03:53:52,671 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:52,671 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:52,671 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 70 transitions, 200 flow [2022-12-06 03:53:52,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 70 transitions, 200 flow [2022-12-06 03:53:52,686 INFO L130 PetriNetUnfolder]: 30/186 cut-off events. [2022-12-06 03:53:52,686 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:53:52,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 186 events. 30/186 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 488 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 206. Up to 12 conditions per place. [2022-12-06 03:53:52,688 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 70 transitions, 200 flow [2022-12-06 03:53:52,688 INFO L188 LiptonReduction]: Number of co-enabled transitions 1268 [2022-12-06 03:53:52,691 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [928] L1010-1-->L980-1: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_205| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_29|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_205|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_43| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_31|) (= (select (select |v_#memory_int_592| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_205|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_205| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|)) InVars {t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_31|, #memory_int=|v_#memory_int_592|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_29|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_29|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_205|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_79|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_205|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_31|, #memory_int=|v_#memory_int_592|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_43|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_63|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_111|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_29|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_69|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_71|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] and [911] L1062-4-->L1063-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_58|) (= (+ |v_#pthreadsForks_58| 1) |v_#pthreadsForks_57|) (= (store |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35| (store (select |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35|) |v_ULTIMATE.start_main_~#id2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre64#1_33|)) |v_#memory_int_486|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_58|, #memory_int=|v_#memory_int_487|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_27|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_486|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_9|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-06 03:53:52,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [952] $Ultimate##0-->L1010-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_208| |v_~#m~0.base_102|))) (and (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_33| |v_~#queue~0.base_81|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_33| |v_~#queue~0.offset_76|) (= (store |v_#pthreadsMutex_208| |v_~#m~0.base_102| (store .cse0 |v_~#m~0.offset_102| 1)) |v_#pthreadsMutex_207|) (= |v_t1Thread1of1ForFork0_#t~nondet50#1_32| |v_t1Thread1of1ForFork0_~value~0#1_75|) (<= |v_t1Thread1of1ForFork0_#t~nondet50#1_32| 2147483647) (= |v_t1Thread1of1ForFork0_~arg#1.base_23| |v_t1Thread1of1ForFork0_#in~arg#1.base_23|) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet50#1_32| 2147483648)) (= (select .cse0 |v_~#m~0.offset_102|) 0) (= |v_t1Thread1of1ForFork0_#in~arg#1.offset_23| |v_t1Thread1of1ForFork0_~arg#1.offset_23|) (= |v_t1Thread1of1ForFork0_enqueue_#in~x#1_35| |v_t1Thread1of1ForFork0_~value~0#1_75|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_208|, ~#m~0.base=|v_~#m~0.base_102|, ~#queue~0.base=|v_~#queue~0.base_81|, t1Thread1of1ForFork0_#t~nondet50#1=|v_t1Thread1of1ForFork0_#t~nondet50#1_32|, ~#m~0.offset=|v_~#m~0.offset_102|, ~#queue~0.offset=|v_~#queue~0.offset_76|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_23|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_23|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_207|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_73|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_23|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_75|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_23|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_33|, ~#m~0.base=|v_~#m~0.base_102|, ~#queue~0.base=|v_~#queue~0.base_81|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_35|, ~#m~0.offset=|v_~#m~0.offset_102|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_27|, ~#queue~0.offset=|v_~#queue~0.offset_76|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_23|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_33|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_23|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_#t~nondet50#1, t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_~arg#1.offset, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_enqueue_#in~x#1, t1Thread1of1ForFork0_#t~nondet49#1, t1Thread1of1ForFork0_~arg#1.base, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~q#1.base] and [911] L1062-4-->L1063-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_58|) (= (+ |v_#pthreadsForks_58| 1) |v_#pthreadsForks_57|) (= (store |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35| (store (select |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35|) |v_ULTIMATE.start_main_~#id2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre64#1_33|)) |v_#memory_int_486|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_58|, #memory_int=|v_#memory_int_487|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_27|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_486|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_9|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-06 03:53:53,161 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [975] $Ultimate##0-->L1063-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_404| |v_~#m~0.base_182|))) (and (= (select .cse0 |v_~#m~0.offset_182|) 0) (= (+ |v_#pthreadsForks_268| 1) |v_#pthreadsForks_267|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_95| |v_~#queue~0.base_153|) (= |v_t1Thread1of1ForFork0_#in~arg#1.offset_47| |v_t1Thread1of1ForFork0_~arg#1.offset_47|) (= |v_t1Thread1of1ForFork0_~value~0#1_143| |v_t1Thread1of1ForFork0_#t~nondet50#1_64|) (<= |v_t1Thread1of1ForFork0_#t~nondet50#1_64| 2147483647) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_95| |v_~#queue~0.offset_148|) (= |v_ULTIMATE.start_main_#t~pre64#1_149| |v_#pthreadsForks_268|) (= |v_#memory_int_1486| (store |v_#memory_int_1487| |v_ULTIMATE.start_main_~#id2~0#1.base_153| (store (select |v_#memory_int_1487| |v_ULTIMATE.start_main_~#id2~0#1.base_153|) |v_ULTIMATE.start_main_~#id2~0#1.offset_153| |v_ULTIMATE.start_main_#t~pre64#1_149|))) (= |v_t1Thread1of1ForFork0_~value~0#1_143| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_97|) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet50#1_64| 2147483648)) (= |v_t1Thread1of1ForFork0_~arg#1.base_47| |v_t1Thread1of1ForFork0_#in~arg#1.base_47|) (= (store |v_#pthreadsMutex_404| |v_~#m~0.base_182| (store .cse0 |v_~#m~0.offset_182| 1)) |v_#pthreadsMutex_403|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_404|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_153|, ~#m~0.base=|v_~#m~0.base_182|, ~#queue~0.base=|v_~#queue~0.base_153|, t1Thread1of1ForFork0_#t~nondet50#1=|v_t1Thread1of1ForFork0_#t~nondet50#1_64|, #pthreadsForks=|v_#pthreadsForks_268|, ~#m~0.offset=|v_~#m~0.offset_182|, #memory_int=|v_#memory_int_1487|, ~#queue~0.offset=|v_~#queue~0.offset_148|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_47|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_153|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_47|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_151|, #pthreadsMutex=|v_#pthreadsMutex_403|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_153|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_147|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_47|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_143|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_149|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_47|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_95|, ~#m~0.base=|v_~#m~0.base_182|, ~#queue~0.base=|v_~#queue~0.base_153|, #pthreadsForks=|v_#pthreadsForks_267|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_97|, ~#m~0.offset=|v_~#m~0.offset_182|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_51|, #memory_int=|v_#memory_int_1486|, ~#queue~0.offset=|v_~#queue~0.offset_148|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_47|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_95|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_125|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_47|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_153|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsMutex, t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_~arg#1.offset, t1Thread1of1ForFork0_~value~0#1, ULTIMATE.start_main_#t~pre64#1, t1Thread1of1ForFork0_enqueue_#in~q#1.base, t1Thread1of1ForFork0_#t~nondet50#1, #pthreadsForks, t1Thread1of1ForFork0_enqueue_#in~x#1, t1Thread1of1ForFork0_#t~nondet49#1, #memory_int, t1Thread1of1ForFork0_~arg#1.base, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, ULTIMATE.start_main_#t~nondet63#1] and [928] L1010-1-->L980-1: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_205| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_29|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_205|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_43| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_31|) (= (select (select |v_#memory_int_592| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_205|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_205| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|)) InVars {t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_31|, #memory_int=|v_#memory_int_592|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_29|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_29|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_205|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_79|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_205|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_31|, #memory_int=|v_#memory_int_592|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_43|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_63|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_111|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_29|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_69|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_71|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] [2022-12-06 03:53:53,272 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 03:53:53,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 604 [2022-12-06 03:53:53,273 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 198 flow [2022-12-06 03:53:53,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 03:53:53,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:53,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:53,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 03:53:53,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:53:53,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:53,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1589596123, now seen corresponding path program 1 times [2022-12-06 03:53:53,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:53,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114719134] [2022-12-06 03:53:53,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:53,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:53,801 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 03:53:53,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:53,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114719134] [2022-12-06 03:53:53,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114719134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:53,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:53:53,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 03:53:53,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824752531] [2022-12-06 03:53:53,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:53,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:53:53,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:53,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:53:53,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:53:53,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 62 [2022-12-06 03:53:53,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 03:53:53,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:53,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 62 [2022-12-06 03:53:53,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:54,114 INFO L130 PetriNetUnfolder]: 1272/2212 cut-off events. [2022-12-06 03:53:54,115 INFO L131 PetriNetUnfolder]: For 158/158 co-relation queries the response was YES. [2022-12-06 03:53:54,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4508 conditions, 2212 events. 1272/2212 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9015 event pairs, 260 based on Foata normal form. 11/1755 useless extension candidates. Maximal degree in co-relation 4498. Up to 1820 conditions per place. [2022-12-06 03:53:54,123 INFO L137 encePairwiseOnDemand]: 54/62 looper letters, 68 selfloop transitions, 8 changer transitions 1/86 dead transitions. [2022-12-06 03:53:54,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 86 transitions, 392 flow [2022-12-06 03:53:54,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:53:54,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:53:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2022-12-06 03:53:54,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097 [2022-12-06 03:53:54,125 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 198 flow. Second operand 5 states and 117 transitions. [2022-12-06 03:53:54,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 86 transitions, 392 flow [2022-12-06 03:53:54,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 86 transitions, 378 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 03:53:54,129 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 190 flow [2022-12-06 03:53:54,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2022-12-06 03:53:54,130 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2022-12-06 03:53:54,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:54,131 INFO L89 Accepts]: Start accepts. Operand has 68 places, 64 transitions, 190 flow [2022-12-06 03:53:54,132 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:54,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:54,132 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 64 transitions, 190 flow [2022-12-06 03:53:54,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 64 transitions, 190 flow [2022-12-06 03:53:54,141 INFO L130 PetriNetUnfolder]: 28/171 cut-off events. [2022-12-06 03:53:54,142 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 03:53:54,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 28/171 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 416 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 118. Up to 12 conditions per place. [2022-12-06 03:53:54,143 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 64 transitions, 190 flow [2022-12-06 03:53:54,143 INFO L188 LiptonReduction]: Number of co-enabled transitions 1202 [2022-12-06 03:53:54,166 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:54,173 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 03:53:54,173 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 190 flow [2022-12-06 03:53:54,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 03:53:54,173 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:54,173 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:54,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 03:53:54,174 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:53:54,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:54,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1534661016, now seen corresponding path program 1 times [2022-12-06 03:53:54,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:54,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302386809] [2022-12-06 03:53:54,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:54,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:54,760 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 03:53:54,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:54,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302386809] [2022-12-06 03:53:54,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302386809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:54,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:53:54,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 03:53:54,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401482316] [2022-12-06 03:53:54,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:54,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 03:53:54,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:54,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 03:53:54,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:53:54,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2022-12-06 03:53:54,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 190 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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 03:53:54,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:54,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2022-12-06 03:53:54,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:55,146 INFO L130 PetriNetUnfolder]: 1254/2182 cut-off events. [2022-12-06 03:53:55,146 INFO L131 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2022-12-06 03:53:55,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4450 conditions, 2182 events. 1254/2182 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8852 event pairs, 919 based on Foata normal form. 0/1730 useless extension candidates. Maximal degree in co-relation 4133. Up to 1966 conditions per place. [2022-12-06 03:53:55,157 INFO L137 encePairwiseOnDemand]: 48/60 looper letters, 55 selfloop transitions, 16 changer transitions 1/81 dead transitions. [2022-12-06 03:53:55,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 81 transitions, 377 flow [2022-12-06 03:53:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 03:53:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 03:53:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2022-12-06 03:53:55,158 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28541666666666665 [2022-12-06 03:53:55,158 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 190 flow. Second operand 8 states and 137 transitions. [2022-12-06 03:53:55,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 81 transitions, 377 flow [2022-12-06 03:53:55,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 81 transitions, 361 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 03:53:55,163 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 261 flow [2022-12-06 03:53:55,163 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=261, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2022-12-06 03:53:55,165 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 4 predicate places. [2022-12-06 03:53:55,166 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:55,166 INFO L89 Accepts]: Start accepts. Operand has 72 places, 73 transitions, 261 flow [2022-12-06 03:53:55,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:55,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:55,167 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 73 transitions, 261 flow [2022-12-06 03:53:55,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 73 transitions, 261 flow [2022-12-06 03:53:55,179 INFO L130 PetriNetUnfolder]: 33/175 cut-off events. [2022-12-06 03:53:55,180 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 03:53:55,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 175 events. 33/175 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 417 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 148. Up to 12 conditions per place. [2022-12-06 03:53:55,182 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 73 transitions, 261 flow [2022-12-06 03:53:55,182 INFO L188 LiptonReduction]: Number of co-enabled transitions 1206 [2022-12-06 03:53:55,195 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [927] L988-2-->L982-4: Formula: (= (store |v_#memory_int_589| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_203| (store (select |v_#memory_int_589| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_203|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_203| 1604) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_72| 1))) |v_#memory_int_588|) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_203|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_203|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_72|, #memory_int=|v_#memory_int_589|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_203|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_203|, #memory_int=|v_#memory_int_588|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_77|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~post41#1, #memory_int, t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [911] L1062-4-->L1063-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_58|) (= (+ |v_#pthreadsForks_58| 1) |v_#pthreadsForks_57|) (= (store |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35| (store (select |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35|) |v_ULTIMATE.start_main_~#id2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre64#1_33|)) |v_#memory_int_486|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_58|, #memory_int=|v_#memory_int_487|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_27|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_486|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_9|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-06 03:53:55,270 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [791] L988-->L988-2: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_33| (select (select |v_#memory_int_136| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_69|) (+ 1604 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_69|))) (= |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_29| |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_33|)) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_69|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_69|, #memory_int=|v_#memory_int_136|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_69|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_69|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_29|, #memory_int=|v_#memory_int_136|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_33|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [911] L1062-4-->L1063-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_58|) (= (+ |v_#pthreadsForks_58| 1) |v_#pthreadsForks_57|) (= (store |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35| (store (select |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35|) |v_ULTIMATE.start_main_~#id2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre64#1_33|)) |v_#memory_int_486|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_58|, #memory_int=|v_#memory_int_487|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_27|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_486|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_9|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-06 03:53:55,379 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [794] L958-->L960-1: Formula: (and (= |v_t1Thread1of1ForFork0_empty_~q#1.base_11| |v_t1Thread1of1ForFork0_empty_#in~q#1.base_7|) (= |v_t1Thread1of1ForFork0_empty_~q#1.offset_11| |v_t1Thread1of1ForFork0_empty_#in~q#1.offset_7|) (= |v_t1Thread1of1ForFork0_empty_#t~mem31#1_15| (select (select |v_#memory_int_138| |v_t1Thread1of1ForFork0_empty_~q#1.base_11|) (+ 1600 |v_t1Thread1of1ForFork0_empty_~q#1.offset_11|)))) InVars {t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_7|, #memory_int=|v_#memory_int_138|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_7|} OutVars{t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_11|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_7|, t1Thread1of1ForFork0_empty_#t~mem31#1=|v_t1Thread1of1ForFork0_empty_#t~mem31#1_15|, #memory_int=|v_#memory_int_138|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_11|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_7|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_empty_~q#1.offset, t1Thread1of1ForFork0_empty_#t~mem31#1, t1Thread1of1ForFork0_empty_~q#1.base] and [911] L1062-4-->L1063-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_58|) (= (+ |v_#pthreadsForks_58| 1) |v_#pthreadsForks_57|) (= (store |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35| (store (select |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35|) |v_ULTIMATE.start_main_~#id2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre64#1_33|)) |v_#memory_int_486|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_58|, #memory_int=|v_#memory_int_487|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_27|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_486|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_9|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-06 03:53:55,424 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 03:53:55,425 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 259 [2022-12-06 03:53:55,425 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 261 flow [2022-12-06 03:53:55,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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 03:53:55,425 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:55,425 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:55,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 03:53:55,426 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:53:55,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:55,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1689845943, now seen corresponding path program 1 times [2022-12-06 03:53:55,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:55,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113339382] [2022-12-06 03:53:55,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:55,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:55,821 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 03:53:55,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:55,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113339382] [2022-12-06 03:53:55,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113339382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:55,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:53:55,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 03:53:55,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703484887] [2022-12-06 03:53:55,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:55,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 03:53:55,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:55,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 03:53:55,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:53:55,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 65 [2022-12-06 03:53:55,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 261 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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 03:53:55,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:55,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 65 [2022-12-06 03:53:55,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:56,278 INFO L130 PetriNetUnfolder]: 1419/2466 cut-off events. [2022-12-06 03:53:56,278 INFO L131 PetriNetUnfolder]: For 259/259 co-relation queries the response was YES. [2022-12-06 03:53:56,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5208 conditions, 2466 events. 1419/2466 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 10613 event pairs, 811 based on Foata normal form. 0/1952 useless extension candidates. Maximal degree in co-relation 5042. Up to 1818 conditions per place. [2022-12-06 03:53:56,288 INFO L137 encePairwiseOnDemand]: 48/65 looper letters, 90 selfloop transitions, 17 changer transitions 8/124 dead transitions. [2022-12-06 03:53:56,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 124 transitions, 620 flow [2022-12-06 03:53:56,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 03:53:56,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 03:53:56,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2022-12-06 03:53:56,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34423076923076923 [2022-12-06 03:53:56,290 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 261 flow. Second operand 8 states and 179 transitions. [2022-12-06 03:53:56,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 124 transitions, 620 flow [2022-12-06 03:53:56,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 124 transitions, 569 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-12-06 03:53:56,293 INFO L231 Difference]: Finished difference. Result has 73 places, 74 transitions, 283 flow [2022-12-06 03:53:56,293 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=283, PETRI_PLACES=73, PETRI_TRANSITIONS=74} [2022-12-06 03:53:56,293 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2022-12-06 03:53:56,293 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:56,293 INFO L89 Accepts]: Start accepts. Operand has 73 places, 74 transitions, 283 flow [2022-12-06 03:53:56,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:56,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:56,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 74 transitions, 283 flow [2022-12-06 03:53:56,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 74 transitions, 283 flow [2022-12-06 03:53:56,321 INFO L130 PetriNetUnfolder]: 39/224 cut-off events. [2022-12-06 03:53:56,321 INFO L131 PetriNetUnfolder]: For 29/30 co-relation queries the response was YES. [2022-12-06 03:53:56,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 224 events. 39/224 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 784 event pairs, 0 based on Foata normal form. 1/157 useless extension candidates. Maximal degree in co-relation 302. Up to 17 conditions per place. [2022-12-06 03:53:56,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 74 transitions, 283 flow [2022-12-06 03:53:56,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 1270 [2022-12-06 03:53:56,427 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:53:56,428 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-06 03:53:56,428 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 277 flow [2022-12-06 03:53:56,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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 03:53:56,428 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:56,428 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:56,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 03:53:56,429 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:53:56,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:56,429 INFO L85 PathProgramCache]: Analyzing trace with hash -923352422, now seen corresponding path program 1 times [2022-12-06 03:53:56,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:56,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623051086] [2022-12-06 03:53:56,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:56,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:56,899 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 03:53:56,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:56,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623051086] [2022-12-06 03:53:56,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623051086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:56,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:53:56,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 03:53:56,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459408950] [2022-12-06 03:53:56,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:56,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:53:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:56,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:53:56,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:53:56,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 66 [2022-12-06 03:53:56,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 03:53:56,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:56,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 66 [2022-12-06 03:53:56,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:57,226 INFO L130 PetriNetUnfolder]: 1600/2791 cut-off events. [2022-12-06 03:53:57,227 INFO L131 PetriNetUnfolder]: For 478/478 co-relation queries the response was YES. [2022-12-06 03:53:57,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6024 conditions, 2791 events. 1600/2791 cut-off events. For 478/478 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 12589 event pairs, 948 based on Foata normal form. 0/2211 useless extension candidates. Maximal degree in co-relation 5647. Up to 2161 conditions per place. [2022-12-06 03:53:57,238 INFO L137 encePairwiseOnDemand]: 51/66 looper letters, 85 selfloop transitions, 15 changer transitions 6/115 dead transitions. [2022-12-06 03:53:57,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 115 transitions, 597 flow [2022-12-06 03:53:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:53:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:53:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2022-12-06 03:53:57,239 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2022-12-06 03:53:57,239 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 277 flow. Second operand 6 states and 152 transitions. [2022-12-06 03:53:57,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 115 transitions, 597 flow [2022-12-06 03:53:57,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 115 transitions, 559 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-06 03:53:57,242 INFO L231 Difference]: Finished difference. Result has 75 places, 77 transitions, 320 flow [2022-12-06 03:53:57,242 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=75, PETRI_TRANSITIONS=77} [2022-12-06 03:53:57,243 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2022-12-06 03:53:57,243 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:57,243 INFO L89 Accepts]: Start accepts. Operand has 75 places, 77 transitions, 320 flow [2022-12-06 03:53:57,243 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:57,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:57,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 77 transitions, 320 flow [2022-12-06 03:53:57,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 77 transitions, 320 flow [2022-12-06 03:53:57,256 INFO L130 PetriNetUnfolder]: 40/239 cut-off events. [2022-12-06 03:53:57,256 INFO L131 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2022-12-06 03:53:57,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 239 events. 40/239 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 904 event pairs, 0 based on Foata normal form. 1/168 useless extension candidates. Maximal degree in co-relation 316. Up to 17 conditions per place. [2022-12-06 03:53:57,258 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 77 transitions, 320 flow [2022-12-06 03:53:57,258 INFO L188 LiptonReduction]: Number of co-enabled transitions 1318 [2022-12-06 03:53:57,280 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [988] L958-->L1063-3: Formula: (and (= (+ |v_#pthreadsForks_364| 1) |v_#pthreadsForks_363|) (= |v_ULTIMATE.start_main_#t~pre64#1_230| |v_#pthreadsForks_364|) (= |v_t1Thread1of1ForFork0_empty_~q#1.offset_107| |v_t1Thread1of1ForFork0_empty_#in~q#1.offset_51|) (= (store |v_#memory_int_1834| |v_ULTIMATE.start_main_~#id2~0#1.base_205| (store (select |v_#memory_int_1834| |v_ULTIMATE.start_main_~#id2~0#1.base_205|) |v_ULTIMATE.start_main_~#id2~0#1.offset_201| |v_ULTIMATE.start_main_#t~pre64#1_230|)) |v_#memory_int_1833|) (= |v_t1Thread1of1ForFork0_empty_~q#1.base_107| |v_t1Thread1of1ForFork0_empty_#in~q#1.base_51|) (= |v_t1Thread1of1ForFork0_empty_#t~mem31#1_169| (select (select |v_#memory_int_1834| |v_t1Thread1of1ForFork0_empty_~q#1.base_107|) (+ 1600 |v_t1Thread1of1ForFork0_empty_~q#1.offset_107|)))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_201|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_51|, #pthreadsForks=|v_#pthreadsForks_364|, #memory_int=|v_#memory_int_1834|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_51|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_205|} OutVars{t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_107|, ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_199|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_201|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_51|, #pthreadsForks=|v_#pthreadsForks_363|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_230|, t1Thread1of1ForFork0_empty_#t~mem31#1=|v_t1Thread1of1ForFork0_empty_#t~mem31#1_169|, #memory_int=|v_#memory_int_1833|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_107|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_51|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_173|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_205|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_empty_~q#1.offset, ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, t1Thread1of1ForFork0_empty_#t~mem31#1, #memory_int, t1Thread1of1ForFork0_empty_~q#1.base, ULTIMATE.start_main_#t~nondet63#1] and [964] L960-1-->empty_returnLabel#1: Formula: (let ((.cse0 (= |v_t1Thread1of1ForFork0_empty_#t~mem31#1_In_2| (select (select |v_#memory_int_In_62| |v_t1Thread1of1ForFork0_empty_~q#1.base_In_2|) (+ |v_t1Thread1of1ForFork0_empty_~q#1.offset_In_2| 1604))))) (or (and (= |v_t1Thread1of1ForFork0_empty_#res#1_Out_16| 0) (not .cse0) (= |v_t1Thread1of1ForFork0_empty_#t~nondet33#1_In_1| |v_t1Thread1of1ForFork0_empty_#t~nondet33#1_Out_8|)) (and (= (+ |v_t1Thread1of1ForFork0_empty_#res#1_Out_16| 1) 0) .cse0))) InVars {t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_In_2|, #memory_int=|v_#memory_int_In_62|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_In_2|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_In_1|, t1Thread1of1ForFork0_empty_#t~mem31#1=|v_t1Thread1of1ForFork0_empty_#t~mem31#1_In_2|} OutVars{t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_In_2|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_Out_8|, t1Thread1of1ForFork0_empty_#t~mem32#1=|v_t1Thread1of1ForFork0_empty_#t~mem32#1_Out_12|, #memory_int=|v_#memory_int_In_62|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_In_2|, t1Thread1of1ForFork0_empty_#res#1=|v_t1Thread1of1ForFork0_empty_#res#1_Out_16|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_empty_#t~nondet33#1, t1Thread1of1ForFork0_empty_#t~mem32#1, t1Thread1of1ForFork0_empty_#t~mem31#1, t1Thread1of1ForFork0_empty_#res#1] [2022-12-06 03:53:57,522 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:53:57,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 280 [2022-12-06 03:53:57,523 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 316 flow [2022-12-06 03:53:57,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 03:53:57,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:57,523 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:57,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 03:53:57,524 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:53:57,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:57,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1440758138, now seen corresponding path program 1 times [2022-12-06 03:53:57,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:57,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863235141] [2022-12-06 03:53:57,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:57,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:03,704 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 03:54:03,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:03,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863235141] [2022-12-06 03:54:03,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863235141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:54:03,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:54:03,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 03:54:03,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138118081] [2022-12-06 03:54:03,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:54:03,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 03:54:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:03,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 03:54:03,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:54:03,709 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 66 [2022-12-06 03:54:03,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 316 flow. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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 03:54:03,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:03,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 66 [2022-12-06 03:54:03,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:08,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 03:54:32,608 INFO L130 PetriNetUnfolder]: 1758/3111 cut-off events. [2022-12-06 03:54:32,609 INFO L131 PetriNetUnfolder]: For 526/526 co-relation queries the response was YES. [2022-12-06 03:54:32,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6737 conditions, 3111 events. 1758/3111 cut-off events. For 526/526 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 15133 event pairs, 877 based on Foata normal form. 0/2460 useless extension candidates. Maximal degree in co-relation 5738. Up to 2181 conditions per place. [2022-12-06 03:54:32,622 INFO L137 encePairwiseOnDemand]: 49/66 looper letters, 100 selfloop transitions, 19 changer transitions 10/138 dead transitions. [2022-12-06 03:54:32,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 138 transitions, 728 flow [2022-12-06 03:54:32,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 03:54:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 03:54:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 197 transitions. [2022-12-06 03:54:32,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33164983164983164 [2022-12-06 03:54:32,625 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 316 flow. Second operand 9 states and 197 transitions. [2022-12-06 03:54:32,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 138 transitions, 728 flow [2022-12-06 03:54:32,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 138 transitions, 706 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 03:54:32,630 INFO L231 Difference]: Finished difference. Result has 80 places, 78 transitions, 367 flow [2022-12-06 03:54:32,630 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=367, PETRI_PLACES=80, PETRI_TRANSITIONS=78} [2022-12-06 03:54:32,631 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2022-12-06 03:54:32,631 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:32,631 INFO L89 Accepts]: Start accepts. Operand has 80 places, 78 transitions, 367 flow [2022-12-06 03:54:32,633 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:32,633 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:32,633 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 78 transitions, 367 flow [2022-12-06 03:54:32,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 78 transitions, 367 flow [2022-12-06 03:54:32,648 INFO L130 PetriNetUnfolder]: 41/249 cut-off events. [2022-12-06 03:54:32,648 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2022-12-06 03:54:32,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 249 events. 41/249 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1009 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 311. Up to 15 conditions per place. [2022-12-06 03:54:32,650 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 78 transitions, 367 flow [2022-12-06 03:54:32,650 INFO L188 LiptonReduction]: Number of co-enabled transitions 1334 [2022-12-06 03:54:32,692 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:54:32,692 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 03:54:32,692 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 78 transitions, 367 flow [2022-12-06 03:54:32,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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 03:54:32,693 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:32,693 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:32,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 03:54:32,693 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:54:32,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:32,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1932834273, now seen corresponding path program 1 times [2022-12-06 03:54:32,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:32,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953314349] [2022-12-06 03:54:32,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:32,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:32,747 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 03:54:32,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:32,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953314349] [2022-12-06 03:54:32,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953314349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:54:32,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:54:32,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:54:32,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486869572] [2022-12-06 03:54:32,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:54:32,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:54:32,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:32,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:54:32,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:54:32,749 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2022-12-06 03:54:32,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 78 transitions, 367 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 03:54:32,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:32,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2022-12-06 03:54:32,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:32,881 INFO L130 PetriNetUnfolder]: 782/1546 cut-off events. [2022-12-06 03:54:32,882 INFO L131 PetriNetUnfolder]: For 576/576 co-relation queries the response was YES. [2022-12-06 03:54:32,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3539 conditions, 1546 events. 782/1546 cut-off events. For 576/576 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7557 event pairs, 397 based on Foata normal form. 4/1330 useless extension candidates. Maximal degree in co-relation 2873. Up to 1050 conditions per place. [2022-12-06 03:54:32,890 INFO L137 encePairwiseOnDemand]: 54/65 looper letters, 56 selfloop transitions, 11 changer transitions 3/87 dead transitions. [2022-12-06 03:54:32,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 87 transitions, 538 flow [2022-12-06 03:54:32,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:54:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:54:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2022-12-06 03:54:32,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-12-06 03:54:32,892 INFO L175 Difference]: Start difference. First operand has 80 places, 78 transitions, 367 flow. Second operand 3 states and 100 transitions. [2022-12-06 03:54:32,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 87 transitions, 538 flow [2022-12-06 03:54:32,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 87 transitions, 503 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 03:54:32,895 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 351 flow [2022-12-06 03:54:32,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2022-12-06 03:54:32,895 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 8 predicate places. [2022-12-06 03:54:32,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:32,895 INFO L89 Accepts]: Start accepts. Operand has 76 places, 76 transitions, 351 flow [2022-12-06 03:54:32,898 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:32,898 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:32,899 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 76 transitions, 351 flow [2022-12-06 03:54:32,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 76 transitions, 351 flow [2022-12-06 03:54:32,936 INFO L130 PetriNetUnfolder]: 49/291 cut-off events. [2022-12-06 03:54:32,937 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2022-12-06 03:54:32,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 291 events. 49/291 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1355 event pairs, 1 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 402. Up to 54 conditions per place. [2022-12-06 03:54:32,939 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 76 transitions, 351 flow [2022-12-06 03:54:32,939 INFO L188 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-06 03:54:34,083 INFO L203 LiptonReduction]: Total number of compositions: 15 [2022-12-06 03:54:34,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1189 [2022-12-06 03:54:34,084 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 354 flow [2022-12-06 03:54:34,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 03:54:34,084 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:34,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:34,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 03:54:34,085 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:54:34,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:34,085 INFO L85 PathProgramCache]: Analyzing trace with hash -720457701, now seen corresponding path program 1 times [2022-12-06 03:54:34,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:34,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180776345] [2022-12-06 03:54:34,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:34,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:34,826 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 03:54:34,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:34,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180776345] [2022-12-06 03:54:34,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180776345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:54:34,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:54:34,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 03:54:34,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288525190] [2022-12-06 03:54:34,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:54:34,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 03:54:34,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:34,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 03:54:34,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-06 03:54:34,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 55 [2022-12-06 03:54:34,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 354 flow. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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 03:54:34,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:34,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 55 [2022-12-06 03:54:34,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:35,446 INFO L130 PetriNetUnfolder]: 1176/2171 cut-off events. [2022-12-06 03:54:35,447 INFO L131 PetriNetUnfolder]: For 771/771 co-relation queries the response was YES. [2022-12-06 03:54:35,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5627 conditions, 2171 events. 1176/2171 cut-off events. For 771/771 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 11480 event pairs, 375 based on Foata normal form. 12/1941 useless extension candidates. Maximal degree in co-relation 3769. Up to 685 conditions per place. [2022-12-06 03:54:35,453 INFO L137 encePairwiseOnDemand]: 37/55 looper letters, 109 selfloop transitions, 29 changer transitions 31/172 dead transitions. [2022-12-06 03:54:35,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 172 transitions, 1046 flow [2022-12-06 03:54:35,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 03:54:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 03:54:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 201 transitions. [2022-12-06 03:54:35,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2811188811188811 [2022-12-06 03:54:35,456 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 354 flow. Second operand 13 states and 201 transitions. [2022-12-06 03:54:35,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 172 transitions, 1046 flow [2022-12-06 03:54:35,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 172 transitions, 999 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 03:54:35,460 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 498 flow [2022-12-06 03:54:35,461 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=498, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2022-12-06 03:54:35,461 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 16 predicate places. [2022-12-06 03:54:35,462 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:35,462 INFO L89 Accepts]: Start accepts. Operand has 84 places, 78 transitions, 498 flow [2022-12-06 03:54:35,462 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:35,463 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:35,463 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 78 transitions, 498 flow [2022-12-06 03:54:35,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 78 transitions, 498 flow [2022-12-06 03:54:35,483 INFO L130 PetriNetUnfolder]: 76/343 cut-off events. [2022-12-06 03:54:35,483 INFO L131 PetriNetUnfolder]: For 267/267 co-relation queries the response was YES. [2022-12-06 03:54:35,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 343 events. 76/343 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1808 event pairs, 1 based on Foata normal form. 0/317 useless extension candidates. Maximal degree in co-relation 731. Up to 56 conditions per place. [2022-12-06 03:54:35,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 78 transitions, 498 flow [2022-12-06 03:54:35,486 INFO L188 LiptonReduction]: Number of co-enabled transitions 534 [2022-12-06 03:54:35,815 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [996] L1018-6-->L980-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_484| |v_~#m~0.base_214|))) (and (< |v_t1Thread1of1ForFork0_~i~0#1_201| 399) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_123| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_779|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_205| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_125|) (= (store |v_#pthreadsMutex_484| |v_~#m~0.base_214| (store .cse0 |v_~#m~0.offset_214| 1)) |v_#pthreadsMutex_483|) (not (= (mod v_~enqueue_flag~0_142 256) 0)) (= (select .cse0 |v_~#m~0.offset_214|) 0) (= |v_~#queue~0.base_251| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_123|) (= |v_t1Thread1of1ForFork0_~value~0#1_200| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_125|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_123| |v_~#queue~0.offset_246|) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_779| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_123|) (= |v_t1Thread1of1ForFork0_~value~0#1_200| |v_t1Thread1of1ForFork0_#t~nondet55#1_82|) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet55#1_82| 2147483648)) (<= |v_t1Thread1of1ForFork0_#t~nondet55#1_82| 2147483647) (= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| (select (select |v_#memory_int_2121| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_779|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_779| 1604))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_484|, ~#m~0.base=|v_~#m~0.base_214|, ~#queue~0.base=|v_~#queue~0.base_251|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_201|, ~enqueue_flag~0=v_~enqueue_flag~0_142, ~#m~0.offset=|v_~#m~0.offset_214|, #memory_int=|v_#memory_int_2121|, ~#queue~0.offset=|v_~#queue~0.offset_246|, t1Thread1of1ForFork0_#t~nondet55#1=|v_t1Thread1of1ForFork0_#t~nondet55#1_82|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_483|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_201|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_779|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_200|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_290|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_336|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_123|, ~#m~0.base=|v_~#m~0.base_214|, ~#queue~0.base=|v_~#queue~0.base_251|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_779|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_125|, ~enqueue_flag~0=v_~enqueue_flag~0_142, ~#m~0.offset=|v_~#m~0.offset_214|, #memory_int=|v_#memory_int_2121|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_205|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_280|, ~#queue~0.offset=|v_~#queue~0.offset_246|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_388|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_123|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_286|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_337|, t1Thread1of1ForFork0_#t~nondet54#1=|v_t1Thread1of1ForFork0_#t~nondet54#1_49|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_#t~nondet55#1, t1Thread1of1ForFork0_enqueue_#in~q#1.base, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~x#1, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1, t1Thread1of1ForFork0_#t~nondet54#1] and [911] L1062-4-->L1063-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_58|) (= (+ |v_#pthreadsForks_58| 1) |v_#pthreadsForks_57|) (= (store |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35| (store (select |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35|) |v_ULTIMATE.start_main_~#id2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre64#1_33|)) |v_#memory_int_486|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_58|, #memory_int=|v_#memory_int_487|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_27|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_486|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_9|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-06 03:54:36,206 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 03:54:36,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 745 [2022-12-06 03:54:36,207 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 73 transitions, 494 flow [2022-12-06 03:54:36,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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 03:54:36,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:36,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:36,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 03:54:36,208 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:54:36,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:36,208 INFO L85 PathProgramCache]: Analyzing trace with hash -562371268, now seen corresponding path program 1 times [2022-12-06 03:54:36,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:36,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060605368] [2022-12-06 03:54:36,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:36,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:36,817 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 03:54:36,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:36,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060605368] [2022-12-06 03:54:36,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060605368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:54:36,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:54:36,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 03:54:36,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348330950] [2022-12-06 03:54:36,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:54:36,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:54:36,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:36,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:54:36,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:54:36,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 55 [2022-12-06 03:54:36,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 73 transitions, 494 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 03:54:36,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:36,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 55 [2022-12-06 03:54:36,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:37,064 INFO L130 PetriNetUnfolder]: 638/1214 cut-off events. [2022-12-06 03:54:37,064 INFO L131 PetriNetUnfolder]: For 900/900 co-relation queries the response was YES. [2022-12-06 03:54:37,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3497 conditions, 1214 events. 638/1214 cut-off events. For 900/900 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5803 event pairs, 285 based on Foata normal form. 0/1192 useless extension candidates. Maximal degree in co-relation 3450. Up to 887 conditions per place. [2022-12-06 03:54:37,069 INFO L137 encePairwiseOnDemand]: 42/55 looper letters, 79 selfloop transitions, 14 changer transitions 3/99 dead transitions. [2022-12-06 03:54:37,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 99 transitions, 758 flow [2022-12-06 03:54:37,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:54:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:54:37,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2022-12-06 03:54:37,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30303030303030304 [2022-12-06 03:54:37,070 INFO L175 Difference]: Start difference. First operand has 74 places, 73 transitions, 494 flow. Second operand 6 states and 100 transitions. [2022-12-06 03:54:37,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 99 transitions, 758 flow [2022-12-06 03:54:37,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 99 transitions, 711 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-06 03:54:37,074 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 482 flow [2022-12-06 03:54:37,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=482, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2022-12-06 03:54:37,075 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2022-12-06 03:54:37,075 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:37,075 INFO L89 Accepts]: Start accepts. Operand has 75 places, 73 transitions, 482 flow [2022-12-06 03:54:37,077 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:37,077 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:37,077 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 73 transitions, 482 flow [2022-12-06 03:54:37,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 73 transitions, 482 flow [2022-12-06 03:54:37,097 INFO L130 PetriNetUnfolder]: 70/297 cut-off events. [2022-12-06 03:54:37,097 INFO L131 PetriNetUnfolder]: For 264/264 co-relation queries the response was YES. [2022-12-06 03:54:37,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 297 events. 70/297 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1549 event pairs, 1 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 529. Up to 60 conditions per place. [2022-12-06 03:54:37,099 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 73 transitions, 482 flow [2022-12-06 03:54:37,099 INFO L188 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-06 03:54:37,106 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:54:37,106 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 03:54:37,106 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 482 flow [2022-12-06 03:54:37,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 03:54:37,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:37,107 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:37,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 03:54:37,107 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:54:37,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:37,107 INFO L85 PathProgramCache]: Analyzing trace with hash 260962798, now seen corresponding path program 1 times [2022-12-06 03:54:37,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:37,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076638563] [2022-12-06 03:54:37,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:37,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:37,655 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 03:54:37,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:37,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076638563] [2022-12-06 03:54:37,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076638563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:54:37,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:54:37,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 03:54:37,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590865203] [2022-12-06 03:54:37,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:54:37,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 03:54:37,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:37,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 03:54:37,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:54:37,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 54 [2022-12-06 03:54:37,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 482 flow. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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 03:54:37,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:37,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 54 [2022-12-06 03:54:37,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:37,949 INFO L130 PetriNetUnfolder]: 543/1041 cut-off events. [2022-12-06 03:54:37,949 INFO L131 PetriNetUnfolder]: For 823/823 co-relation queries the response was YES. [2022-12-06 03:54:37,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3038 conditions, 1041 events. 543/1041 cut-off events. For 823/823 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4846 event pairs, 172 based on Foata normal form. 5/1045 useless extension candidates. Maximal degree in co-relation 2305. Up to 719 conditions per place. [2022-12-06 03:54:37,953 INFO L137 encePairwiseOnDemand]: 37/54 looper letters, 75 selfloop transitions, 21 changer transitions 4/103 dead transitions. [2022-12-06 03:54:37,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 103 transitions, 764 flow [2022-12-06 03:54:37,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:54:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:54:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2022-12-06 03:54:37,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-06 03:54:37,954 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 482 flow. Second operand 7 states and 108 transitions. [2022-12-06 03:54:37,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 103 transitions, 764 flow [2022-12-06 03:54:37,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 103 transitions, 740 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 03:54:37,959 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 509 flow [2022-12-06 03:54:37,959 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=509, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2022-12-06 03:54:37,960 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 11 predicate places. [2022-12-06 03:54:37,960 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:37,960 INFO L89 Accepts]: Start accepts. Operand has 79 places, 73 transitions, 509 flow [2022-12-06 03:54:37,961 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:37,961 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:37,961 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 73 transitions, 509 flow [2022-12-06 03:54:37,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 73 transitions, 509 flow [2022-12-06 03:54:37,985 INFO L130 PetriNetUnfolder]: 57/253 cut-off events. [2022-12-06 03:54:37,985 INFO L131 PetriNetUnfolder]: For 315/315 co-relation queries the response was YES. [2022-12-06 03:54:37,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 253 events. 57/253 cut-off events. For 315/315 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1233 event pairs, 0 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 463. Up to 49 conditions per place. [2022-12-06 03:54:37,987 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 73 transitions, 509 flow [2022-12-06 03:54:37,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-06 03:54:37,992 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:54:37,993 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 03:54:37,993 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 509 flow [2022-12-06 03:54:37,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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 03:54:37,993 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:37,993 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:37,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 03:54:37,993 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:54:37,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:37,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2038320427, now seen corresponding path program 1 times [2022-12-06 03:54:37,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:37,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931825752] [2022-12-06 03:54:37,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:37,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:39,187 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 03:54:39,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:39,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931825752] [2022-12-06 03:54:39,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931825752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:54:39,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:54:39,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 03:54:39,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545604374] [2022-12-06 03:54:39,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:54:39,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 03:54:39,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:39,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 03:54:39,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-06 03:54:39,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 03:54:39,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 509 flow. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:39,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:39,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 03:54:39,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:40,145 INFO L130 PetriNetUnfolder]: 1161/2023 cut-off events. [2022-12-06 03:54:40,146 INFO L131 PetriNetUnfolder]: For 1616/1616 co-relation queries the response was YES. [2022-12-06 03:54:40,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5773 conditions, 2023 events. 1161/2023 cut-off events. For 1616/1616 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10210 event pairs, 382 based on Foata normal form. 0/1928 useless extension candidates. Maximal degree in co-relation 4683. Up to 1354 conditions per place. [2022-12-06 03:54:40,156 INFO L137 encePairwiseOnDemand]: 29/53 looper letters, 114 selfloop transitions, 37 changer transitions 40/191 dead transitions. [2022-12-06 03:54:40,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 191 transitions, 1317 flow [2022-12-06 03:54:40,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 03:54:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 03:54:40,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 171 transitions. [2022-12-06 03:54:40,157 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1897891231964484 [2022-12-06 03:54:40,157 INFO L175 Difference]: Start difference. First operand has 79 places, 73 transitions, 509 flow. Second operand 17 states and 171 transitions. [2022-12-06 03:54:40,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 191 transitions, 1317 flow [2022-12-06 03:54:40,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 191 transitions, 1279 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-06 03:54:40,164 INFO L231 Difference]: Finished difference. Result has 101 places, 101 transitions, 776 flow [2022-12-06 03:54:40,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=776, PETRI_PLACES=101, PETRI_TRANSITIONS=101} [2022-12-06 03:54:40,165 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 33 predicate places. [2022-12-06 03:54:40,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:40,165 INFO L89 Accepts]: Start accepts. Operand has 101 places, 101 transitions, 776 flow [2022-12-06 03:54:40,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:40,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:40,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 101 transitions, 776 flow [2022-12-06 03:54:40,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 101 transitions, 776 flow [2022-12-06 03:54:40,191 INFO L130 PetriNetUnfolder]: 95/352 cut-off events. [2022-12-06 03:54:40,191 INFO L131 PetriNetUnfolder]: For 774/777 co-relation queries the response was YES. [2022-12-06 03:54:40,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 352 events. 95/352 cut-off events. For 774/777 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1914 event pairs, 8 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 1104. Up to 74 conditions per place. [2022-12-06 03:54:40,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 101 transitions, 776 flow [2022-12-06 03:54:40,194 INFO L188 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-06 03:54:40,214 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [997] L1018-6-->L1018-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_489| |v_~#m~0.base_216|))) (and (< |v_t1Thread1of1ForFork0_~i~0#1_204| 399) (= |v_t1Thread1of1ForFork0_~i~0#1_203| (+ |v_t1Thread1of1ForFork0_~i~0#1_204| 1)) (= (mod v_~enqueue_flag~0_144 256) 0) (= (select .cse0 |v_~#m~0.offset_216|) 0) (= (store |v_#pthreadsMutex_489| |v_~#m~0.base_216| (store .cse0 |v_~#m~0.offset_216| 0)) |v_#pthreadsMutex_487|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_489|, ~#m~0.base=|v_~#m~0.base_216|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_204|, ~#m~0.offset=|v_~#m~0.offset_216|, ~enqueue_flag~0=v_~enqueue_flag~0_144} OutVars{#pthreadsMutex=|v_#pthreadsMutex_487|, ~#m~0.base=|v_~#m~0.base_216|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_203|, ~#m~0.offset=|v_~#m~0.offset_216|, ~enqueue_flag~0=v_~enqueue_flag~0_144, t1Thread1of1ForFork0_#t~post53#1=|v_t1Thread1of1ForFork0_#t~post53#1_35|, t1Thread1of1ForFork0_#t~nondet54#1=|v_t1Thread1of1ForFork0_#t~nondet54#1_51|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_#t~post53#1, t1Thread1of1ForFork0_#t~nondet54#1] and [1020] L1037-6-->L1037-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_585| |v_~#m~0.base_263|))) (and (= (store |v_#pthreadsMutex_585| |v_~#m~0.base_263| (store .cse0 |v_~#m~0.offset_263| 0)) |v_#pthreadsMutex_583|) (= 0 (mod v_~dequeue_flag~0_204 256)) (= (select .cse0 |v_~#m~0.offset_263|) 0) (= |v_t2Thread1of1ForFork1_~i~1#1_239| (+ |v_t2Thread1of1ForFork1_~i~1#1_240| 1)) (< |v_t2Thread1of1ForFork1_~i~1#1_240| 400))) InVars {#pthreadsMutex=|v_#pthreadsMutex_585|, ~#m~0.base=|v_~#m~0.base_263|, ~#m~0.offset=|v_~#m~0.offset_263|, ~dequeue_flag~0=v_~dequeue_flag~0_204, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_240|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_583|, ~#m~0.base=|v_~#m~0.base_263|, ~#m~0.offset=|v_~#m~0.offset_263|, ~dequeue_flag~0=v_~dequeue_flag~0_204, t2Thread1of1ForFork1_#t~nondet58#1=|v_t2Thread1of1ForFork1_#t~nondet58#1_89|, t2Thread1of1ForFork1_#t~post57#1=|v_t2Thread1of1ForFork1_#t~post57#1_57|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_239|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~nondet58#1, t2Thread1of1ForFork1_#t~post57#1, t2Thread1of1ForFork1_~i~1#1] [2022-12-06 03:54:40,405 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [963] L1018-6-->t1EXIT: Formula: (and (= |v_t1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_t1Thread1of1ForFork0_~i~0#1_In_3| 399)) (= |v_t1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{t1Thread1of1ForFork0_#res#1.offset=|v_t1Thread1of1ForFork0_#res#1.offset_Out_4|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_In_3|, t1Thread1of1ForFork0_#res#1.base=|v_t1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#res#1.offset, t1Thread1of1ForFork0_#res#1.base] and [1020] L1037-6-->L1037-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_585| |v_~#m~0.base_263|))) (and (= (store |v_#pthreadsMutex_585| |v_~#m~0.base_263| (store .cse0 |v_~#m~0.offset_263| 0)) |v_#pthreadsMutex_583|) (= 0 (mod v_~dequeue_flag~0_204 256)) (= (select .cse0 |v_~#m~0.offset_263|) 0) (= |v_t2Thread1of1ForFork1_~i~1#1_239| (+ |v_t2Thread1of1ForFork1_~i~1#1_240| 1)) (< |v_t2Thread1of1ForFork1_~i~1#1_240| 400))) InVars {#pthreadsMutex=|v_#pthreadsMutex_585|, ~#m~0.base=|v_~#m~0.base_263|, ~#m~0.offset=|v_~#m~0.offset_263|, ~dequeue_flag~0=v_~dequeue_flag~0_204, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_240|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_583|, ~#m~0.base=|v_~#m~0.base_263|, ~#m~0.offset=|v_~#m~0.offset_263|, ~dequeue_flag~0=v_~dequeue_flag~0_204, t2Thread1of1ForFork1_#t~nondet58#1=|v_t2Thread1of1ForFork1_#t~nondet58#1_89|, t2Thread1of1ForFork1_#t~post57#1=|v_t2Thread1of1ForFork1_#t~post57#1_57|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_239|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~nondet58#1, t2Thread1of1ForFork1_#t~post57#1, t2Thread1of1ForFork1_~i~1#1] [2022-12-06 03:54:40,483 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:54:40,484 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 319 [2022-12-06 03:54:40,484 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 98 transitions, 770 flow [2022-12-06 03:54:40,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:40,484 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:40,484 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:40,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 03:54:40,484 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:54:40,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:40,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1474347477, now seen corresponding path program 2 times [2022-12-06 03:54:40,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:40,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300751717] [2022-12-06 03:54:40,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:40,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:41,776 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 03:54:41,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:41,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300751717] [2022-12-06 03:54:41,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300751717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:54:41,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:54:41,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 03:54:41,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142110856] [2022-12-06 03:54:41,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:54:41,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 03:54:41,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:41,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 03:54:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-12-06 03:54:41,778 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 03:54:41,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 98 transitions, 770 flow. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:41,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:41,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 03:54:41,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:43,123 INFO L130 PetriNetUnfolder]: 849/1517 cut-off events. [2022-12-06 03:54:43,123 INFO L131 PetriNetUnfolder]: For 3438/3438 co-relation queries the response was YES. [2022-12-06 03:54:43,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5840 conditions, 1517 events. 849/1517 cut-off events. For 3438/3438 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7326 event pairs, 229 based on Foata normal form. 10/1526 useless extension candidates. Maximal degree in co-relation 5549. Up to 973 conditions per place. [2022-12-06 03:54:43,133 INFO L137 encePairwiseOnDemand]: 23/56 looper letters, 113 selfloop transitions, 52 changer transitions 26/191 dead transitions. [2022-12-06 03:54:43,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 191 transitions, 1622 flow [2022-12-06 03:54:43,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 03:54:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 03:54:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 157 transitions. [2022-12-06 03:54:43,135 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16491596638655462 [2022-12-06 03:54:43,136 INFO L175 Difference]: Start difference. First operand has 95 places, 98 transitions, 770 flow. Second operand 17 states and 157 transitions. [2022-12-06 03:54:43,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 191 transitions, 1622 flow [2022-12-06 03:54:43,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 191 transitions, 1553 flow, removed 31 selfloop flow, removed 5 redundant places. [2022-12-06 03:54:43,150 INFO L231 Difference]: Finished difference. Result has 114 places, 117 transitions, 1064 flow [2022-12-06 03:54:43,151 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1064, PETRI_PLACES=114, PETRI_TRANSITIONS=117} [2022-12-06 03:54:43,151 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 46 predicate places. [2022-12-06 03:54:43,152 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:43,152 INFO L89 Accepts]: Start accepts. Operand has 114 places, 117 transitions, 1064 flow [2022-12-06 03:54:43,153 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:43,153 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:43,153 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 117 transitions, 1064 flow [2022-12-06 03:54:43,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 117 transitions, 1064 flow [2022-12-06 03:54:43,181 INFO L130 PetriNetUnfolder]: 113/383 cut-off events. [2022-12-06 03:54:43,181 INFO L131 PetriNetUnfolder]: For 1440/1441 co-relation queries the response was YES. [2022-12-06 03:54:43,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 383 events. 113/383 cut-off events. For 1440/1441 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2070 event pairs, 10 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 1443. Up to 83 conditions per place. [2022-12-06 03:54:43,185 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 117 transitions, 1064 flow [2022-12-06 03:54:43,185 INFO L188 LiptonReduction]: Number of co-enabled transitions 510 [2022-12-06 03:54:43,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [963] L1018-6-->t1EXIT: Formula: (and (= |v_t1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_t1Thread1of1ForFork0_~i~0#1_In_3| 399)) (= |v_t1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{t1Thread1of1ForFork0_#res#1.offset=|v_t1Thread1of1ForFork0_#res#1.offset_Out_4|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_In_3|, t1Thread1of1ForFork0_#res#1.base=|v_t1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#res#1.offset, t1Thread1of1ForFork0_#res#1.base] and [1020] L1037-6-->L1037-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_585| |v_~#m~0.base_263|))) (and (= (store |v_#pthreadsMutex_585| |v_~#m~0.base_263| (store .cse0 |v_~#m~0.offset_263| 0)) |v_#pthreadsMutex_583|) (= 0 (mod v_~dequeue_flag~0_204 256)) (= (select .cse0 |v_~#m~0.offset_263|) 0) (= |v_t2Thread1of1ForFork1_~i~1#1_239| (+ |v_t2Thread1of1ForFork1_~i~1#1_240| 1)) (< |v_t2Thread1of1ForFork1_~i~1#1_240| 400))) InVars {#pthreadsMutex=|v_#pthreadsMutex_585|, ~#m~0.base=|v_~#m~0.base_263|, ~#m~0.offset=|v_~#m~0.offset_263|, ~dequeue_flag~0=v_~dequeue_flag~0_204, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_240|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_583|, ~#m~0.base=|v_~#m~0.base_263|, ~#m~0.offset=|v_~#m~0.offset_263|, ~dequeue_flag~0=v_~dequeue_flag~0_204, t2Thread1of1ForFork1_#t~nondet58#1=|v_t2Thread1of1ForFork1_#t~nondet58#1_89|, t2Thread1of1ForFork1_#t~post57#1=|v_t2Thread1of1ForFork1_#t~post57#1_57|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_239|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~nondet58#1, t2Thread1of1ForFork1_#t~post57#1, t2Thread1of1ForFork1_~i~1#1] [2022-12-06 03:54:43,426 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:54:43,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 274 [2022-12-06 03:54:43,426 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 115 transitions, 1066 flow [2022-12-06 03:54:43,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:43,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:43,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:43,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 03:54:43,427 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:54:43,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:43,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1029465877, now seen corresponding path program 3 times [2022-12-06 03:54:43,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:43,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473545840] [2022-12-06 03:54:43,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:43,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:09,190 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 03:55:09,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:55:09,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473545840] [2022-12-06 03:55:09,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473545840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:55:09,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:55:09,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 03:55:09,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877323187] [2022-12-06 03:55:09,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:55:09,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:55:09,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:55:09,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:55:09,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:55:09,193 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 03:55:09,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 115 transitions, 1066 flow. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:09,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:55:09,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 03:55:09,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:55:28,246 WARN L233 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 129 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:55:31,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 03:55:34,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 03:55:38,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 03:55:40,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 03:55:43,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 03:55:45,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 03:55:48,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 03:55:50,232 INFO L130 PetriNetUnfolder]: 883/1565 cut-off events. [2022-12-06 03:55:50,232 INFO L131 PetriNetUnfolder]: For 6283/6283 co-relation queries the response was YES. [2022-12-06 03:55:50,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7064 conditions, 1565 events. 883/1565 cut-off events. For 6283/6283 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7522 event pairs, 296 based on Foata normal form. 8/1572 useless extension candidates. Maximal degree in co-relation 6683. Up to 1087 conditions per place. [2022-12-06 03:55:50,244 INFO L137 encePairwiseOnDemand]: 26/59 looper letters, 131 selfloop transitions, 79 changer transitions 13/223 dead transitions. [2022-12-06 03:55:50,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 223 transitions, 2200 flow [2022-12-06 03:55:50,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 03:55:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 03:55:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 177 transitions. [2022-12-06 03:55:50,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15 [2022-12-06 03:55:50,267 INFO L175 Difference]: Start difference. First operand has 111 places, 115 transitions, 1066 flow. Second operand 20 states and 177 transitions. [2022-12-06 03:55:50,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 223 transitions, 2200 flow [2022-12-06 03:55:50,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 223 transitions, 2046 flow, removed 60 selfloop flow, removed 7 redundant places. [2022-12-06 03:55:50,301 INFO L231 Difference]: Finished difference. Result has 136 places, 156 transitions, 1637 flow [2022-12-06 03:55:50,301 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1637, PETRI_PLACES=136, PETRI_TRANSITIONS=156} [2022-12-06 03:55:50,301 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 68 predicate places. [2022-12-06 03:55:50,302 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:55:50,302 INFO L89 Accepts]: Start accepts. Operand has 136 places, 156 transitions, 1637 flow [2022-12-06 03:55:50,306 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:55:50,306 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:55:50,306 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 156 transitions, 1637 flow [2022-12-06 03:55:50,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 156 transitions, 1637 flow [2022-12-06 03:55:50,367 INFO L130 PetriNetUnfolder]: 141/431 cut-off events. [2022-12-06 03:55:50,367 INFO L131 PetriNetUnfolder]: For 2177/2181 co-relation queries the response was YES. [2022-12-06 03:55:50,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1974 conditions, 431 events. 141/431 cut-off events. For 2177/2181 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2280 event pairs, 5 based on Foata normal form. 3/423 useless extension candidates. Maximal degree in co-relation 1899. Up to 96 conditions per place. [2022-12-06 03:55:50,374 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 156 transitions, 1637 flow [2022-12-06 03:55:50,374 INFO L188 LiptonReduction]: Number of co-enabled transitions 614 [2022-12-06 03:55:50,625 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [877] $Ultimate##0-->L1037-6: Formula: (and (= |v_t2Thread1of1ForFork1_~arg#1.offset_5| |v_t2Thread1of1ForFork1_#in~arg#1.offset_5|) (= |v_t2Thread1of1ForFork1_#in~arg#1.base_5| |v_t2Thread1of1ForFork1_~arg#1.base_5|) (= |v_t2Thread1of1ForFork1_~i~1#1_35| 0)) InVars {t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_5|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_5|} OutVars{t2Thread1of1ForFork1_~arg#1.base=|v_t2Thread1of1ForFork1_~arg#1.base_5|, t2Thread1of1ForFork1_~arg#1.offset=|v_t2Thread1of1ForFork1_~arg#1.offset_5|, t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_5|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_5|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_35|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg#1.base, t2Thread1of1ForFork1_~arg#1.offset, t2Thread1of1ForFork1_~i~1#1] and [801] L980-1-->L981: Formula: (= (store |v_#memory_int_173| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_77| (store (select |v_#memory_int_173| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_77|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_77|) |v_t1Thread1of1ForFork0_enqueue_~x#1_21|)) |v_#memory_int_172|) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_77|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_77|, #memory_int=|v_#memory_int_173|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_21|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_77|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_77|, #memory_int=|v_#memory_int_172|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_21|} AuxVars[] AssignedVars[#memory_int, t1Thread1of1ForFork0_enqueue_#t~mem36#1] [2022-12-06 03:55:50,645 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [877] $Ultimate##0-->L1037-6: Formula: (and (= |v_t2Thread1of1ForFork1_~arg#1.offset_5| |v_t2Thread1of1ForFork1_#in~arg#1.offset_5|) (= |v_t2Thread1of1ForFork1_#in~arg#1.base_5| |v_t2Thread1of1ForFork1_~arg#1.base_5|) (= |v_t2Thread1of1ForFork1_~i~1#1_35| 0)) InVars {t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_5|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_5|} OutVars{t2Thread1of1ForFork1_~arg#1.base=|v_t2Thread1of1ForFork1_~arg#1.base_5|, t2Thread1of1ForFork1_~arg#1.offset=|v_t2Thread1of1ForFork1_~arg#1.offset_5|, t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_5|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_5|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_35|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg#1.base, t2Thread1of1ForFork1_~arg#1.offset, t2Thread1of1ForFork1_~i~1#1] and [1012] $Ultimate##0-->L981: Formula: (let ((.cse0 (select |v_#pthreadsMutex_530| |v_~#m~0.base_236|))) (and (= (select .cse0 |v_~#m~0.offset_236|) 0) (= |v_#memory_int_2163| (store |v_#memory_int_2164| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_781| (let ((.cse1 (select |v_#memory_int_2164| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_781|))) (store .cse1 (+ (* (select .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_781| 1604)) 4) |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_781|) |v_t1Thread1of1ForFork0_enqueue_~x#1_207|)))) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_207| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_127|) (= |v_~#queue~0.base_261| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_125|) (= |v_t1Thread1of1ForFork0_~value~0#1_202| |v_t1Thread1of1ForFork0_#t~nondet50#1_120|) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_781| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_125|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_125| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_781|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_125| |v_~#queue~0.offset_256|) (= |v_t1Thread1of1ForFork0_#in~arg#1.offset_75| |v_t1Thread1of1ForFork0_~arg#1.offset_75|) (= |v_t1Thread1of1ForFork0_~value~0#1_202| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_127|) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet50#1_120| 2147483648)) (= (store |v_#pthreadsMutex_530| |v_~#m~0.base_236| (store .cse0 |v_~#m~0.offset_236| 1)) |v_#pthreadsMutex_529|) (= |v_t1Thread1of1ForFork0_~arg#1.base_75| |v_t1Thread1of1ForFork0_#in~arg#1.base_75|) (<= |v_t1Thread1of1ForFork0_#t~nondet50#1_120| 2147483647))) InVars {#pthreadsMutex=|v_#pthreadsMutex_530|, ~#m~0.base=|v_~#m~0.base_236|, ~#queue~0.base=|v_~#queue~0.base_261|, t1Thread1of1ForFork0_#t~nondet50#1=|v_t1Thread1of1ForFork0_#t~nondet50#1_120|, ~#m~0.offset=|v_~#m~0.offset_236|, #memory_int=|v_#memory_int_2164|, ~#queue~0.offset=|v_~#queue~0.offset_256|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_75|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_75|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_227|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_75|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_781|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_202|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_125|, ~#queue~0.base=|v_~#queue~0.base_261|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_781|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_127|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_282|, ~#queue~0.offset=|v_~#queue~0.offset_256|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_75|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_390|, #pthreadsMutex=|v_#pthreadsMutex_529|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_292|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_338|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_75|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295|, ~#m~0.base=|v_~#m~0.base_236|, ~#m~0.offset=|v_~#m~0.offset_236|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_79|, #memory_int=|v_#memory_int_2163|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_207|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_125|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_288|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_75|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_339|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_~arg#1.offset, t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_enqueue_#in~q#1.base, t1Thread1of1ForFork0_#t~nondet50#1, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~x#1, t1Thread1of1ForFork0_#t~nondet49#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_~arg#1.base, #memory_int, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] [2022-12-06 03:55:50,809 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:55:50,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 508 [2022-12-06 03:55:50,810 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 154 transitions, 1651 flow [2022-12-06 03:55:50,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:50,810 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:55:50,810 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:55:50,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 03:55:50,810 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:55:50,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:55:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1823497802, now seen corresponding path program 1 times [2022-12-06 03:55:50,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:55:50,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456323741] [2022-12-06 03:55:50,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:50,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:55:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:51,886 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 03:55:51,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:55:51,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456323741] [2022-12-06 03:55:51,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456323741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:55:51,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:55:51,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 03:55:51,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495179772] [2022-12-06 03:55:51,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:55:51,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 03:55:51,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:55:51,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 03:55:51,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-06 03:55:51,888 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 63 [2022-12-06 03:55:51,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 154 transitions, 1651 flow. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:51,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:55:51,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 63 [2022-12-06 03:55:51,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:55:52,430 INFO L130 PetriNetUnfolder]: 845/1574 cut-off events. [2022-12-06 03:55:52,431 INFO L131 PetriNetUnfolder]: For 10335/10335 co-relation queries the response was YES. [2022-12-06 03:55:52,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7978 conditions, 1574 events. 845/1574 cut-off events. For 10335/10335 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8052 event pairs, 243 based on Foata normal form. 8/1581 useless extension candidates. Maximal degree in co-relation 7730. Up to 581 conditions per place. [2022-12-06 03:55:52,441 INFO L137 encePairwiseOnDemand]: 39/63 looper letters, 155 selfloop transitions, 38 changer transitions 9/203 dead transitions. [2022-12-06 03:55:52,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 203 transitions, 2382 flow [2022-12-06 03:55:52,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 03:55:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 03:55:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2022-12-06 03:55:52,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2345679012345679 [2022-12-06 03:55:52,442 INFO L175 Difference]: Start difference. First operand has 134 places, 154 transitions, 1651 flow. Second operand 9 states and 133 transitions. [2022-12-06 03:55:52,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 203 transitions, 2382 flow [2022-12-06 03:55:52,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 203 transitions, 2213 flow, removed 63 selfloop flow, removed 8 redundant places. [2022-12-06 03:55:52,481 INFO L231 Difference]: Finished difference. Result has 137 places, 157 transitions, 1633 flow [2022-12-06 03:55:52,481 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1633, PETRI_PLACES=137, PETRI_TRANSITIONS=157} [2022-12-06 03:55:52,482 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 69 predicate places. [2022-12-06 03:55:52,483 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:55:52,483 INFO L89 Accepts]: Start accepts. Operand has 137 places, 157 transitions, 1633 flow [2022-12-06 03:55:52,485 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:55:52,485 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:55:52,485 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 157 transitions, 1633 flow [2022-12-06 03:55:52,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 157 transitions, 1633 flow [2022-12-06 03:55:52,537 INFO L130 PetriNetUnfolder]: 150/486 cut-off events. [2022-12-06 03:55:52,537 INFO L131 PetriNetUnfolder]: For 2223/2225 co-relation queries the response was YES. [2022-12-06 03:55:52,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 486 events. 150/486 cut-off events. For 2223/2225 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2836 event pairs, 10 based on Foata normal form. 2/479 useless extension candidates. Maximal degree in co-relation 2080. Up to 101 conditions per place. [2022-12-06 03:55:52,542 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 157 transitions, 1633 flow [2022-12-06 03:55:52,542 INFO L188 LiptonReduction]: Number of co-enabled transitions 634 [2022-12-06 03:55:52,550 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:55:52,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 03:55:52,550 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 157 transitions, 1633 flow [2022-12-06 03:55:52,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:52,550 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:55:52,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:55:52,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 03:55:52,551 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:55:52,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:55:52,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1178882019, now seen corresponding path program 1 times [2022-12-06 03:55:52,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:55:52,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796778275] [2022-12-06 03:55:52,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:52,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:55:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:53,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:55:53,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796778275] [2022-12-06 03:55:53,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796778275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:55:53,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:55:53,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 03:55:53,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509716476] [2022-12-06 03:55:53,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:55:53,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 03:55:53,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:55:53,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 03:55:53,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-06 03:55:53,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 03:55:53,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 157 transitions, 1633 flow. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:53,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:55:53,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 03:55:53,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:55:55,037 INFO L130 PetriNetUnfolder]: 1159/2048 cut-off events. [2022-12-06 03:55:55,038 INFO L131 PetriNetUnfolder]: For 12253/12253 co-relation queries the response was YES. [2022-12-06 03:55:55,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10262 conditions, 2048 events. 1159/2048 cut-off events. For 12253/12253 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 10498 event pairs, 329 based on Foata normal form. 8/2055 useless extension candidates. Maximal degree in co-relation 10177. Up to 1564 conditions per place. [2022-12-06 03:55:55,058 INFO L137 encePairwiseOnDemand]: 33/62 looper letters, 175 selfloop transitions, 44 changer transitions 26/245 dead transitions. [2022-12-06 03:55:55,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 245 transitions, 2774 flow [2022-12-06 03:55:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 03:55:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 03:55:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 152 transitions. [2022-12-06 03:55:55,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1532258064516129 [2022-12-06 03:55:55,077 INFO L175 Difference]: Start difference. First operand has 136 places, 157 transitions, 1633 flow. Second operand 16 states and 152 transitions. [2022-12-06 03:55:55,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 245 transitions, 2774 flow [2022-12-06 03:55:55,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 245 transitions, 2704 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-06 03:55:55,121 INFO L231 Difference]: Finished difference. Result has 157 places, 185 transitions, 2095 flow [2022-12-06 03:55:55,122 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2095, PETRI_PLACES=157, PETRI_TRANSITIONS=185} [2022-12-06 03:55:55,122 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 89 predicate places. [2022-12-06 03:55:55,122 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:55:55,122 INFO L89 Accepts]: Start accepts. Operand has 157 places, 185 transitions, 2095 flow [2022-12-06 03:55:55,124 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:55:55,124 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:55:55,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 185 transitions, 2095 flow [2022-12-06 03:55:55,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 185 transitions, 2095 flow [2022-12-06 03:55:55,193 INFO L130 PetriNetUnfolder]: 175/577 cut-off events. [2022-12-06 03:55:55,193 INFO L131 PetriNetUnfolder]: For 4205/4212 co-relation queries the response was YES. [2022-12-06 03:55:55,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2865 conditions, 577 events. 175/577 cut-off events. For 4205/4212 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3594 event pairs, 9 based on Foata normal form. 1/573 useless extension candidates. Maximal degree in co-relation 2758. Up to 125 conditions per place. [2022-12-06 03:55:55,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 185 transitions, 2095 flow [2022-12-06 03:55:55,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 732 [2022-12-06 03:55:55,206 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [963] L1018-6-->t1EXIT: Formula: (and (= |v_t1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_t1Thread1of1ForFork0_~i~0#1_In_3| 399)) (= |v_t1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{t1Thread1of1ForFork0_#res#1.offset=|v_t1Thread1of1ForFork0_#res#1.offset_Out_4|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_In_3|, t1Thread1of1ForFork0_#res#1.base=|v_t1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#res#1.offset, t1Thread1of1ForFork0_#res#1.base] and [1020] L1037-6-->L1037-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_585| |v_~#m~0.base_263|))) (and (= (store |v_#pthreadsMutex_585| |v_~#m~0.base_263| (store .cse0 |v_~#m~0.offset_263| 0)) |v_#pthreadsMutex_583|) (= 0 (mod v_~dequeue_flag~0_204 256)) (= (select .cse0 |v_~#m~0.offset_263|) 0) (= |v_t2Thread1of1ForFork1_~i~1#1_239| (+ |v_t2Thread1of1ForFork1_~i~1#1_240| 1)) (< |v_t2Thread1of1ForFork1_~i~1#1_240| 400))) InVars {#pthreadsMutex=|v_#pthreadsMutex_585|, ~#m~0.base=|v_~#m~0.base_263|, ~#m~0.offset=|v_~#m~0.offset_263|, ~dequeue_flag~0=v_~dequeue_flag~0_204, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_240|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_583|, ~#m~0.base=|v_~#m~0.base_263|, ~#m~0.offset=|v_~#m~0.offset_263|, ~dequeue_flag~0=v_~dequeue_flag~0_204, t2Thread1of1ForFork1_#t~nondet58#1=|v_t2Thread1of1ForFork1_#t~nondet58#1_89|, t2Thread1of1ForFork1_#t~post57#1=|v_t2Thread1of1ForFork1_#t~post57#1_57|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_239|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~nondet58#1, t2Thread1of1ForFork1_#t~post57#1, t2Thread1of1ForFork1_~i~1#1] [2022-12-06 03:55:55,275 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [877] $Ultimate##0-->L1037-6: Formula: (and (= |v_t2Thread1of1ForFork1_~arg#1.offset_5| |v_t2Thread1of1ForFork1_#in~arg#1.offset_5|) (= |v_t2Thread1of1ForFork1_#in~arg#1.base_5| |v_t2Thread1of1ForFork1_~arg#1.base_5|) (= |v_t2Thread1of1ForFork1_~i~1#1_35| 0)) InVars {t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_5|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_5|} OutVars{t2Thread1of1ForFork1_~arg#1.base=|v_t2Thread1of1ForFork1_~arg#1.base_5|, t2Thread1of1ForFork1_~arg#1.offset=|v_t2Thread1of1ForFork1_~arg#1.offset_5|, t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_5|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_5|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_35|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg#1.base, t2Thread1of1ForFork1_~arg#1.offset, t2Thread1of1ForFork1_~i~1#1] and [958] L982-4-->L958: Formula: (and (= (store |v_#memory_int_741| |v_~#stored_elements~0.base_74| (store (select |v_#memory_int_741| |v_~#stored_elements~0.base_74|) |v_~#stored_elements~0.offset_67| |v_t1Thread1of1ForFork0_~value~0#1_85|)) |v_#memory_int_740|) (= |v_t1Thread1of1ForFork0_enqueue_#res#1_85| 0) (= |v_t1Thread1of1ForFork0_empty_#in~q#1.offset_25| |v_~#queue~0.offset_92|) (= |v_t1Thread1of1ForFork0_empty_#in~q#1.base_25| |v_~#queue~0.base_97|)) InVars {~#queue~0.base=|v_~#queue~0.base_97|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_85|, ~#stored_elements~0.base=|v_~#stored_elements~0.base_74|, ~#queue~0.offset=|v_~#queue~0.offset_92|, #memory_int=|v_#memory_int_741|, ~#stored_elements~0.offset=|v_~#stored_elements~0.offset_67|} OutVars{t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_43|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_25|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_85|, t1Thread1of1ForFork0_#t~ret51#1=|v_t1Thread1of1ForFork0_#t~ret51#1_47|, t1Thread1of1ForFork0_empty_#t~mem31#1=|v_t1Thread1of1ForFork0_empty_#t~mem31#1_65|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_43|, ~#queue~0.base=|v_~#queue~0.base_97|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_15|, ~#stored_elements~0.base=|v_~#stored_elements~0.base_74|, t1Thread1of1ForFork0_empty_#t~mem32#1=|v_t1Thread1of1ForFork0_empty_#t~mem32#1_51|, ~#queue~0.offset=|v_~#queue~0.offset_92|, #memory_int=|v_#memory_int_740|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_85|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_25|, ~#stored_elements~0.offset=|v_~#stored_elements~0.offset_67|, t1Thread1of1ForFork0_empty_#res#1=|v_t1Thread1of1ForFork0_empty_#res#1_39|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_empty_~q#1.offset, t1Thread1of1ForFork0_empty_#in~q#1.offset, t1Thread1of1ForFork0_empty_#t~nondet33#1, t1Thread1of1ForFork0_#t~ret51#1, t1Thread1of1ForFork0_empty_#t~mem32#1, t1Thread1of1ForFork0_empty_#t~mem31#1, #memory_int, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_empty_~q#1.base, t1Thread1of1ForFork0_empty_#in~q#1.base, t1Thread1of1ForFork0_empty_#res#1] [2022-12-06 03:55:55,319 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [877] $Ultimate##0-->L1037-6: Formula: (and (= |v_t2Thread1of1ForFork1_~arg#1.offset_5| |v_t2Thread1of1ForFork1_#in~arg#1.offset_5|) (= |v_t2Thread1of1ForFork1_#in~arg#1.base_5| |v_t2Thread1of1ForFork1_~arg#1.base_5|) (= |v_t2Thread1of1ForFork1_~i~1#1_35| 0)) InVars {t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_5|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_5|} OutVars{t2Thread1of1ForFork1_~arg#1.base=|v_t2Thread1of1ForFork1_~arg#1.base_5|, t2Thread1of1ForFork1_~arg#1.offset=|v_t2Thread1of1ForFork1_~arg#1.offset_5|, t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_5|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_5|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_35|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg#1.base, t2Thread1of1ForFork1_~arg#1.offset, t2Thread1of1ForFork1_~i~1#1] and [958] L982-4-->L958: Formula: (and (= (store |v_#memory_int_741| |v_~#stored_elements~0.base_74| (store (select |v_#memory_int_741| |v_~#stored_elements~0.base_74|) |v_~#stored_elements~0.offset_67| |v_t1Thread1of1ForFork0_~value~0#1_85|)) |v_#memory_int_740|) (= |v_t1Thread1of1ForFork0_enqueue_#res#1_85| 0) (= |v_t1Thread1of1ForFork0_empty_#in~q#1.offset_25| |v_~#queue~0.offset_92|) (= |v_t1Thread1of1ForFork0_empty_#in~q#1.base_25| |v_~#queue~0.base_97|)) InVars {~#queue~0.base=|v_~#queue~0.base_97|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_85|, ~#stored_elements~0.base=|v_~#stored_elements~0.base_74|, ~#queue~0.offset=|v_~#queue~0.offset_92|, #memory_int=|v_#memory_int_741|, ~#stored_elements~0.offset=|v_~#stored_elements~0.offset_67|} OutVars{t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_43|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_25|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_85|, t1Thread1of1ForFork0_#t~ret51#1=|v_t1Thread1of1ForFork0_#t~ret51#1_47|, t1Thread1of1ForFork0_empty_#t~mem31#1=|v_t1Thread1of1ForFork0_empty_#t~mem31#1_65|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_43|, ~#queue~0.base=|v_~#queue~0.base_97|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_15|, ~#stored_elements~0.base=|v_~#stored_elements~0.base_74|, t1Thread1of1ForFork0_empty_#t~mem32#1=|v_t1Thread1of1ForFork0_empty_#t~mem32#1_51|, ~#queue~0.offset=|v_~#queue~0.offset_92|, #memory_int=|v_#memory_int_740|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_85|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_25|, ~#stored_elements~0.offset=|v_~#stored_elements~0.offset_67|, t1Thread1of1ForFork0_empty_#res#1=|v_t1Thread1of1ForFork0_empty_#res#1_39|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_empty_~q#1.offset, t1Thread1of1ForFork0_empty_#in~q#1.offset, t1Thread1of1ForFork0_empty_#t~nondet33#1, t1Thread1of1ForFork0_#t~ret51#1, t1Thread1of1ForFork0_empty_#t~mem32#1, t1Thread1of1ForFork0_empty_#t~mem31#1, #memory_int, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_empty_~q#1.base, t1Thread1of1ForFork0_empty_#in~q#1.base, t1Thread1of1ForFork0_empty_#res#1] [2022-12-06 03:55:55,657 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1004] L958-->L1018-6: Formula: (and (not (let ((.cse0 (select |v_#memory_int_2137| |v_t1Thread1of1ForFork0_empty_~q#1.base_122|))) (= (select .cse0 (+ |v_t1Thread1of1ForFork0_empty_~q#1.offset_122| 1604)) (select .cse0 (+ 1600 |v_t1Thread1of1ForFork0_empty_~q#1.offset_122|))))) (= |v_t1Thread1of1ForFork0_empty_#t~nondet33#1_115| |v_t1Thread1of1ForFork0_empty_#t~nondet33#1_114|) (= |v_t1Thread1of1ForFork0_empty_#res#1_114| 0) (= |v_t1Thread1of1ForFork0_empty_~q#1.base_122| |v_t1Thread1of1ForFork0_empty_#in~q#1.base_66|) (= |v_t1Thread1of1ForFork0_empty_~q#1.offset_122| |v_t1Thread1of1ForFork0_empty_#in~q#1.offset_66|) (= |v_t1Thread1of1ForFork0_~i~0#1_219| 0) (= (store |v_#pthreadsMutex_506| |v_~#m~0.base_224| (store (select |v_#pthreadsMutex_506| |v_~#m~0.base_224|) |v_~#m~0.offset_224| 0)) |v_#pthreadsMutex_505|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_506|, ~#m~0.base=|v_~#m~0.base_224|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_66|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_115|, ~#m~0.offset=|v_~#m~0.offset_224|, #memory_int=|v_#memory_int_2137|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_66|} OutVars{t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_122|, #pthreadsMutex=|v_#pthreadsMutex_505|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_66|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_219|, t1Thread1of1ForFork0_empty_#t~mem31#1=|v_t1Thread1of1ForFork0_empty_#t~mem31#1_194|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_122|, ~#m~0.base=|v_~#m~0.base_224|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_114|, ~#m~0.offset=|v_~#m~0.offset_224|, t1Thread1of1ForFork0_empty_#t~mem32#1=|v_t1Thread1of1ForFork0_empty_#t~mem32#1_120|, t1Thread1of1ForFork0_#t~ret52#1=|v_t1Thread1of1ForFork0_#t~ret52#1_67|, #memory_int=|v_#memory_int_2137|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_66|, t1Thread1of1ForFork0_empty_#res#1=|v_t1Thread1of1ForFork0_empty_#res#1_114|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_empty_~q#1.offset, #pthreadsMutex, t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_empty_#t~nondet33#1, t1Thread1of1ForFork0_empty_#t~mem32#1, t1Thread1of1ForFork0_empty_#t~mem31#1, t1Thread1of1ForFork0_#t~ret52#1, t1Thread1of1ForFork0_empty_~q#1.base, t1Thread1of1ForFork0_empty_#res#1] and [1020] L1037-6-->L1037-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_585| |v_~#m~0.base_263|))) (and (= (store |v_#pthreadsMutex_585| |v_~#m~0.base_263| (store .cse0 |v_~#m~0.offset_263| 0)) |v_#pthreadsMutex_583|) (= 0 (mod v_~dequeue_flag~0_204 256)) (= (select .cse0 |v_~#m~0.offset_263|) 0) (= |v_t2Thread1of1ForFork1_~i~1#1_239| (+ |v_t2Thread1of1ForFork1_~i~1#1_240| 1)) (< |v_t2Thread1of1ForFork1_~i~1#1_240| 400))) InVars {#pthreadsMutex=|v_#pthreadsMutex_585|, ~#m~0.base=|v_~#m~0.base_263|, ~#m~0.offset=|v_~#m~0.offset_263|, ~dequeue_flag~0=v_~dequeue_flag~0_204, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_240|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_583|, ~#m~0.base=|v_~#m~0.base_263|, ~#m~0.offset=|v_~#m~0.offset_263|, ~dequeue_flag~0=v_~dequeue_flag~0_204, t2Thread1of1ForFork1_#t~nondet58#1=|v_t2Thread1of1ForFork1_#t~nondet58#1_89|, t2Thread1of1ForFork1_#t~post57#1=|v_t2Thread1of1ForFork1_#t~post57#1_57|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_239|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~nondet58#1, t2Thread1of1ForFork1_#t~post57#1, t2Thread1of1ForFork1_~i~1#1] [2022-12-06 03:55:56,211 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 03:55:56,211 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1089 [2022-12-06 03:55:56,212 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 183 transitions, 2141 flow [2022-12-06 03:55:56,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:56,212 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:55:56,212 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:55:56,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 03:55:56,213 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 03:55:56,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:55:56,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1851917849, now seen corresponding path program 1 times [2022-12-06 03:55:56,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:55:56,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827342539] [2022-12-06 03:55:56,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:56,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:55:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-12-06 04:04:49,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 04:04:49,901 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:152) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:848) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:776) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) 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 04:04:49,903 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 04:04:49,907 INFO L158 Benchmark]: Toolchain (without parser) took 669490.61ms. Allocated memory was 168.8MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 143.8MB in the beginning and 559.9MB in the end (delta: -416.2MB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2022-12-06 04:04:49,907 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 168.8MB. Free memory was 145.2MB in the beginning and 145.1MB in the end (delta: 85.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:04:49,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.59ms. Allocated memory is still 168.8MB. Free memory was 143.8MB in the beginning and 113.9MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 04:04:49,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.32ms. Allocated memory is still 168.8MB. Free memory was 113.4MB in the beginning and 110.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:04:49,908 INFO L158 Benchmark]: Boogie Preprocessor took 40.45ms. Allocated memory is still 168.8MB. Free memory was 110.7MB in the beginning and 108.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:04:49,908 INFO L158 Benchmark]: RCFGBuilder took 682.91ms. Allocated memory is still 168.8MB. Free memory was 108.1MB in the beginning and 85.6MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-06 04:04:49,908 INFO L158 Benchmark]: TraceAbstraction took 668188.35ms. Allocated memory was 168.8MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 85.0MB in the beginning and 559.9MB in the end (delta: -474.9MB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2022-12-06 04:04:49,910 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 168.8MB. Free memory was 145.2MB in the beginning and 145.1MB in the end (delta: 85.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 515.59ms. Allocated memory is still 168.8MB. Free memory was 143.8MB in the beginning and 113.9MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.32ms. Allocated memory is still 168.8MB. Free memory was 113.4MB in the beginning and 110.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.45ms. Allocated memory is still 168.8MB. Free memory was 110.7MB in the beginning and 108.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 682.91ms. Allocated memory is still 168.8MB. Free memory was 108.1MB in the beginning and 85.6MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 668188.35ms. Allocated memory was 168.8MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 85.0MB in the beginning and 559.9MB in the end (delta: -474.9MB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 237 PlacesBefore, 68 PlacesAfterwards, 245 TransitionsBefore, 72 TransitionsAfterwards, 15600 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 123 ConcurrentYvCompositions, 5 ChoiceCompositions, 192 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10791, independent: 10403, independent conditional: 10403, independent unconditional: 0, dependent: 388, dependent conditional: 388, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10791, independent: 10403, independent conditional: 0, independent unconditional: 10403, dependent: 388, dependent conditional: 0, dependent unconditional: 388, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10791, independent: 10403, independent conditional: 0, independent unconditional: 10403, dependent: 388, dependent conditional: 0, dependent unconditional: 388, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10791, independent: 10403, independent conditional: 0, independent unconditional: 10403, dependent: 388, dependent conditional: 0, dependent unconditional: 388, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8952, independent: 8822, independent conditional: 0, independent unconditional: 8822, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8952, independent: 8795, independent conditional: 0, independent unconditional: 8795, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 157, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 234, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10791, independent: 1581, independent conditional: 0, independent unconditional: 1581, dependent: 258, dependent conditional: 0, dependent unconditional: 258, unknown: 8952, unknown conditional: 0, unknown unconditional: 8952] , Statistics on independence cache: Total cache size (in pairs): 14712, Positive cache size: 14582, Positive conditional cache size: 0, Positive unconditional cache size: 14582, Negative cache size: 130, Negative conditional cache size: 0, Negative unconditional cache size: 130, 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, 62 PlacesBefore, 61 PlacesAfterwards, 66 TransitionsBefore, 65 TransitionsAfterwards, 1874 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 772, independent: 595, independent conditional: 595, independent unconditional: 0, dependent: 177, dependent conditional: 177, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 772, independent: 595, independent conditional: 0, independent unconditional: 595, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 772, independent: 595, independent conditional: 0, independent unconditional: 595, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 772, independent: 595, independent conditional: 0, independent unconditional: 595, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 348, independent: 271, independent conditional: 0, independent unconditional: 271, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 348, independent: 256, independent conditional: 0, independent unconditional: 256, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 92, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 99, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 772, independent: 324, independent conditional: 0, independent unconditional: 324, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 348, unknown conditional: 0, unknown unconditional: 348] , Statistics on independence cache: Total cache size (in pairs): 349, Positive cache size: 272, Positive conditional cache size: 0, Positive unconditional cache size: 272, Negative cache size: 77, Negative conditional cache size: 0, Negative unconditional cache size: 77, 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, 60 PlacesBefore, 60 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 1280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 212, independent: 132, independent conditional: 132, independent unconditional: 0, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 212, independent: 132, independent conditional: 0, independent unconditional: 132, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 212, independent: 132, independent conditional: 0, independent unconditional: 132, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 212, independent: 132, independent conditional: 0, independent unconditional: 132, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 97, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 97, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 212, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 97, unknown conditional: 0, unknown unconditional: 97] , Statistics on independence cache: Total cache size (in pairs): 446, Positive cache size: 317, Positive conditional cache size: 0, Positive unconditional cache size: 317, Negative cache size: 129, Negative conditional cache size: 0, Negative unconditional cache size: 129, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 70 PlacesBefore, 66 PlacesAfterwards, 70 TransitionsBefore, 66 TransitionsAfterwards, 1268 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 797, independent: 645, independent conditional: 645, independent unconditional: 0, dependent: 152, dependent conditional: 152, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 797, independent: 645, independent conditional: 1, independent unconditional: 644, dependent: 152, dependent conditional: 23, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 797, independent: 645, independent conditional: 1, independent unconditional: 644, dependent: 152, dependent conditional: 23, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 797, independent: 645, independent conditional: 1, independent unconditional: 644, dependent: 152, dependent conditional: 23, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 195, independent: 164, independent conditional: 1, independent unconditional: 163, dependent: 31, dependent conditional: 8, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 195, independent: 161, independent conditional: 0, independent unconditional: 161, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 31, dependent conditional: 8, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 42, dependent conditional: 16, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 797, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 121, dependent conditional: 15, dependent unconditional: 106, unknown: 195, unknown conditional: 9, unknown unconditional: 186] , Statistics on independence cache: Total cache size (in pairs): 661, Positive cache size: 501, Positive conditional cache size: 1, Positive unconditional cache size: 500, Negative cache size: 160, Negative conditional cache size: 8, Negative unconditional cache size: 152, 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, 65 PlacesBefore, 65 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 1202 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 470, independent: 395, independent conditional: 395, independent unconditional: 0, dependent: 75, dependent conditional: 75, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 470, independent: 395, independent conditional: 39, independent unconditional: 356, dependent: 75, dependent conditional: 18, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 470, independent: 395, independent conditional: 39, independent unconditional: 356, dependent: 75, dependent conditional: 18, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 470, independent: 395, independent conditional: 39, independent unconditional: 356, dependent: 75, dependent conditional: 18, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 177, independent: 155, independent conditional: 1, independent unconditional: 154, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 177, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 470, independent: 240, independent conditional: 38, independent unconditional: 202, dependent: 53, dependent conditional: 16, dependent unconditional: 37, unknown: 177, unknown conditional: 3, unknown unconditional: 174] , Statistics on independence cache: Total cache size (in pairs): 838, Positive cache size: 656, Positive conditional cache size: 2, Positive unconditional cache size: 654, Negative cache size: 182, Negative conditional cache size: 10, Negative unconditional cache size: 172, 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, 72 PlacesBefore, 69 PlacesAfterwards, 73 TransitionsBefore, 70 TransitionsAfterwards, 1206 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 716, independent: 580, independent conditional: 580, independent unconditional: 0, dependent: 136, dependent conditional: 136, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 716, independent: 580, independent conditional: 40, independent unconditional: 540, dependent: 136, dependent conditional: 24, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 734, independent: 580, independent conditional: 40, independent unconditional: 540, dependent: 154, dependent conditional: 42, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734, independent: 580, independent conditional: 40, independent unconditional: 540, dependent: 154, dependent conditional: 42, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 8, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 734, independent: 564, independent conditional: 40, independent unconditional: 524, dependent: 142, dependent conditional: 38, dependent unconditional: 104, unknown: 28, unknown conditional: 4, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 893, Positive cache size: 699, Positive conditional cache size: 2, Positive unconditional cache size: 697, Negative cache size: 194, Negative conditional cache size: 14, Negative unconditional cache size: 180, 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, 73 PlacesBefore, 72 PlacesAfterwards, 74 TransitionsBefore, 73 TransitionsAfterwards, 1270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 788, independent: 638, independent conditional: 638, independent unconditional: 0, dependent: 150, dependent conditional: 150, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 788, independent: 638, independent conditional: 118, independent unconditional: 520, dependent: 150, dependent conditional: 46, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 800, independent: 638, independent conditional: 118, independent unconditional: 520, dependent: 162, dependent conditional: 58, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 800, independent: 638, independent conditional: 118, independent unconditional: 520, dependent: 162, dependent conditional: 58, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 10, independent conditional: 2, independent unconditional: 8, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 30, dependent conditional: 7, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 800, independent: 628, independent conditional: 116, independent unconditional: 512, dependent: 147, dependent conditional: 53, dependent unconditional: 94, unknown: 25, unknown conditional: 7, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 930, Positive cache size: 721, Positive conditional cache size: 4, Positive unconditional cache size: 717, Negative cache size: 209, Negative conditional cache size: 19, Negative unconditional cache size: 190, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 75 PlacesBefore, 73 PlacesAfterwards, 77 TransitionsBefore, 75 TransitionsAfterwards, 1318 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1303, independent: 1070, independent conditional: 1070, independent unconditional: 0, dependent: 233, dependent conditional: 233, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1303, independent: 1070, independent conditional: 148, independent unconditional: 922, dependent: 233, dependent conditional: 63, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1312, independent: 1070, independent conditional: 148, independent unconditional: 922, dependent: 242, dependent conditional: 72, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1312, independent: 1070, independent conditional: 148, independent unconditional: 922, dependent: 242, dependent conditional: 72, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 15, dependent conditional: 4, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 4, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 7, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1312, independent: 1062, independent conditional: 144, independent unconditional: 918, dependent: 227, dependent conditional: 68, dependent unconditional: 159, unknown: 23, unknown conditional: 8, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 984, Positive cache size: 760, Positive conditional cache size: 8, Positive unconditional cache size: 752, Negative cache size: 224, Negative conditional cache size: 23, Negative unconditional cache size: 201, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 1334 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 516, independent: 435, independent conditional: 435, independent unconditional: 0, dependent: 81, dependent conditional: 81, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 516, independent: 435, independent conditional: 93, independent unconditional: 342, dependent: 81, dependent conditional: 22, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 530, independent: 435, independent conditional: 93, independent unconditional: 342, dependent: 95, dependent conditional: 36, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 530, independent: 435, independent conditional: 93, independent unconditional: 342, dependent: 95, dependent conditional: 36, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 22, independent conditional: 5, independent unconditional: 17, dependent: 20, dependent conditional: 5, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 20, dependent conditional: 5, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 33, dependent conditional: 18, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 530, independent: 413, independent conditional: 88, independent unconditional: 325, dependent: 75, dependent conditional: 31, dependent unconditional: 44, unknown: 42, unknown conditional: 10, unknown unconditional: 32] , Statistics on independence cache: Total cache size (in pairs): 1026, Positive cache size: 782, Positive conditional cache size: 13, Positive unconditional cache size: 769, Negative cache size: 244, Negative conditional cache size: 28, Negative unconditional cache size: 216, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 75 PlacesBefore, 66 PlacesAfterwards, 76 TransitionsBefore, 67 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 426, independent: 341, independent conditional: 341, independent unconditional: 0, dependent: 85, dependent conditional: 85, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 426, independent: 341, independent conditional: 85, independent unconditional: 256, dependent: 85, dependent conditional: 35, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 446, independent: 341, independent conditional: 85, independent unconditional: 256, dependent: 105, dependent conditional: 55, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 446, independent: 341, independent conditional: 85, independent unconditional: 256, dependent: 105, dependent conditional: 55, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, independent: 27, independent conditional: 2, independent unconditional: 25, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 123, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 123, dependent conditional: 115, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 446, independent: 314, independent conditional: 83, independent unconditional: 231, dependent: 96, dependent conditional: 52, dependent unconditional: 44, unknown: 36, unknown conditional: 5, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 1348, Positive cache size: 1095, Positive conditional cache size: 15, Positive unconditional cache size: 1080, Negative cache size: 253, Negative conditional cache size: 31, Negative unconditional cache size: 222, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 79 PlacesBefore, 74 PlacesAfterwards, 78 TransitionsBefore, 73 TransitionsAfterwards, 534 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 218, independent: 151, independent conditional: 151, independent unconditional: 0, dependent: 67, dependent conditional: 67, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 218, independent: 151, independent conditional: 91, independent unconditional: 60, dependent: 67, dependent conditional: 55, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 230, independent: 151, independent conditional: 91, independent unconditional: 60, dependent: 79, dependent conditional: 67, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 230, independent: 151, independent conditional: 91, independent unconditional: 60, dependent: 79, dependent conditional: 67, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 12, independent conditional: 3, independent unconditional: 9, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 230, independent: 139, independent conditional: 88, independent unconditional: 51, dependent: 66, dependent conditional: 54, dependent unconditional: 12, unknown: 25, unknown conditional: 16, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 1437, Positive cache size: 1171, Positive conditional cache size: 18, Positive unconditional cache size: 1153, Negative cache size: 266, Negative conditional cache size: 44, Negative unconditional cache size: 222, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 66, independent conditional: 31, independent unconditional: 35, dependent: 34, dependent conditional: 28, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 103, independent: 66, independent conditional: 31, independent unconditional: 35, dependent: 37, dependent conditional: 31, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 103, independent: 66, independent conditional: 31, independent unconditional: 35, dependent: 37, dependent conditional: 31, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 103, independent: 63, independent conditional: 30, independent unconditional: 33, dependent: 34, dependent conditional: 28, dependent unconditional: 6, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1443, Positive cache size: 1174, Positive conditional cache size: 19, Positive unconditional cache size: 1155, Negative cache size: 269, Negative conditional cache size: 47, Negative unconditional cache size: 222, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 79 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 44, independent conditional: 24, independent unconditional: 20, dependent: 36, dependent conditional: 15, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 83, independent: 44, independent conditional: 24, independent unconditional: 20, dependent: 39, dependent conditional: 18, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 83, independent: 44, independent conditional: 24, independent unconditional: 20, dependent: 39, dependent conditional: 18, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, 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: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, independent: 44, independent conditional: 24, independent unconditional: 20, dependent: 36, dependent conditional: 16, dependent unconditional: 20, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1446, Positive cache size: 1174, Positive conditional cache size: 19, Positive unconditional cache size: 1155, Negative cache size: 272, Negative conditional cache size: 49, Negative unconditional cache size: 223, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 98 PlacesBefore, 95 PlacesAfterwards, 101 TransitionsBefore, 98 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 97, independent conditional: 97, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 171, independent: 97, independent conditional: 61, independent unconditional: 36, dependent: 74, dependent conditional: 56, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 203, independent: 97, independent conditional: 61, independent unconditional: 36, dependent: 106, dependent conditional: 84, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203, independent: 97, independent conditional: 61, independent unconditional: 36, dependent: 106, dependent conditional: 84, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 13, dependent conditional: 12, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 12, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 18, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 203, independent: 82, independent conditional: 46, independent unconditional: 36, dependent: 93, dependent conditional: 72, dependent unconditional: 21, unknown: 28, unknown conditional: 27, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1491, Positive cache size: 1206, Positive conditional cache size: 35, Positive unconditional cache size: 1171, Negative cache size: 285, Negative conditional cache size: 61, Negative unconditional cache size: 224, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 113 PlacesBefore, 111 PlacesAfterwards, 117 TransitionsBefore, 115 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 138, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 74, dependent conditional: 56, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 118, dependent conditional: 98, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 118, dependent conditional: 98, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 112, dependent conditional: 92, dependent unconditional: 20, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1508, Positive cache size: 1217, Positive conditional cache size: 43, Positive unconditional cache size: 1174, Negative cache size: 291, Negative conditional cache size: 67, Negative unconditional cache size: 224, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 136 PlacesBefore, 134 PlacesAfterwards, 156 TransitionsBefore, 154 TransitionsAfterwards, 614 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 262, independent: 177, independent conditional: 177, independent unconditional: 0, dependent: 85, dependent conditional: 85, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 262, independent: 177, independent conditional: 19, independent unconditional: 158, dependent: 85, dependent conditional: 63, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 321, independent: 177, independent conditional: 19, independent unconditional: 158, dependent: 144, dependent conditional: 120, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 321, independent: 177, independent conditional: 19, independent unconditional: 158, dependent: 144, dependent conditional: 120, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 106, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 106, dependent conditional: 106, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 321, independent: 170, independent conditional: 16, independent unconditional: 154, dependent: 135, dependent conditional: 111, dependent unconditional: 24, unknown: 16, unknown conditional: 12, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1550, Positive cache size: 1250, Positive conditional cache size: 46, Positive unconditional cache size: 1204, Negative cache size: 300, Negative conditional cache size: 76, Negative unconditional cache size: 224, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 136 PlacesBefore, 136 PlacesAfterwards, 157 TransitionsBefore, 157 TransitionsAfterwards, 634 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 107, independent: 64, independent conditional: 30, independent unconditional: 34, dependent: 43, dependent conditional: 41, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 139, independent: 64, independent conditional: 30, independent unconditional: 34, dependent: 75, dependent conditional: 72, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 139, independent: 64, independent conditional: 30, independent unconditional: 34, dependent: 75, dependent conditional: 72, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 139, independent: 63, independent conditional: 29, independent unconditional: 34, dependent: 72, dependent conditional: 69, dependent unconditional: 3, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1554, Positive cache size: 1251, Positive conditional cache size: 47, Positive unconditional cache size: 1204, Negative cache size: 303, Negative conditional cache size: 79, Negative unconditional cache size: 224, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 156 PlacesBefore, 154 PlacesAfterwards, 185 TransitionsBefore, 183 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 305, independent: 195, independent conditional: 195, independent unconditional: 0, dependent: 110, dependent conditional: 110, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 305, independent: 195, independent conditional: 107, independent unconditional: 88, dependent: 110, dependent conditional: 106, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 413, independent: 195, independent conditional: 103, independent unconditional: 92, dependent: 218, dependent conditional: 208, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 413, independent: 195, independent conditional: 103, independent unconditional: 92, dependent: 218, dependent conditional: 208, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, independent: 21, independent conditional: 19, independent unconditional: 2, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 413, independent: 174, independent conditional: 84, independent unconditional: 90, dependent: 203, dependent conditional: 193, dependent unconditional: 10, unknown: 36, unknown conditional: 34, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1592, Positive cache size: 1274, Positive conditional cache size: 66, Positive unconditional cache size: 1208, Negative cache size: 318, Negative conditional cache size: 94, Negative unconditional cache size: 224, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 4 - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown