/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_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:03:25,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:03:25,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:03:25,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:03:25,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:03:25,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:03:25,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:03:25,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:03:25,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:03:25,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:03:25,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:03:25,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:03:25,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:03:25,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:03:25,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:03:25,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:03:25,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:03:25,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:03:25,728 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:03:25,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:03:25,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:03:25,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:03:25,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:03:25,735 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:03:25,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:03:25,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:03:25,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:03:25,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:03:25,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:03:25,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:03:25,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:03:25,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:03:25,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:03:25,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:03:25,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:03:25,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:03:25,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:03:25,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:03:25,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:03:25,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:03:25,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:03:25,748 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 04:03:25,772 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:03:25,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:03:25,774 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:03:25,774 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:03:25,774 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:03:25,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:03:25,775 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:03:25,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:03:25,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:03:25,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:03:25,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:03:25,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:03:25,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:03:25,776 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:03:25,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:03:25,776 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:03:25,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:03:25,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:03:25,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:03:25,776 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:03:25,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:03:25,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:03:25,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:03:25,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:03:25,777 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:03:25,777 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:03:25,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:03:25,777 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:03:25,778 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 04:03:26,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:03:26,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:03:26,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:03:26,087 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:03:26,088 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:03:26,089 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2022-12-06 04:03:26,978 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:03:27,207 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:03:27,207 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2022-12-06 04:03:27,226 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407f7510b/cd36eee4be0b4b169ef58db04fc670e0/FLAG62b133f59 [2022-12-06 04:03:27,236 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407f7510b/cd36eee4be0b4b169ef58db04fc670e0 [2022-12-06 04:03:27,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:03:27,241 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:03:27,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:03:27,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:03:27,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:03:27,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:03:27" (1/1) ... [2022-12-06 04:03:27,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63403393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:03:27, skipping insertion in model container [2022-12-06 04:03:27,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:03:27" (1/1) ... [2022-12-06 04:03:27,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:03:27,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:03:27,578 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_longest.i[43296,43309] [2022-12-06 04:03:27,584 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_longest.i[43503,43516] [2022-12-06 04:03:27,588 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_longest.i[43783,43796] [2022-12-06 04:03:27,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:03:27,600 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:03:27,634 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_longest.i[43296,43309] [2022-12-06 04:03:27,638 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_longest.i[43503,43516] [2022-12-06 04:03:27,646 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_longest.i[43783,43796] [2022-12-06 04:03:27,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:03:27,702 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:03:27,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:03:27 WrapperNode [2022-12-06 04:03:27,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:03:27,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:03:27,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:03:27,704 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:03:27,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:03:27" (1/1) ... [2022-12-06 04:03:27,733 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:03:27" (1/1) ... [2022-12-06 04:03:27,761 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2022-12-06 04:03:27,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:03:27,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:03:27,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:03:27,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:03:27,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:03:27" (1/1) ... [2022-12-06 04:03:27,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:03:27" (1/1) ... [2022-12-06 04:03:27,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:03:27" (1/1) ... [2022-12-06 04:03:27,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:03:27" (1/1) ... [2022-12-06 04:03:27,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:03:27" (1/1) ... [2022-12-06 04:03:27,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:03:27" (1/1) ... [2022-12-06 04:03:27,794 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:03:27" (1/1) ... [2022-12-06 04:03:27,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:03:27" (1/1) ... [2022-12-06 04:03:27,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:03:27,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:03:27,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:03:27,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:03:27,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:03:27" (1/1) ... [2022-12-06 04:03:27,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:03:27,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:03:27,877 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 04:03:27,909 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 04:03:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 04:03:27,926 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 04:03:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 04:03:27,926 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 04:03:27,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:03:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:03:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:03:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:03:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 04:03:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:03:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:03:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:03:27,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:03:27,930 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 04:03:28,055 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:03:28,056 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:03:28,375 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:03:28,390 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:03:28,391 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 04:03:28,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:03:28 BoogieIcfgContainer [2022-12-06 04:03:28,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:03:28,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:03:28,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:03:28,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:03:28,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:03:27" (1/3) ... [2022-12-06 04:03:28,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b07298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:03:28, skipping insertion in model container [2022-12-06 04:03:28,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:03:27" (2/3) ... [2022-12-06 04:03:28,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b07298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:03:28, skipping insertion in model container [2022-12-06 04:03:28,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:03:28" (3/3) ... [2022-12-06 04:03:28,397 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2022-12-06 04:03:28,409 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:03:28,409 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-06 04:03:28,409 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:03:28,502 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 04:03:28,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 256 transitions, 528 flow [2022-12-06 04:03:28,629 INFO L130 PetriNetUnfolder]: 15/254 cut-off events. [2022-12-06 04:03:28,629 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:03:28,636 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 04:03:28,637 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 256 transitions, 528 flow [2022-12-06 04:03:28,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 237 places, 245 transitions, 499 flow [2022-12-06 04:03:28,646 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:03:28,668 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 245 transitions, 499 flow [2022-12-06 04:03:28,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 245 transitions, 499 flow [2022-12-06 04:03:28,751 INFO L130 PetriNetUnfolder]: 15/245 cut-off events. [2022-12-06 04:03:28,752 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:03:28,755 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 04:03:28,762 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 245 transitions, 499 flow [2022-12-06 04:03:28,762 INFO L188 LiptonReduction]: Number of co-enabled transitions 15600 [2022-12-06 04:03:36,258 INFO L203 LiptonReduction]: Total number of compositions: 192 [2022-12-06 04:03:36,274 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:03:36,278 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;@2bece1da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:03:36,278 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:03:36,279 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-06 04:03:36,279 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:03:36,279 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:03:36,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1] [2022-12-06 04:03:36,281 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 04:03:36,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:03:36,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1001, now seen corresponding path program 1 times [2022-12-06 04:03:36,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:03:36,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867796521] [2022-12-06 04:03:36,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:03:36,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:03:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:03:36,367 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 04:03:36,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:03:36,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867796521] [2022-12-06 04:03:36,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867796521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:03:36,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:03:36,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-06 04:03:36,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288267666] [2022-12-06 04:03:36,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:03:36,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:03:36,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:03:36,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:03:36,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:03:36,391 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 72 [2022-12-06 04:03:36,392 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 04:03:36,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:03:36,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 72 [2022-12-06 04:03:36,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:03:36,636 INFO L130 PetriNetUnfolder]: 1465/2555 cut-off events. [2022-12-06 04:03:36,636 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-06 04:03:36,638 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 04:03:36,647 INFO L137 encePairwiseOnDemand]: 66/72 looper letters, 54 selfloop transitions, 0 changer transitions 0/66 dead transitions. [2022-12-06 04:03:36,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 249 flow [2022-12-06 04:03:36,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:03:36,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:03:36,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2022-12-06 04:03:36,655 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 04:03:36,656 INFO L175 Difference]: Start difference. First operand has 68 places, 72 transitions, 153 flow. Second operand 2 states and 84 transitions. [2022-12-06 04:03:36,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 249 flow [2022-12-06 04:03:36,660 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 04:03:36,661 INFO L231 Difference]: Finished difference. Result has 63 places, 66 transitions, 136 flow [2022-12-06 04:03:36,663 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 04:03:36,665 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2022-12-06 04:03:36,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:03:36,666 INFO L89 Accepts]: Start accepts. Operand has 63 places, 66 transitions, 136 flow [2022-12-06 04:03:36,667 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:03:36,667 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:03:36,668 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 66 transitions, 136 flow [2022-12-06 04:03:36,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 66 transitions, 136 flow [2022-12-06 04:03:36,682 INFO L130 PetriNetUnfolder]: 8/66 cut-off events. [2022-12-06 04:03:36,682 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:03:36,683 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 04:03:36,684 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 66 transitions, 136 flow [2022-12-06 04:03:36,684 INFO L188 LiptonReduction]: Number of co-enabled transitions 1874 [2022-12-06 04:03:36,815 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:03:36,820 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-06 04:03:36,820 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 65 transitions, 134 flow [2022-12-06 04:03:36,821 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 04:03:36,821 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:03:36,821 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:03:36,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:03:36,821 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 04:03:36,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:03:36,822 INFO L85 PathProgramCache]: Analyzing trace with hash 21675408, now seen corresponding path program 1 times [2022-12-06 04:03:36,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:03:36,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713986195] [2022-12-06 04:03:36,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:03:36,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:03:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:03:37,004 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 04:03:37,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:03:37,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713986195] [2022-12-06 04:03:37,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713986195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:03:37,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:03:37,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:03:37,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020877492] [2022-12-06 04:03:37,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:03:37,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:03:37,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:03:37,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:03:37,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:03:37,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 65 [2022-12-06 04:03:37,007 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 04:03:37,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:03:37,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 65 [2022-12-06 04:03:37,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:03:37,269 INFO L130 PetriNetUnfolder]: 1308/2296 cut-off events. [2022-12-06 04:03:37,269 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 04:03:37,272 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 04:03:37,280 INFO L137 encePairwiseOnDemand]: 61/65 looper letters, 74 selfloop transitions, 3 changer transitions 5/91 dead transitions. [2022-12-06 04:03:37,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 91 transitions, 353 flow [2022-12-06 04:03:37,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:03:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:03:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-12-06 04:03:37,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-06 04:03:37,283 INFO L175 Difference]: Start difference. First operand has 61 places, 65 transitions, 134 flow. Second operand 3 states and 110 transitions. [2022-12-06 04:03:37,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 91 transitions, 353 flow [2022-12-06 04:03:37,284 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 04:03:37,287 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 141 flow [2022-12-06 04:03:37,287 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 04:03:37,288 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2022-12-06 04:03:37,289 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:03:37,289 INFO L89 Accepts]: Start accepts. Operand has 64 places, 62 transitions, 141 flow [2022-12-06 04:03:37,289 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:03:37,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:03:37,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 62 transitions, 141 flow [2022-12-06 04:03:37,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 62 transitions, 141 flow [2022-12-06 04:03:37,300 INFO L130 PetriNetUnfolder]: 17/113 cut-off events. [2022-12-06 04:03:37,301 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:03:37,301 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 04:03:37,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 62 transitions, 141 flow [2022-12-06 04:03:37,302 INFO L188 LiptonReduction]: Number of co-enabled transitions 1280 [2022-12-06 04:03:37,420 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:03:37,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-06 04:03:37,422 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 141 flow [2022-12-06 04:03:37,423 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 04:03:37,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:03:37,423 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:03:37,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:03:37,425 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 04:03:37,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:03:37,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1954713350, now seen corresponding path program 1 times [2022-12-06 04:03:37,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:03:37,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595232401] [2022-12-06 04:03:37,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:03:37,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:03:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:03:38,093 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 04:03:38,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:03:38,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595232401] [2022-12-06 04:03:38,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595232401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:03:38,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:03:38,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:03:38,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991336319] [2022-12-06 04:03:38,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:03:38,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:03:38,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:03:38,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:03:38,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:03:38,094 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2022-12-06 04:03:38,095 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 04:03:38,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:03:38,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2022-12-06 04:03:38,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:03:39,075 INFO L130 PetriNetUnfolder]: 1321/2298 cut-off events. [2022-12-06 04:03:39,075 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-06 04:03:39,078 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 04:03:39,084 INFO L137 encePairwiseOnDemand]: 53/61 looper letters, 56 selfloop transitions, 9 changer transitions 9/83 dead transitions. [2022-12-06 04:03:39,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 333 flow [2022-12-06 04:03:39,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:03:39,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:03:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2022-12-06 04:03:39,086 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28688524590163933 [2022-12-06 04:03:39,086 INFO L175 Difference]: Start difference. First operand has 60 places, 62 transitions, 141 flow. Second operand 8 states and 140 transitions. [2022-12-06 04:03:39,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 333 flow [2022-12-06 04:03:39,088 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 04:03:39,089 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 200 flow [2022-12-06 04:03:39,089 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 04:03:39,090 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 4 predicate places. [2022-12-06 04:03:39,090 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:03:39,090 INFO L89 Accepts]: Start accepts. Operand has 72 places, 70 transitions, 200 flow [2022-12-06 04:03:39,091 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:03:39,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:03:39,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 70 transitions, 200 flow [2022-12-06 04:03:39,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 70 transitions, 200 flow [2022-12-06 04:03:39,101 INFO L130 PetriNetUnfolder]: 30/186 cut-off events. [2022-12-06 04:03:39,101 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:03:39,102 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 04:03:39,103 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 70 transitions, 200 flow [2022-12-06 04:03:39,103 INFO L188 LiptonReduction]: Number of co-enabled transitions 1268 [2022-12-06 04:03:39,105 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|) (= (select (select |v_#memory_int_592| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_205|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_205| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (= |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|)) 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 04:03:39,179 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 04:03:39,567 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|) (= (select (select |v_#memory_int_592| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_205|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_205| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (= |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|)) 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 04:03:39,676 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:03:39,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 587 [2022-12-06 04:03:39,677 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 198 flow [2022-12-06 04:03:39,677 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 04:03:39,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:03:39,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:03:39,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:03:39,678 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 04:03:39,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:03:39,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1589596123, now seen corresponding path program 1 times [2022-12-06 04:03:39,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:03:39,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394242868] [2022-12-06 04:03:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:03:39,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:03:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:03:40,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:03:40,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:03:40,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394242868] [2022-12-06 04:03:40,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394242868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:03:40,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:03:40,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:03:40,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689784280] [2022-12-06 04:03:40,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:03:40,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:03:40,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:03:40,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:03:40,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:03:40,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 62 [2022-12-06 04:03:40,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 04:03:40,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:03:40,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 62 [2022-12-06 04:03:40,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:03:40,468 INFO L130 PetriNetUnfolder]: 1272/2212 cut-off events. [2022-12-06 04:03:40,468 INFO L131 PetriNetUnfolder]: For 158/158 co-relation queries the response was YES. [2022-12-06 04:03:40,471 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 04:03:40,476 INFO L137 encePairwiseOnDemand]: 54/62 looper letters, 68 selfloop transitions, 8 changer transitions 1/86 dead transitions. [2022-12-06 04:03:40,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 86 transitions, 392 flow [2022-12-06 04:03:40,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:03:40,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:03:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2022-12-06 04:03:40,478 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097 [2022-12-06 04:03:40,478 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 198 flow. Second operand 5 states and 117 transitions. [2022-12-06 04:03:40,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 86 transitions, 392 flow [2022-12-06 04:03:40,479 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 04:03:40,480 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 190 flow [2022-12-06 04:03:40,480 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 04:03:40,480 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2022-12-06 04:03:40,480 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:03:40,480 INFO L89 Accepts]: Start accepts. Operand has 68 places, 64 transitions, 190 flow [2022-12-06 04:03:40,481 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:03:40,481 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:03:40,481 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 64 transitions, 190 flow [2022-12-06 04:03:40,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 64 transitions, 190 flow [2022-12-06 04:03:40,489 INFO L130 PetriNetUnfolder]: 28/171 cut-off events. [2022-12-06 04:03:40,490 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 04:03:40,490 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 04:03:40,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 64 transitions, 190 flow [2022-12-06 04:03:40,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 1202 [2022-12-06 04:03:40,513 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:03:40,514 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 04:03:40,514 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 190 flow [2022-12-06 04:03:40,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 04:03:40,514 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:03:40,514 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:03:40,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:03:40,514 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 04:03:40,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:03:40,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1534661016, now seen corresponding path program 1 times [2022-12-06 04:03:40,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:03:40,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665699287] [2022-12-06 04:03:40,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:03:40,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:03:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:03:40,981 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 04:03:40,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:03:40,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665699287] [2022-12-06 04:03:40,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665699287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:03:40,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:03:40,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:03:40,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056179110] [2022-12-06 04:03:40,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:03:40,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:03:40,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:03:40,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:03:40,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:03:40,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2022-12-06 04:03:40,985 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 04:03:40,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:03:40,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2022-12-06 04:03:40,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:03:41,294 INFO L130 PetriNetUnfolder]: 1254/2182 cut-off events. [2022-12-06 04:03:41,294 INFO L131 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2022-12-06 04:03:41,297 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 04:03:41,303 INFO L137 encePairwiseOnDemand]: 48/60 looper letters, 55 selfloop transitions, 16 changer transitions 1/81 dead transitions. [2022-12-06 04:03:41,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 81 transitions, 377 flow [2022-12-06 04:03:41,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:03:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:03:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2022-12-06 04:03:41,305 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28541666666666665 [2022-12-06 04:03:41,305 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 190 flow. Second operand 8 states and 137 transitions. [2022-12-06 04:03:41,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 81 transitions, 377 flow [2022-12-06 04:03:41,306 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 04:03:41,307 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 261 flow [2022-12-06 04:03:41,307 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 04:03:41,307 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 4 predicate places. [2022-12-06 04:03:41,307 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:03:41,308 INFO L89 Accepts]: Start accepts. Operand has 72 places, 73 transitions, 261 flow [2022-12-06 04:03:41,308 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:03:41,308 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:03:41,308 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 73 transitions, 261 flow [2022-12-06 04:03:41,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 73 transitions, 261 flow [2022-12-06 04:03:41,317 INFO L130 PetriNetUnfolder]: 33/175 cut-off events. [2022-12-06 04:03:41,317 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 04:03:41,318 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 04:03:41,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 73 transitions, 261 flow [2022-12-06 04:03:41,319 INFO L188 LiptonReduction]: Number of co-enabled transitions 1206 [2022-12-06 04:03:41,324 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| 3204) (+ |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 04:03:41,405 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|) (+ 3204 |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 04:03:41,517 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|) (+ 3200 |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 04:03:41,563 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:03:41,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 257 [2022-12-06 04:03:41,564 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 261 flow [2022-12-06 04:03:41,564 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 04:03:41,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:03:41,565 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:03:41,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:03:41,565 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 04:03:41,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:03:41,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1689845943, now seen corresponding path program 1 times [2022-12-06 04:03:41,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:03:41,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330696470] [2022-12-06 04:03:41,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:03:41,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:03:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:03:46,846 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 04:03:46,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:03:46,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330696470] [2022-12-06 04:03:46,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330696470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:03:46,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:03:46,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 04:03:46,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598882093] [2022-12-06 04:03:46,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:03:46,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 04:03:46,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:03:46,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 04:03:46,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 04:03:46,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 65 [2022-12-06 04:03:46,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 261 flow. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 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 04:03:46,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:03:46,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 65 [2022-12-06 04:03:46,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:04,682 INFO L130 PetriNetUnfolder]: 1467/2546 cut-off events. [2022-12-06 04:04:04,682 INFO L131 PetriNetUnfolder]: For 270/270 co-relation queries the response was YES. [2022-12-06 04:04:04,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5397 conditions, 2546 events. 1467/2546 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 11121 event pairs, 799 based on Foata normal form. 0/2020 useless extension candidates. Maximal degree in co-relation 4409. Up to 1920 conditions per place. [2022-12-06 04:04:04,696 INFO L137 encePairwiseOnDemand]: 47/65 looper letters, 96 selfloop transitions, 20 changer transitions 10/135 dead transitions. [2022-12-06 04:04:04,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 135 transitions, 676 flow [2022-12-06 04:04:04,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 04:04:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 04:04:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2022-12-06 04:04:04,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3384615384615385 [2022-12-06 04:04:04,703 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 261 flow. Second operand 9 states and 198 transitions. [2022-12-06 04:04:04,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 135 transitions, 676 flow [2022-12-06 04:04:04,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 135 transitions, 620 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-12-06 04:04:04,710 INFO L231 Difference]: Finished difference. Result has 76 places, 77 transitions, 313 flow [2022-12-06 04:04:04,710 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=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=313, PETRI_PLACES=76, PETRI_TRANSITIONS=77} [2022-12-06 04:04:04,711 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 8 predicate places. [2022-12-06 04:04:04,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:04,712 INFO L89 Accepts]: Start accepts. Operand has 76 places, 77 transitions, 313 flow [2022-12-06 04:04:04,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:04,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:04,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 77 transitions, 313 flow [2022-12-06 04:04:04,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 77 transitions, 313 flow [2022-12-06 04:04:04,726 INFO L130 PetriNetUnfolder]: 40/229 cut-off events. [2022-12-06 04:04:04,726 INFO L131 PetriNetUnfolder]: For 25/26 co-relation queries the response was YES. [2022-12-06 04:04:04,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 229 events. 40/229 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 812 event pairs, 0 based on Foata normal form. 1/161 useless extension candidates. Maximal degree in co-relation 324. Up to 17 conditions per place. [2022-12-06 04:04:04,728 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 77 transitions, 313 flow [2022-12-06 04:04:04,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 1300 [2022-12-06 04:04:04,838 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:04:04,839 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-06 04:04:04,839 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 307 flow [2022-12-06 04:04:04,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 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 04:04:04,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:04,839 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:04:04,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:04:04,839 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 04:04:04,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:04,839 INFO L85 PathProgramCache]: Analyzing trace with hash -923352422, now seen corresponding path program 1 times [2022-12-06 04:04:04,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:04,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521560937] [2022-12-06 04:04:04,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:04,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:05,271 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 04:04:05,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:05,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521560937] [2022-12-06 04:04:05,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521560937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:04:05,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:04:05,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:04:05,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760747659] [2022-12-06 04:04:05,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:04:05,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:04:05,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:05,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:04:05,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:04:05,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 66 [2022-12-06 04:04:05,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 307 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 04:04:05,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:05,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 66 [2022-12-06 04:04:05,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:05,596 INFO L130 PetriNetUnfolder]: 1600/2790 cut-off events. [2022-12-06 04:04:05,597 INFO L131 PetriNetUnfolder]: For 384/384 co-relation queries the response was YES. [2022-12-06 04:04:05,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6070 conditions, 2790 events. 1600/2790 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 12543 event pairs, 975 based on Foata normal form. 0/2209 useless extension candidates. Maximal degree in co-relation 5038. Up to 2161 conditions per place. [2022-12-06 04:04:05,609 INFO L137 encePairwiseOnDemand]: 51/66 looper letters, 87 selfloop transitions, 15 changer transitions 6/117 dead transitions. [2022-12-06 04:04:05,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 117 transitions, 628 flow [2022-12-06 04:04:05,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:04:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:04:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2022-12-06 04:04:05,613 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2022-12-06 04:04:05,613 INFO L175 Difference]: Start difference. First operand has 75 places, 76 transitions, 307 flow. Second operand 6 states and 152 transitions. [2022-12-06 04:04:05,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 117 transitions, 628 flow [2022-12-06 04:04:05,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 117 transitions, 594 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 04:04:05,617 INFO L231 Difference]: Finished difference. Result has 78 places, 79 transitions, 336 flow [2022-12-06 04:04:05,617 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=336, PETRI_PLACES=78, PETRI_TRANSITIONS=79} [2022-12-06 04:04:05,618 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2022-12-06 04:04:05,618 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:05,618 INFO L89 Accepts]: Start accepts. Operand has 78 places, 79 transitions, 336 flow [2022-12-06 04:04:05,619 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:05,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:05,619 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 79 transitions, 336 flow [2022-12-06 04:04:05,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 79 transitions, 336 flow [2022-12-06 04:04:05,632 INFO L130 PetriNetUnfolder]: 41/241 cut-off events. [2022-12-06 04:04:05,632 INFO L131 PetriNetUnfolder]: For 44/45 co-relation queries the response was YES. [2022-12-06 04:04:05,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 241 events. 41/241 cut-off events. For 44/45 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 904 event pairs, 0 based on Foata normal form. 1/170 useless extension candidates. Maximal degree in co-relation 326. Up to 17 conditions per place. [2022-12-06 04:04:05,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 79 transitions, 336 flow [2022-12-06 04:04:05,634 INFO L188 LiptonReduction]: Number of co-enabled transitions 1332 [2022-12-06 04:04:05,729 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|) (= |v_t1Thread1of1ForFork0_empty_#t~mem31#1_169| (select (select |v_#memory_int_1834| |v_t1Thread1of1ForFork0_empty_~q#1.base_107|) (+ 3200 |v_t1Thread1of1ForFork0_empty_~q#1.offset_107|))) (= (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|)) 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|) (+ 3204 |v_t1Thread1of1ForFork0_empty_~q#1.offset_In_2|))))) (or (and (= (+ |v_t1Thread1of1ForFork0_empty_#res#1_Out_16| 1) 0) .cse0) (and (not .cse0) (= |v_t1Thread1of1ForFork0_empty_#res#1_Out_16| 0) (= |v_t1Thread1of1ForFork0_empty_#t~nondet33#1_In_1| |v_t1Thread1of1ForFork0_empty_#t~nondet33#1_Out_8|)))) 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 04:04:05,937 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:04:05,937 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 319 [2022-12-06 04:04:05,937 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 77 transitions, 332 flow [2022-12-06 04:04:05,937 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 04:04:05,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:05,938 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:04:05,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:04:05,938 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 04:04:05,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:05,938 INFO L85 PathProgramCache]: Analyzing trace with hash -923355252, now seen corresponding path program 1 times [2022-12-06 04:04:05,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:05,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724146315] [2022-12-06 04:04:05,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:05,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:06,320 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 04:04:06,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:06,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724146315] [2022-12-06 04:04:06,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724146315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:04:06,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:04:06,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:04:06,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299606815] [2022-12-06 04:04:06,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:04:06,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:04:06,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:06,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:04:06,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:04:06,323 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 66 [2022-12-06 04:04:06,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 77 transitions, 332 flow. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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 04:04:06,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:06,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 66 [2022-12-06 04:04:06,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:06,787 INFO L130 PetriNetUnfolder]: 1717/3013 cut-off events. [2022-12-06 04:04:06,787 INFO L131 PetriNetUnfolder]: For 492/492 co-relation queries the response was YES. [2022-12-06 04:04:06,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6602 conditions, 3013 events. 1717/3013 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 14269 event pairs, 832 based on Foata normal form. 0/2383 useless extension candidates. Maximal degree in co-relation 5579. Up to 2133 conditions per place. [2022-12-06 04:04:06,811 INFO L137 encePairwiseOnDemand]: 51/66 looper letters, 92 selfloop transitions, 16 changer transitions 9/126 dead transitions. [2022-12-06 04:04:06,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 126 transitions, 690 flow [2022-12-06 04:04:06,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:04:06,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:04:06,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2022-12-06 04:04:06,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4065656565656566 [2022-12-06 04:04:06,812 INFO L175 Difference]: Start difference. First operand has 76 places, 77 transitions, 332 flow. Second operand 6 states and 161 transitions. [2022-12-06 04:04:06,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 126 transitions, 690 flow [2022-12-06 04:04:06,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 126 transitions, 666 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 04:04:06,818 INFO L231 Difference]: Finished difference. Result has 80 places, 79 transitions, 370 flow [2022-12-06 04:04:06,818 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=370, PETRI_PLACES=80, PETRI_TRANSITIONS=79} [2022-12-06 04:04:06,820 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2022-12-06 04:04:06,820 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:06,820 INFO L89 Accepts]: Start accepts. Operand has 80 places, 79 transitions, 370 flow [2022-12-06 04:04:06,821 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:06,821 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:06,821 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 79 transitions, 370 flow [2022-12-06 04:04:06,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 79 transitions, 370 flow [2022-12-06 04:04:06,834 INFO L130 PetriNetUnfolder]: 42/252 cut-off events. [2022-12-06 04:04:06,834 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-12-06 04:04:06,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 252 events. 42/252 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1023 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 330. Up to 16 conditions per place. [2022-12-06 04:04:06,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 79 transitions, 370 flow [2022-12-06 04:04:06,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 1332 [2022-12-06 04:04:06,843 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:04:06,845 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 04:04:06,845 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 370 flow [2022-12-06 04:04:06,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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 04:04:06,845 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:06,845 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:04:06,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:04:06,845 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:04:06,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:06,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1440758138, now seen corresponding path program 1 times [2022-12-06 04:04:06,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:06,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057508534] [2022-12-06 04:04:06,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:06,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:07,211 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 04:04:07,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:07,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057508534] [2022-12-06 04:04:07,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057508534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:04:07,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:04:07,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:04:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033162864] [2022-12-06 04:04:07,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:04:07,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:04:07,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:07,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:04:07,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:04:07,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 66 [2022-12-06 04:04:07,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 370 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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 04:04:07,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:07,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 66 [2022-12-06 04:04:07,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:07,653 INFO L130 PetriNetUnfolder]: 1758/3111 cut-off events. [2022-12-06 04:04:07,653 INFO L131 PetriNetUnfolder]: For 939/939 co-relation queries the response was YES. [2022-12-06 04:04:07,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6868 conditions, 3111 events. 1758/3111 cut-off events. For 939/939 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 15226 event pairs, 891 based on Foata normal form. 11/2471 useless extension candidates. Maximal degree in co-relation 5830. Up to 2181 conditions per place. [2022-12-06 04:04:07,664 INFO L137 encePairwiseOnDemand]: 50/66 looper letters, 89 selfloop transitions, 18 changer transitions 8/124 dead transitions. [2022-12-06 04:04:07,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 124 transitions, 705 flow [2022-12-06 04:04:07,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:04:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:04:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2022-12-06 04:04:07,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-06 04:04:07,665 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 370 flow. Second operand 7 states and 165 transitions. [2022-12-06 04:04:07,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 124 transitions, 705 flow [2022-12-06 04:04:07,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 124 transitions, 683 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 04:04:07,672 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 394 flow [2022-12-06 04:04:07,672 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=394, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2022-12-06 04:04:07,672 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 15 predicate places. [2022-12-06 04:04:07,672 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:07,672 INFO L89 Accepts]: Start accepts. Operand has 83 places, 79 transitions, 394 flow [2022-12-06 04:04:07,674 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:07,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:07,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 79 transitions, 394 flow [2022-12-06 04:04:07,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 79 transitions, 394 flow [2022-12-06 04:04:07,689 INFO L130 PetriNetUnfolder]: 42/251 cut-off events. [2022-12-06 04:04:07,689 INFO L131 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-12-06 04:04:07,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 251 events. 42/251 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1040 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 366. Up to 15 conditions per place. [2022-12-06 04:04:07,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 79 transitions, 394 flow [2022-12-06 04:04:07,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 1332 [2022-12-06 04:04:07,703 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:04:07,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 04:04:07,703 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 394 flow [2022-12-06 04:04:07,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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 04:04:07,703 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:07,704 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 04:04:07,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:04:07,704 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 04:04:07,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:07,704 INFO L85 PathProgramCache]: Analyzing trace with hash 324076734, now seen corresponding path program 1 times [2022-12-06 04:04:07,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:07,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570575538] [2022-12-06 04:04:07,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:07,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:07,784 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 04:04:07,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:07,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570575538] [2022-12-06 04:04:07,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570575538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:04:07,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:04:07,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:04:07,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759830282] [2022-12-06 04:04:07,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:04:07,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:04:07,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:07,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:04:07,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:04:07,786 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2022-12-06 04:04:07,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 394 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 04:04:07,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:07,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2022-12-06 04:04:07,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:07,941 INFO L130 PetriNetUnfolder]: 782/1528 cut-off events. [2022-12-06 04:04:07,941 INFO L131 PetriNetUnfolder]: For 729/731 co-relation queries the response was YES. [2022-12-06 04:04:07,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3556 conditions, 1528 events. 782/1528 cut-off events. For 729/731 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7393 event pairs, 190 based on Foata normal form. 4/1313 useless extension candidates. Maximal degree in co-relation 2893. Up to 1050 conditions per place. [2022-12-06 04:04:07,946 INFO L137 encePairwiseOnDemand]: 54/65 looper letters, 57 selfloop transitions, 11 changer transitions 3/88 dead transitions. [2022-12-06 04:04:07,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 88 transitions, 571 flow [2022-12-06 04:04:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:04:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:04:07,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2022-12-06 04:04:07,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-12-06 04:04:07,948 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 394 flow. Second operand 3 states and 100 transitions. [2022-12-06 04:04:07,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 88 transitions, 571 flow [2022-12-06 04:04:07,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 88 transitions, 534 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-06 04:04:07,950 INFO L231 Difference]: Finished difference. Result has 79 places, 77 transitions, 376 flow [2022-12-06 04:04:07,951 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=79, PETRI_TRANSITIONS=77} [2022-12-06 04:04:07,952 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 11 predicate places. [2022-12-06 04:04:07,952 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:07,952 INFO L89 Accepts]: Start accepts. Operand has 79 places, 77 transitions, 376 flow [2022-12-06 04:04:07,955 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:07,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:07,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 77 transitions, 376 flow [2022-12-06 04:04:07,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 376 flow [2022-12-06 04:04:07,972 INFO L130 PetriNetUnfolder]: 50/293 cut-off events. [2022-12-06 04:04:07,972 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-12-06 04:04:07,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 293 events. 50/293 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1406 event pairs, 1 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 421. Up to 54 conditions per place. [2022-12-06 04:04:07,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 77 transitions, 376 flow [2022-12-06 04:04:07,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 614 [2022-12-06 04:04:09,064 INFO L203 LiptonReduction]: Total number of compositions: 15 [2022-12-06 04:04:09,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1113 [2022-12-06 04:04:09,065 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 379 flow [2022-12-06 04:04:09,065 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 04:04:09,065 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:09,066 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 04:04:09,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:04:09,066 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 04:04:09,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:09,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1013860708, now seen corresponding path program 1 times [2022-12-06 04:04:09,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:09,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33716317] [2022-12-06 04:04:09,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:09,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:09,686 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 04:04:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:09,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33716317] [2022-12-06 04:04:09,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33716317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:04:09,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:04:09,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 04:04:09,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646411808] [2022-12-06 04:04:09,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:04:09,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:04:09,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:09,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:04:09,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:04:09,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 55 [2022-12-06 04:04:09,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 379 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 04:04:09,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:09,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 55 [2022-12-06 04:04:09,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:10,072 INFO L130 PetriNetUnfolder]: 750/1397 cut-off events. [2022-12-06 04:04:10,072 INFO L131 PetriNetUnfolder]: For 683/683 co-relation queries the response was YES. [2022-12-06 04:04:10,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3654 conditions, 1397 events. 750/1397 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6776 event pairs, 290 based on Foata normal form. 0/1252 useless extension candidates. Maximal degree in co-relation 2992. Up to 944 conditions per place. [2022-12-06 04:04:10,076 INFO L137 encePairwiseOnDemand]: 40/55 looper letters, 78 selfloop transitions, 16 changer transitions 14/111 dead transitions. [2022-12-06 04:04:10,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 111 transitions, 725 flow [2022-12-06 04:04:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:04:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:04:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2022-12-06 04:04:10,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27954545454545454 [2022-12-06 04:04:10,078 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 379 flow. Second operand 8 states and 123 transitions. [2022-12-06 04:04:10,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 111 transitions, 725 flow [2022-12-06 04:04:10,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 111 transitions, 699 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:04:10,081 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 405 flow [2022-12-06 04:04:10,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=405, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2022-12-06 04:04:10,081 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 9 predicate places. [2022-12-06 04:04:10,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:10,082 INFO L89 Accepts]: Start accepts. Operand has 77 places, 68 transitions, 405 flow [2022-12-06 04:04:10,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:10,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:10,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 68 transitions, 405 flow [2022-12-06 04:04:10,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 68 transitions, 405 flow [2022-12-06 04:04:10,097 INFO L130 PetriNetUnfolder]: 46/218 cut-off events. [2022-12-06 04:04:10,098 INFO L131 PetriNetUnfolder]: For 162/163 co-relation queries the response was YES. [2022-12-06 04:04:10,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 218 events. 46/218 cut-off events. For 162/163 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 959 event pairs, 0 based on Foata normal form. 1/208 useless extension candidates. Maximal degree in co-relation 371. Up to 33 conditions per place. [2022-12-06 04:04:10,099 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 68 transitions, 405 flow [2022-12-06 04:04:10,099 INFO L188 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-06 04:04:10,235 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:04:10,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-06 04:04:10,236 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 399 flow [2022-12-06 04:04:10,236 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 04:04:10,236 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:10,236 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 04:04:10,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:04:10,236 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 04:04:10,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:10,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1080951563, now seen corresponding path program 1 times [2022-12-06 04:04:10,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:10,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551368770] [2022-12-06 04:04:10,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:10,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:11,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 04:04:11,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:11,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551368770] [2022-12-06 04:04:11,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551368770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:04:11,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:04:11,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 04:04:11,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302164303] [2022-12-06 04:04:11,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:04:11,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 04:04:11,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:11,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 04:04:11,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-06 04:04:11,189 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 49 [2022-12-06 04:04:11,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 399 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 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 04:04:11,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:11,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 49 [2022-12-06 04:04:11,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:11,675 INFO L130 PetriNetUnfolder]: 671/1279 cut-off events. [2022-12-06 04:04:11,676 INFO L131 PetriNetUnfolder]: For 646/646 co-relation queries the response was YES. [2022-12-06 04:04:11,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3521 conditions, 1279 events. 671/1279 cut-off events. For 646/646 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 6090 event pairs, 154 based on Foata normal form. 12/1272 useless extension candidates. Maximal degree in co-relation 2811. Up to 402 conditions per place. [2022-12-06 04:04:11,680 INFO L137 encePairwiseOnDemand]: 31/49 looper letters, 105 selfloop transitions, 28 changer transitions 13/149 dead transitions. [2022-12-06 04:04:11,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 149 transitions, 994 flow [2022-12-06 04:04:11,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 04:04:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 04:04:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2022-12-06 04:04:11,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.271585557299843 [2022-12-06 04:04:11,682 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 399 flow. Second operand 13 states and 173 transitions. [2022-12-06 04:04:11,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 149 transitions, 994 flow [2022-12-06 04:04:11,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 149 transitions, 970 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:04:11,686 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 547 flow [2022-12-06 04:04:11,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=547, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2022-12-06 04:04:11,686 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 17 predicate places. [2022-12-06 04:04:11,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:11,686 INFO L89 Accepts]: Start accepts. Operand has 85 places, 77 transitions, 547 flow [2022-12-06 04:04:11,688 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:11,688 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:11,688 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 77 transitions, 547 flow [2022-12-06 04:04:11,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 77 transitions, 547 flow [2022-12-06 04:04:11,708 INFO L130 PetriNetUnfolder]: 71/307 cut-off events. [2022-12-06 04:04:11,708 INFO L131 PetriNetUnfolder]: For 328/328 co-relation queries the response was YES. [2022-12-06 04:04:11,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 307 events. 71/307 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1572 event pairs, 1 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 744. Up to 60 conditions per place. [2022-12-06 04:04:11,714 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 77 transitions, 547 flow [2022-12-06 04:04:11,714 INFO L188 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-06 04:04:12,115 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:04:12,116 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 430 [2022-12-06 04:04:12,116 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 556 flow [2022-12-06 04:04:12,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 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 04:04:12,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:12,116 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 04:04:12,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:04:12,116 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 04:04:12,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:12,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1597260916, now seen corresponding path program 1 times [2022-12-06 04:04:12,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:12,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785469830] [2022-12-06 04:04:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:12,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:04:12,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:12,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785469830] [2022-12-06 04:04:12,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785469830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:04:12,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:04:12,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 04:04:12,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853960132] [2022-12-06 04:04:12,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:04:12,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:04:12,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:12,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:04:12,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:04:12,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 53 [2022-12-06 04:04:12,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 556 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 04:04:12,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:12,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 53 [2022-12-06 04:04:12,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:12,931 INFO L130 PetriNetUnfolder]: 553/1056 cut-off events. [2022-12-06 04:04:12,931 INFO L131 PetriNetUnfolder]: For 1049/1049 co-relation queries the response was YES. [2022-12-06 04:04:12,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3207 conditions, 1056 events. 553/1056 cut-off events. For 1049/1049 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4919 event pairs, 187 based on Foata normal form. 5/1060 useless extension candidates. Maximal degree in co-relation 3159. Up to 719 conditions per place. [2022-12-06 04:04:12,935 INFO L137 encePairwiseOnDemand]: 35/53 looper letters, 79 selfloop transitions, 21 changer transitions 5/108 dead transitions. [2022-12-06 04:04:12,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 108 transitions, 867 flow [2022-12-06 04:04:12,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:04:12,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:04:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-12-06 04:04:12,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29649595687331537 [2022-12-06 04:04:12,937 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 556 flow. Second operand 7 states and 110 transitions. [2022-12-06 04:04:12,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 108 transitions, 867 flow [2022-12-06 04:04:12,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 108 transitions, 803 flow, removed 18 selfloop flow, removed 7 redundant places. [2022-12-06 04:04:12,942 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 550 flow [2022-12-06 04:04:12,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=550, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2022-12-06 04:04:12,942 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 15 predicate places. [2022-12-06 04:04:12,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:12,942 INFO L89 Accepts]: Start accepts. Operand has 83 places, 76 transitions, 550 flow [2022-12-06 04:04:12,943 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:12,943 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:12,943 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 76 transitions, 550 flow [2022-12-06 04:04:12,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 76 transitions, 550 flow [2022-12-06 04:04:12,960 INFO L130 PetriNetUnfolder]: 58/254 cut-off events. [2022-12-06 04:04:12,960 INFO L131 PetriNetUnfolder]: For 349/349 co-relation queries the response was YES. [2022-12-06 04:04:12,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 254 events. 58/254 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1225 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 484. Up to 49 conditions per place. [2022-12-06 04:04:12,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 76 transitions, 550 flow [2022-12-06 04:04:12,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 478 [2022-12-06 04:04:12,969 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:04:12,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 04:04:12,970 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 550 flow [2022-12-06 04:04:12,970 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 04:04:12,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:12,970 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 04:04:12,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:04:12,970 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 04:04:12,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:12,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1766730357, now seen corresponding path program 1 times [2022-12-06 04:04:12,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:12,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854758104] [2022-12-06 04:04:12,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:12,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:14,563 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 04:04:14,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:14,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854758104] [2022-12-06 04:04:14,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854758104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:04:14,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:04:14,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 04:04:14,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012428135] [2022-12-06 04:04:14,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:04:14,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 04:04:14,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:14,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 04:04:14,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-12-06 04:04:14,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 04:04:14,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 550 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 04:04:14,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:14,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 04:04:14,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:15,822 INFO L130 PetriNetUnfolder]: 1091/1883 cut-off events. [2022-12-06 04:04:15,822 INFO L131 PetriNetUnfolder]: For 2201/2201 co-relation queries the response was YES. [2022-12-06 04:04:15,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5513 conditions, 1883 events. 1091/1883 cut-off events. For 2201/2201 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9095 event pairs, 540 based on Foata normal form. 0/1780 useless extension candidates. Maximal degree in co-relation 4142. Up to 1400 conditions per place. [2022-12-06 04:04:15,827 INFO L137 encePairwiseOnDemand]: 27/53 looper letters, 97 selfloop transitions, 41 changer transitions 38/176 dead transitions. [2022-12-06 04:04:15,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 176 transitions, 1285 flow [2022-12-06 04:04:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 04:04:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 04:04:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 159 transitions. [2022-12-06 04:04:15,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17647058823529413 [2022-12-06 04:04:15,829 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 550 flow. Second operand 17 states and 159 transitions. [2022-12-06 04:04:15,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 176 transitions, 1285 flow [2022-12-06 04:04:15,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 176 transitions, 1244 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-06 04:04:15,835 INFO L231 Difference]: Finished difference. Result has 106 places, 103 transitions, 872 flow [2022-12-06 04:04:15,835 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=872, PETRI_PLACES=106, PETRI_TRANSITIONS=103} [2022-12-06 04:04:15,835 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 38 predicate places. [2022-12-06 04:04:15,835 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:15,835 INFO L89 Accepts]: Start accepts. Operand has 106 places, 103 transitions, 872 flow [2022-12-06 04:04:15,836 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:15,836 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:15,836 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 103 transitions, 872 flow [2022-12-06 04:04:15,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 103 transitions, 872 flow [2022-12-06 04:04:15,860 INFO L130 PetriNetUnfolder]: 102/328 cut-off events. [2022-12-06 04:04:15,860 INFO L131 PetriNetUnfolder]: For 804/806 co-relation queries the response was YES. [2022-12-06 04:04:15,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 328 events. 102/328 cut-off events. For 804/806 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1612 event pairs, 9 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 1083. Up to 79 conditions per place. [2022-12-06 04:04:15,863 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 103 transitions, 872 flow [2022-12-06 04:04:15,863 INFO L188 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-06 04:04:15,876 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 04:04:15,894 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 [1010] $Ultimate##0-->L981: Formula: (let ((.cse0 (select |v_#pthreadsMutex_540| |v_~#m~0.base_240|))) (and (= |v_t1Thread1of1ForFork0_~value~0#1_201| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_130|) (= (select .cse0 |v_~#m~0.offset_240|) 0) (= |v_t1Thread1of1ForFork0_~arg#1.base_78| |v_t1Thread1of1ForFork0_#in~arg#1.base_78|) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_772| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_128|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_128| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_772|) (<= |v_t1Thread1of1ForFork0_#t~nondet50#1_126| 2147483647) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet50#1_126| 2147483648)) (= |v_~#queue~0.base_261| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_128|) (= |v_t1Thread1of1ForFork0_~value~0#1_201| |v_t1Thread1of1ForFork0_#t~nondet50#1_126|) (= |v_t1Thread1of1ForFork0_#in~arg#1.offset_78| |v_t1Thread1of1ForFork0_~arg#1.offset_78|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_213| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_130|) (= (store |v_#pthreadsMutex_540| |v_~#m~0.base_240| (store .cse0 |v_~#m~0.offset_240| 1)) |v_#pthreadsMutex_539|) (= |v_#memory_int_2135| (store |v_#memory_int_2136| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_772| (let ((.cse1 (select |v_#memory_int_2136| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_772|))) (store .cse1 (+ (* 4 (select .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_772| 3204))) |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_772|) |v_t1Thread1of1ForFork0_enqueue_~x#1_213|)))) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_128| |v_~#queue~0.offset_256|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_540|, ~#m~0.base=|v_~#m~0.base_240|, ~#queue~0.base=|v_~#queue~0.base_261|, t1Thread1of1ForFork0_#t~nondet50#1=|v_t1Thread1of1ForFork0_#t~nondet50#1_126|, ~#m~0.offset=|v_~#m~0.offset_240|, #memory_int=|v_#memory_int_2136|, ~#queue~0.offset=|v_~#queue~0.offset_256|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_78|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_78|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_226|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_78|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_772|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_201|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_128|, ~#queue~0.base=|v_~#queue~0.base_261|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_772|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_130|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_273|, ~#queue~0.offset=|v_~#queue~0.offset_256|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_78|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_378|, #pthreadsMutex=|v_#pthreadsMutex_539|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_289|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_329|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_78|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_304|, ~#m~0.base=|v_~#m~0.base_240|, ~#m~0.offset=|v_~#m~0.offset_240|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_82|, #memory_int=|v_#memory_int_2135|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_213|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_128|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_282|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_78|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_330|} 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 04:04:16,118 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| 799)) (= |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_262|))) (and (= 0 (select .cse0 |v_~#m~0.offset_262|)) (< |v_t2Thread1of1ForFork1_~i~1#1_249| 800) (= (store |v_#pthreadsMutex_585| |v_~#m~0.base_262| (store .cse0 |v_~#m~0.offset_262| 0)) |v_#pthreadsMutex_583|) (= (mod v_~dequeue_flag~0_210 256) 0) (= (+ |v_t2Thread1of1ForFork1_~i~1#1_249| 1) |v_t2Thread1of1ForFork1_~i~1#1_248|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_585|, ~#m~0.base=|v_~#m~0.base_262|, ~#m~0.offset=|v_~#m~0.offset_262|, ~dequeue_flag~0=v_~dequeue_flag~0_210, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_249|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_583|, ~#m~0.base=|v_~#m~0.base_262|, ~#m~0.offset=|v_~#m~0.offset_262|, ~dequeue_flag~0=v_~dequeue_flag~0_210, t2Thread1of1ForFork1_#t~nondet58#1=|v_t2Thread1of1ForFork1_#t~nondet58#1_92|, t2Thread1of1ForFork1_#t~post57#1=|v_t2Thread1of1ForFork1_#t~post57#1_60|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_248|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~nondet58#1, t2Thread1of1ForFork1_#t~post57#1, t2Thread1of1ForFork1_~i~1#1] [2022-12-06 04:04:16,179 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:04:16,180 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 345 [2022-12-06 04:04:16,180 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 100 transitions, 866 flow [2022-12-06 04:04:16,180 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 04:04:16,180 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:16,180 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 04:04:16,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:04:16,180 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 04:04:16,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:16,181 INFO L85 PathProgramCache]: Analyzing trace with hash -842198603, now seen corresponding path program 2 times [2022-12-06 04:04:16,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:16,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806886481] [2022-12-06 04:04:16,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:16,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:17,811 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 04:04:17,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:17,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806886481] [2022-12-06 04:04:17,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806886481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:04:17,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:04:17,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 04:04:17,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619066283] [2022-12-06 04:04:17,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:04:17,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 04:04:17,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:17,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 04:04:17,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-06 04:04:17,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 04:04:17,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 100 transitions, 866 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 04:04:17,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:17,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 04:04:17,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:19,476 INFO L130 PetriNetUnfolder]: 731/1303 cut-off events. [2022-12-06 04:04:19,476 INFO L131 PetriNetUnfolder]: For 3437/3437 co-relation queries the response was YES. [2022-12-06 04:04:19,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5240 conditions, 1303 events. 731/1303 cut-off events. For 3437/3437 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5961 event pairs, 228 based on Foata normal form. 16/1318 useless extension candidates. Maximal degree in co-relation 4954. Up to 1000 conditions per place. [2022-12-06 04:04:19,519 INFO L137 encePairwiseOnDemand]: 26/56 looper letters, 101 selfloop transitions, 47 changer transitions 12/160 dead transitions. [2022-12-06 04:04:19,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 160 transitions, 1478 flow [2022-12-06 04:04:19,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 04:04:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 04:04:19,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 139 transitions. [2022-12-06 04:04:19,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16547619047619047 [2022-12-06 04:04:19,520 INFO L175 Difference]: Start difference. First operand has 100 places, 100 transitions, 866 flow. Second operand 15 states and 139 transitions. [2022-12-06 04:04:19,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 160 transitions, 1478 flow [2022-12-06 04:04:19,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 160 transitions, 1413 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-06 04:04:19,530 INFO L231 Difference]: Finished difference. Result has 116 places, 111 transitions, 1039 flow [2022-12-06 04:04:19,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1039, PETRI_PLACES=116, PETRI_TRANSITIONS=111} [2022-12-06 04:04:19,531 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 48 predicate places. [2022-12-06 04:04:19,531 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:19,531 INFO L89 Accepts]: Start accepts. Operand has 116 places, 111 transitions, 1039 flow [2022-12-06 04:04:19,531 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:19,531 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:19,531 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 111 transitions, 1039 flow [2022-12-06 04:04:19,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 111 transitions, 1039 flow [2022-12-06 04:04:19,560 INFO L130 PetriNetUnfolder]: 108/364 cut-off events. [2022-12-06 04:04:19,560 INFO L131 PetriNetUnfolder]: For 1223/1223 co-relation queries the response was YES. [2022-12-06 04:04:19,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 364 events. 108/364 cut-off events. For 1223/1223 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1889 event pairs, 9 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 1360. Up to 71 conditions per place. [2022-12-06 04:04:19,563 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 111 transitions, 1039 flow [2022-12-06 04:04:19,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-06 04:04:19,571 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 [914] L981-6-->L981-8: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| |v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_51|) (= |v_#memory_int_492| (store |v_#memory_int_493| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_169| (store (select |v_#memory_int_493| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_169|) (+ 3208 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_169|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1))))) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_169|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_169|, #memory_int=|v_#memory_int_493|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_51|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_169|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_169|, #memory_int=|v_#memory_int_492|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_51|} AuxVars[] AssignedVars[#memory_int, t1Thread1of1ForFork0_enqueue_#t~post38#1] [2022-12-06 04:04:19,595 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:04:19,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-06 04:04:19,596 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 111 transitions, 1044 flow [2022-12-06 04:04:19,596 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 04:04:19,596 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:19,596 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 04:04:19,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:04:19,596 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 04:04:19,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:19,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1310027189, now seen corresponding path program 3 times [2022-12-06 04:04:19,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:19,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532836247] [2022-12-06 04:04:19,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:19,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:21,116 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 04:04:21,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:21,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532836247] [2022-12-06 04:04:21,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532836247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:04:21,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:04:21,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 04:04:21,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502951500] [2022-12-06 04:04:21,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:04:21,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 04:04:21,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:21,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 04:04:21,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-06 04:04:21,117 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 04:04:21,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 111 transitions, 1044 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 04:04:21,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:21,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 04:04:21,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:22,181 INFO L130 PetriNetUnfolder]: 875/1561 cut-off events. [2022-12-06 04:04:22,181 INFO L131 PetriNetUnfolder]: For 5764/5764 co-relation queries the response was YES. [2022-12-06 04:04:22,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6801 conditions, 1561 events. 875/1561 cut-off events. For 5764/5764 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7540 event pairs, 181 based on Foata normal form. 8/1568 useless extension candidates. Maximal degree in co-relation 6396. Up to 993 conditions per place. [2022-12-06 04:04:22,195 INFO L137 encePairwiseOnDemand]: 24/57 looper letters, 116 selfloop transitions, 62 changer transitions 20/198 dead transitions. [2022-12-06 04:04:22,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 198 transitions, 1939 flow [2022-12-06 04:04:22,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 04:04:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 04:04:22,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 153 transitions. [2022-12-06 04:04:22,197 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15789473684210525 [2022-12-06 04:04:22,197 INFO L175 Difference]: Start difference. First operand has 116 places, 111 transitions, 1044 flow. Second operand 17 states and 153 transitions. [2022-12-06 04:04:22,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 198 transitions, 1939 flow [2022-12-06 04:04:22,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 198 transitions, 1875 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-06 04:04:22,220 INFO L231 Difference]: Finished difference. Result has 135 places, 135 transitions, 1410 flow [2022-12-06 04:04:22,220 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1410, PETRI_PLACES=135, PETRI_TRANSITIONS=135} [2022-12-06 04:04:22,221 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 67 predicate places. [2022-12-06 04:04:22,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:22,221 INFO L89 Accepts]: Start accepts. Operand has 135 places, 135 transitions, 1410 flow [2022-12-06 04:04:22,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:22,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:22,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 135 transitions, 1410 flow [2022-12-06 04:04:22,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 135 transitions, 1410 flow [2022-12-06 04:04:22,274 INFO L130 PetriNetUnfolder]: 123/430 cut-off events. [2022-12-06 04:04:22,275 INFO L131 PetriNetUnfolder]: For 2037/2039 co-relation queries the response was YES. [2022-12-06 04:04:22,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1897 conditions, 430 events. 123/430 cut-off events. For 2037/2039 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2414 event pairs, 7 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 1789. Up to 80 conditions per place. [2022-12-06 04:04:22,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 135 transitions, 1410 flow [2022-12-06 04:04:22,279 INFO L188 LiptonReduction]: Number of co-enabled transitions 548 [2022-12-06 04:04:22,370 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| 799)) (= |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_262|))) (and (= 0 (select .cse0 |v_~#m~0.offset_262|)) (< |v_t2Thread1of1ForFork1_~i~1#1_249| 800) (= (store |v_#pthreadsMutex_585| |v_~#m~0.base_262| (store .cse0 |v_~#m~0.offset_262| 0)) |v_#pthreadsMutex_583|) (= (mod v_~dequeue_flag~0_210 256) 0) (= (+ |v_t2Thread1of1ForFork1_~i~1#1_249| 1) |v_t2Thread1of1ForFork1_~i~1#1_248|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_585|, ~#m~0.base=|v_~#m~0.base_262|, ~#m~0.offset=|v_~#m~0.offset_262|, ~dequeue_flag~0=v_~dequeue_flag~0_210, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_249|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_583|, ~#m~0.base=|v_~#m~0.base_262|, ~#m~0.offset=|v_~#m~0.offset_262|, ~dequeue_flag~0=v_~dequeue_flag~0_210, t2Thread1of1ForFork1_#t~nondet58#1=|v_t2Thread1of1ForFork1_#t~nondet58#1_92|, t2Thread1of1ForFork1_#t~post57#1=|v_t2Thread1of1ForFork1_#t~post57#1_60|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_248|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~nondet58#1, t2Thread1of1ForFork1_#t~post57#1, t2Thread1of1ForFork1_~i~1#1] [2022-12-06 04:04:22,427 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| 799)) (= |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_262|))) (and (= 0 (select .cse0 |v_~#m~0.offset_262|)) (< |v_t2Thread1of1ForFork1_~i~1#1_249| 800) (= (store |v_#pthreadsMutex_585| |v_~#m~0.base_262| (store .cse0 |v_~#m~0.offset_262| 0)) |v_#pthreadsMutex_583|) (= (mod v_~dequeue_flag~0_210 256) 0) (= (+ |v_t2Thread1of1ForFork1_~i~1#1_249| 1) |v_t2Thread1of1ForFork1_~i~1#1_248|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_585|, ~#m~0.base=|v_~#m~0.base_262|, ~#m~0.offset=|v_~#m~0.offset_262|, ~dequeue_flag~0=v_~dequeue_flag~0_210, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_249|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_583|, ~#m~0.base=|v_~#m~0.base_262|, ~#m~0.offset=|v_~#m~0.offset_262|, ~dequeue_flag~0=v_~dequeue_flag~0_210, t2Thread1of1ForFork1_#t~nondet58#1=|v_t2Thread1of1ForFork1_#t~nondet58#1_92|, t2Thread1of1ForFork1_#t~post57#1=|v_t2Thread1of1ForFork1_#t~post57#1_60|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_248|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~nondet58#1, t2Thread1of1ForFork1_#t~post57#1, t2Thread1of1ForFork1_~i~1#1] [2022-12-06 04:04:22,650 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:04:22,651 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 430 [2022-12-06 04:04:22,651 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 132 transitions, 1426 flow [2022-12-06 04:04:22,651 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 04:04:22,651 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:22,651 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 04:04:22,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 04:04:22,651 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 04:04:22,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:22,651 INFO L85 PathProgramCache]: Analyzing trace with hash 865145589, now seen corresponding path program 4 times [2022-12-06 04:04:22,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:22,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827923815] [2022-12-06 04:04:22,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:22,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:23,811 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 04:04:23,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:23,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827923815] [2022-12-06 04:04:23,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827923815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:04:23,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:04:23,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 04:04:23,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583526965] [2022-12-06 04:04:23,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:04:23,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 04:04:23,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:23,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 04:04:23,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-12-06 04:04:23,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 04:04:23,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 132 transitions, 1426 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 04:04:23,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:23,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 04:04:23,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:25,205 INFO L130 PetriNetUnfolder]: 1026/1796 cut-off events. [2022-12-06 04:04:25,206 INFO L131 PetriNetUnfolder]: For 10194/10194 co-relation queries the response was YES. [2022-12-06 04:04:25,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8969 conditions, 1796 events. 1026/1796 cut-off events. For 10194/10194 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8820 event pairs, 226 based on Foata normal form. 8/1803 useless extension candidates. Maximal degree in co-relation 8478. Up to 1005 conditions per place. [2022-12-06 04:04:25,224 INFO L137 encePairwiseOnDemand]: 24/63 looper letters, 131 selfloop transitions, 83 changer transitions 18/232 dead transitions. [2022-12-06 04:04:25,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 232 transitions, 2570 flow [2022-12-06 04:04:25,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 04:04:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 04:04:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 184 transitions. [2022-12-06 04:04:25,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15371762740183792 [2022-12-06 04:04:25,226 INFO L175 Difference]: Start difference. First operand has 131 places, 132 transitions, 1426 flow. Second operand 19 states and 184 transitions. [2022-12-06 04:04:25,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 232 transitions, 2570 flow [2022-12-06 04:04:25,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 232 transitions, 2363 flow, removed 91 selfloop flow, removed 8 redundant places. [2022-12-06 04:04:25,258 INFO L231 Difference]: Finished difference. Result has 144 places, 156 transitions, 1728 flow [2022-12-06 04:04:25,258 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1728, PETRI_PLACES=144, PETRI_TRANSITIONS=156} [2022-12-06 04:04:25,259 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 76 predicate places. [2022-12-06 04:04:25,259 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:25,259 INFO L89 Accepts]: Start accepts. Operand has 144 places, 156 transitions, 1728 flow [2022-12-06 04:04:25,260 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:25,260 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:25,260 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 156 transitions, 1728 flow [2022-12-06 04:04:25,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 156 transitions, 1728 flow [2022-12-06 04:04:25,303 INFO L130 PetriNetUnfolder]: 156/491 cut-off events. [2022-12-06 04:04:25,303 INFO L131 PetriNetUnfolder]: For 2748/2753 co-relation queries the response was YES. [2022-12-06 04:04:25,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2313 conditions, 491 events. 156/491 cut-off events. For 2748/2753 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2832 event pairs, 5 based on Foata normal form. 1/487 useless extension candidates. Maximal degree in co-relation 2234. Up to 97 conditions per place. [2022-12-06 04:04:25,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 156 transitions, 1728 flow [2022-12-06 04:04:25,308 INFO L188 LiptonReduction]: Number of co-enabled transitions 614 [2022-12-06 04:04:25,367 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| 799)) (= |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_262|))) (and (= 0 (select .cse0 |v_~#m~0.offset_262|)) (< |v_t2Thread1of1ForFork1_~i~1#1_249| 800) (= (store |v_#pthreadsMutex_585| |v_~#m~0.base_262| (store .cse0 |v_~#m~0.offset_262| 0)) |v_#pthreadsMutex_583|) (= (mod v_~dequeue_flag~0_210 256) 0) (= (+ |v_t2Thread1of1ForFork1_~i~1#1_249| 1) |v_t2Thread1of1ForFork1_~i~1#1_248|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_585|, ~#m~0.base=|v_~#m~0.base_262|, ~#m~0.offset=|v_~#m~0.offset_262|, ~dequeue_flag~0=v_~dequeue_flag~0_210, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_249|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_583|, ~#m~0.base=|v_~#m~0.base_262|, ~#m~0.offset=|v_~#m~0.offset_262|, ~dequeue_flag~0=v_~dequeue_flag~0_210, t2Thread1of1ForFork1_#t~nondet58#1=|v_t2Thread1of1ForFork1_#t~nondet58#1_92|, t2Thread1of1ForFork1_#t~post57#1=|v_t2Thread1of1ForFork1_#t~post57#1_60|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_248|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~nondet58#1, t2Thread1of1ForFork1_#t~post57#1, t2Thread1of1ForFork1_~i~1#1] [2022-12-06 04:04:25,605 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:04:25,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 347 [2022-12-06 04:04:25,606 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 154 transitions, 1735 flow [2022-12-06 04:04:25,606 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 04:04:25,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:25,606 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 04:04:25,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 04:04:25,606 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 04:04:25,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:25,606 INFO L85 PathProgramCache]: Analyzing trace with hash 676681670, now seen corresponding path program 1 times [2022-12-06 04:04:25,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:25,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798394939] [2022-12-06 04:04:25,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:25,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:04:25,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:25,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798394939] [2022-12-06 04:04:25,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798394939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:04:25,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:04:25,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:04:25,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105840856] [2022-12-06 04:04:25,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:04:25,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:04:25,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:25,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:04:25,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:04:25,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 68 [2022-12-06 04:04:25,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 154 transitions, 1735 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:04:25,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:25,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 68 [2022-12-06 04:04:25,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:25,875 INFO L130 PetriNetUnfolder]: 799/1508 cut-off events. [2022-12-06 04:04:25,875 INFO L131 PetriNetUnfolder]: For 9561/9563 co-relation queries the response was YES. [2022-12-06 04:04:25,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7696 conditions, 1508 events. 799/1508 cut-off events. For 9561/9563 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7711 event pairs, 270 based on Foata normal form. 36/1543 useless extension candidates. Maximal degree in co-relation 7518. Up to 983 conditions per place. [2022-12-06 04:04:25,886 INFO L137 encePairwiseOnDemand]: 48/68 looper letters, 125 selfloop transitions, 21 changer transitions 9/169 dead transitions. [2022-12-06 04:04:25,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 169 transitions, 2157 flow [2022-12-06 04:04:25,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:04:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:04:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2022-12-06 04:04:25,887 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2022-12-06 04:04:25,887 INFO L175 Difference]: Start difference. First operand has 141 places, 154 transitions, 1735 flow. Second operand 3 states and 94 transitions. [2022-12-06 04:04:25,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 169 transitions, 2157 flow [2022-12-06 04:04:25,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 169 transitions, 1927 flow, removed 71 selfloop flow, removed 16 redundant places. [2022-12-06 04:04:25,920 INFO L231 Difference]: Finished difference. Result has 129 places, 147 transitions, 1540 flow [2022-12-06 04:04:25,921 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1540, PETRI_PLACES=129, PETRI_TRANSITIONS=147} [2022-12-06 04:04:25,921 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 61 predicate places. [2022-12-06 04:04:25,921 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:25,921 INFO L89 Accepts]: Start accepts. Operand has 129 places, 147 transitions, 1540 flow [2022-12-06 04:04:25,922 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:25,922 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:25,922 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 147 transitions, 1540 flow [2022-12-06 04:04:25,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 147 transitions, 1540 flow [2022-12-06 04:04:25,976 INFO L130 PetriNetUnfolder]: 145/488 cut-off events. [2022-12-06 04:04:25,977 INFO L131 PetriNetUnfolder]: For 1573/1576 co-relation queries the response was YES. [2022-12-06 04:04:25,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2024 conditions, 488 events. 145/488 cut-off events. For 1573/1576 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2838 event pairs, 7 based on Foata normal form. 1/483 useless extension candidates. Maximal degree in co-relation 1908. Up to 96 conditions per place. [2022-12-06 04:04:25,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 147 transitions, 1540 flow [2022-12-06 04:04:25,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 584 [2022-12-06 04:04:25,982 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| 799)) (= |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 [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 04:04:26,031 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:04:26,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-06 04:04:26,031 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 147 transitions, 1546 flow [2022-12-06 04:04:26,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:04:26,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:26,032 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 04:04:26,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 04:04:26,032 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:04:26,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:26,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1780664249, now seen corresponding path program 1 times [2022-12-06 04:04:26,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:26,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131051130] [2022-12-06 04:04:26,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:26,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:27,241 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 04:04:27,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:27,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131051130] [2022-12-06 04:04:27,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131051130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:04:27,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:04:27,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 04:04:27,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972609088] [2022-12-06 04:04:27,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:04:27,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 04:04:27,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:27,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 04:04:27,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-06 04:04:27,242 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 04:04:27,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 147 transitions, 1546 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 04:04:27,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:27,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 04:04:27,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:28,261 INFO L130 PetriNetUnfolder]: 1057/1891 cut-off events. [2022-12-06 04:04:28,261 INFO L131 PetriNetUnfolder]: For 7572/7572 co-relation queries the response was YES. [2022-12-06 04:04:28,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8874 conditions, 1891 events. 1057/1891 cut-off events. For 7572/7572 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9586 event pairs, 418 based on Foata normal form. 8/1898 useless extension candidates. Maximal degree in co-relation 8502. Up to 1729 conditions per place. [2022-12-06 04:04:28,292 INFO L137 encePairwiseOnDemand]: 44/64 looper letters, 165 selfloop transitions, 22 changer transitions 23/210 dead transitions. [2022-12-06 04:04:28,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 210 transitions, 2351 flow [2022-12-06 04:04:28,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 04:04:28,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 04:04:28,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 131 transitions. [2022-12-06 04:04:28,294 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13645833333333332 [2022-12-06 04:04:28,294 INFO L175 Difference]: Start difference. First operand has 129 places, 147 transitions, 1546 flow. Second operand 15 states and 131 transitions. [2022-12-06 04:04:28,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 210 transitions, 2351 flow [2022-12-06 04:04:28,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 210 transitions, 2283 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-06 04:04:28,335 INFO L231 Difference]: Finished difference. Result has 154 places, 164 transitions, 1791 flow [2022-12-06 04:04:28,336 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1791, PETRI_PLACES=154, PETRI_TRANSITIONS=164} [2022-12-06 04:04:28,336 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 86 predicate places. [2022-12-06 04:04:28,336 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:28,336 INFO L89 Accepts]: Start accepts. Operand has 154 places, 164 transitions, 1791 flow [2022-12-06 04:04:28,337 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:28,337 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:28,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 164 transitions, 1791 flow [2022-12-06 04:04:28,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 164 transitions, 1791 flow [2022-12-06 04:04:28,382 INFO L130 PetriNetUnfolder]: 155/528 cut-off events. [2022-12-06 04:04:28,382 INFO L131 PetriNetUnfolder]: For 2215/2218 co-relation queries the response was YES. [2022-12-06 04:04:28,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2368 conditions, 528 events. 155/528 cut-off events. For 2215/2218 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3153 event pairs, 5 based on Foata normal form. 1/523 useless extension candidates. Maximal degree in co-relation 2298. Up to 108 conditions per place. [2022-12-06 04:04:28,387 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 164 transitions, 1791 flow [2022-12-06 04:04:28,387 INFO L188 LiptonReduction]: Number of co-enabled transitions 640 [2022-12-06 04:04:28,491 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1006] L958-->L1018-6: Formula: (and (= |v_t1Thread1of1ForFork0_empty_~q#1.base_126| |v_t1Thread1of1ForFork0_empty_#in~q#1.base_70|) (= |v_t1Thread1of1ForFork0_empty_#t~nondet33#1_123| |v_t1Thread1of1ForFork0_empty_#t~nondet33#1_122|) (= (store |v_#pthreadsMutex_528| |v_~#m~0.base_234| (store (select |v_#pthreadsMutex_528| |v_~#m~0.base_234|) |v_~#m~0.offset_234| 0)) |v_#pthreadsMutex_527|) (= |v_t1Thread1of1ForFork0_empty_#res#1_118| 0) (= |v_t1Thread1of1ForFork0_~i~0#1_222| 0) (= |v_t1Thread1of1ForFork0_empty_~q#1.offset_126| |v_t1Thread1of1ForFork0_empty_#in~q#1.offset_70|) (not (let ((.cse0 (select |v_#memory_int_2125| |v_t1Thread1of1ForFork0_empty_~q#1.base_126|))) (= (select .cse0 (+ 3204 |v_t1Thread1of1ForFork0_empty_~q#1.offset_126|)) (select .cse0 (+ 3200 |v_t1Thread1of1ForFork0_empty_~q#1.offset_126|)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_528|, ~#m~0.base=|v_~#m~0.base_234|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_70|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_123|, ~#m~0.offset=|v_~#m~0.offset_234|, #memory_int=|v_#memory_int_2125|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_70|} OutVars{t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_126|, #pthreadsMutex=|v_#pthreadsMutex_527|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_70|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_222|, t1Thread1of1ForFork0_empty_#t~mem31#1=|v_t1Thread1of1ForFork0_empty_#t~mem31#1_198|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_126|, ~#m~0.base=|v_~#m~0.base_234|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_122|, ~#m~0.offset=|v_~#m~0.offset_234|, t1Thread1of1ForFork0_empty_#t~mem32#1=|v_t1Thread1of1ForFork0_empty_#t~mem32#1_124|, t1Thread1of1ForFork0_#t~ret52#1=|v_t1Thread1of1ForFork0_#t~ret52#1_71|, #memory_int=|v_#memory_int_2125|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_70|, t1Thread1of1ForFork0_empty_#res#1=|v_t1Thread1of1ForFork0_empty_#res#1_118|} 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_262|))) (and (= 0 (select .cse0 |v_~#m~0.offset_262|)) (< |v_t2Thread1of1ForFork1_~i~1#1_249| 800) (= (store |v_#pthreadsMutex_585| |v_~#m~0.base_262| (store .cse0 |v_~#m~0.offset_262| 0)) |v_#pthreadsMutex_583|) (= (mod v_~dequeue_flag~0_210 256) 0) (= (+ |v_t2Thread1of1ForFork1_~i~1#1_249| 1) |v_t2Thread1of1ForFork1_~i~1#1_248|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_585|, ~#m~0.base=|v_~#m~0.base_262|, ~#m~0.offset=|v_~#m~0.offset_262|, ~dequeue_flag~0=v_~dequeue_flag~0_210, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_249|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_583|, ~#m~0.base=|v_~#m~0.base_262|, ~#m~0.offset=|v_~#m~0.offset_262|, ~dequeue_flag~0=v_~dequeue_flag~0_210, t2Thread1of1ForFork1_#t~nondet58#1=|v_t2Thread1of1ForFork1_#t~nondet58#1_92|, t2Thread1of1ForFork1_#t~post57#1=|v_t2Thread1of1ForFork1_#t~post57#1_60|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_248|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~nondet58#1, t2Thread1of1ForFork1_#t~post57#1, t2Thread1of1ForFork1_~i~1#1] [2022-12-06 04:04:28,900 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:04:28,900 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 564 [2022-12-06 04:04:28,901 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 163 transitions, 1798 flow [2022-12-06 04:04:28,901 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 04:04:28,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:28,901 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 04:04:28,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 04:04:28,901 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:04:28,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:28,901 INFO L85 PathProgramCache]: Analyzing trace with hash -678071647, now seen corresponding path program 1 times [2022-12-06 04:04:28,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:28,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925047744] [2022-12-06 04:04:28,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:28,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:29,492 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 04:04:29,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:29,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925047744] [2022-12-06 04:04:29,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925047744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:04:29,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:04:29,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 04:04:29,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037116835] [2022-12-06 04:04:29,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:04:29,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 04:04:29,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:29,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 04:04:29,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 04:04:29,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 68 [2022-12-06 04:04:29,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 163 transitions, 1798 flow. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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 04:04:29,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:29,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 68 [2022-12-06 04:04:29,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:29,996 INFO L130 PetriNetUnfolder]: 862/1650 cut-off events. [2022-12-06 04:04:29,997 INFO L131 PetriNetUnfolder]: For 7077/7077 co-relation queries the response was YES. [2022-12-06 04:04:30,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7987 conditions, 1650 events. 862/1650 cut-off events. For 7077/7077 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8784 event pairs, 227 based on Foata normal form. 5/1654 useless extension candidates. Maximal degree in co-relation 7832. Up to 1124 conditions per place. [2022-12-06 04:04:30,009 INFO L137 encePairwiseOnDemand]: 45/68 looper letters, 154 selfloop transitions, 40 changer transitions 4/199 dead transitions. [2022-12-06 04:04:30,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 199 transitions, 2410 flow [2022-12-06 04:04:30,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 04:04:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 04:04:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2022-12-06 04:04:30,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1895424836601307 [2022-12-06 04:04:30,028 INFO L175 Difference]: Start difference. First operand has 151 places, 163 transitions, 1798 flow. Second operand 9 states and 116 transitions. [2022-12-06 04:04:30,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 199 transitions, 2410 flow [2022-12-06 04:04:30,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 199 transitions, 2312 flow, removed 49 selfloop flow, removed 3 redundant places. [2022-12-06 04:04:30,054 INFO L231 Difference]: Finished difference. Result has 159 places, 166 transitions, 1848 flow [2022-12-06 04:04:30,055 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1700, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1848, PETRI_PLACES=159, PETRI_TRANSITIONS=166} [2022-12-06 04:04:30,055 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 91 predicate places. [2022-12-06 04:04:30,055 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:30,055 INFO L89 Accepts]: Start accepts. Operand has 159 places, 166 transitions, 1848 flow [2022-12-06 04:04:30,056 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:30,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:30,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 166 transitions, 1848 flow [2022-12-06 04:04:30,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 166 transitions, 1848 flow [2022-12-06 04:04:30,103 INFO L130 PetriNetUnfolder]: 156/532 cut-off events. [2022-12-06 04:04:30,103 INFO L131 PetriNetUnfolder]: For 2408/2411 co-relation queries the response was YES. [2022-12-06 04:04:30,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2465 conditions, 532 events. 156/532 cut-off events. For 2408/2411 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3219 event pairs, 5 based on Foata normal form. 1/527 useless extension candidates. Maximal degree in co-relation 2344. Up to 108 conditions per place. [2022-12-06 04:04:30,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 166 transitions, 1848 flow [2022-12-06 04:04:30,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 638 [2022-12-06 04:04:30,114 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:04:30,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 04:04:30,115 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 166 transitions, 1848 flow [2022-12-06 04:04:30,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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 04:04:30,115 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:30,115 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 04:04:30,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 04:04:30,115 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:04:30,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:30,115 INFO L85 PathProgramCache]: Analyzing trace with hash -282026594, now seen corresponding path program 1 times [2022-12-06 04:04:30,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:30,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965844178] [2022-12-06 04:04:30,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:30,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:04:30,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:30,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965844178] [2022-12-06 04:04:30,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965844178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:04:30,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:04:30,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:04:30,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304440093] [2022-12-06 04:04:30,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:04:30,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:04:30,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:30,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:04:30,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:04:30,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 68 [2022-12-06 04:04:30,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 166 transitions, 1848 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 04:04:30,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:30,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 68 [2022-12-06 04:04:30,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:30,401 INFO L130 PetriNetUnfolder]: 704/1391 cut-off events. [2022-12-06 04:04:30,402 INFO L131 PetriNetUnfolder]: For 7473/7475 co-relation queries the response was YES. [2022-12-06 04:04:30,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6918 conditions, 1391 events. 704/1391 cut-off events. For 7473/7475 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7486 event pairs, 254 based on Foata normal form. 73/1463 useless extension candidates. Maximal degree in co-relation 6604. Up to 743 conditions per place. [2022-12-06 04:04:30,409 INFO L137 encePairwiseOnDemand]: 50/68 looper letters, 110 selfloop transitions, 16 changer transitions 19/150 dead transitions. [2022-12-06 04:04:30,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 150 transitions, 1909 flow [2022-12-06 04:04:30,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:04:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:04:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-12-06 04:04:30,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4264705882352941 [2022-12-06 04:04:30,410 INFO L175 Difference]: Start difference. First operand has 158 places, 166 transitions, 1848 flow. Second operand 3 states and 87 transitions. [2022-12-06 04:04:30,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 150 transitions, 1909 flow [2022-12-06 04:04:30,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 150 transitions, 1755 flow, removed 14 selfloop flow, removed 16 redundant places. [2022-12-06 04:04:30,432 INFO L231 Difference]: Finished difference. Result has 145 places, 128 transitions, 1361 flow [2022-12-06 04:04:30,433 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1361, PETRI_PLACES=145, PETRI_TRANSITIONS=128} [2022-12-06 04:04:30,433 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 77 predicate places. [2022-12-06 04:04:30,433 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:30,433 INFO L89 Accepts]: Start accepts. Operand has 145 places, 128 transitions, 1361 flow [2022-12-06 04:04:30,434 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:30,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:30,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 128 transitions, 1361 flow [2022-12-06 04:04:30,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 128 transitions, 1361 flow [2022-12-06 04:04:30,463 INFO L130 PetriNetUnfolder]: 81/349 cut-off events. [2022-12-06 04:04:30,464 INFO L131 PetriNetUnfolder]: For 1425/1427 co-relation queries the response was YES. [2022-12-06 04:04:30,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 349 events. 81/349 cut-off events. For 1425/1427 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2080 event pairs, 7 based on Foata normal form. 0/344 useless extension candidates. Maximal degree in co-relation 1423. Up to 63 conditions per place. [2022-12-06 04:04:30,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 128 transitions, 1361 flow [2022-12-06 04:04:30,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 476 [2022-12-06 04:04:30,822 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 [1004] L958-->L1018-6: Formula: (and (= (store |v_#pthreadsMutex_520| |v_~#m~0.base_230| (store (select |v_#pthreadsMutex_520| |v_~#m~0.base_230|) |v_~#m~0.offset_230| 0)) |v_#pthreadsMutex_519|) (= |v_t1Thread1of1ForFork0_empty_#t~nondet33#1_115| |v_t1Thread1of1ForFork0_empty_#t~nondet33#1_114|) (= |v_t1Thread1of1ForFork0_~i~0#1_218| 0) (= |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|) (not (let ((.cse0 (select |v_#memory_int_2121| |v_t1Thread1of1ForFork0_empty_~q#1.base_122|))) (= (select .cse0 (+ 3200 |v_t1Thread1of1ForFork0_empty_~q#1.offset_122|)) (select .cse0 (+ 3204 |v_t1Thread1of1ForFork0_empty_~q#1.offset_122|)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_520|, ~#m~0.base=|v_~#m~0.base_230|, 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_230|, #memory_int=|v_#memory_int_2121|, 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_519|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_66|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_218|, 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_230|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_114|, ~#m~0.offset=|v_~#m~0.offset_230|, 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_2121|, 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] [2022-12-06 04:04:30,878 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:04:30,878 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 445 [2022-12-06 04:04:30,878 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 126 transitions, 1394 flow [2022-12-06 04:04:30,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 04:04:30,879 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:30,879 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 04:04:30,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 04:04:30,879 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:04:30,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:30,879 INFO L85 PathProgramCache]: Analyzing trace with hash -421555835, now seen corresponding path program 1 times [2022-12-06 04:04:30,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:30,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965956083] [2022-12-06 04:04:30,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:30,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:32,034 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 04:04:32,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:32,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965956083] [2022-12-06 04:04:32,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965956083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:04:32,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:04:32,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 04:04:32,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010678813] [2022-12-06 04:04:32,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:04:32,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 04:04:32,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:32,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 04:04:32,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-06 04:04:32,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 04:04:32,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 126 transitions, 1394 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 04:04:32,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:32,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 04:04:32,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:33,190 INFO L130 PetriNetUnfolder]: 780/1477 cut-off events. [2022-12-06 04:04:33,190 INFO L131 PetriNetUnfolder]: For 6387/6387 co-relation queries the response was YES. [2022-12-06 04:04:33,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6934 conditions, 1477 events. 780/1477 cut-off events. For 6387/6387 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7728 event pairs, 221 based on Foata normal form. 8/1482 useless extension candidates. Maximal degree in co-relation 6617. Up to 1067 conditions per place. [2022-12-06 04:04:33,197 INFO L137 encePairwiseOnDemand]: 36/66 looper letters, 133 selfloop transitions, 39 changer transitions 28/200 dead transitions. [2022-12-06 04:04:33,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 200 transitions, 2314 flow [2022-12-06 04:04:33,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 04:04:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 04:04:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 145 transitions. [2022-12-06 04:04:33,198 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14646464646464646 [2022-12-06 04:04:33,198 INFO L175 Difference]: Start difference. First operand has 143 places, 126 transitions, 1394 flow. Second operand 15 states and 145 transitions. [2022-12-06 04:04:33,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 200 transitions, 2314 flow [2022-12-06 04:04:33,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 200 transitions, 2179 flow, removed 40 selfloop flow, removed 4 redundant places. [2022-12-06 04:04:33,220 INFO L231 Difference]: Finished difference. Result has 164 places, 146 transitions, 1710 flow [2022-12-06 04:04:33,220 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1710, PETRI_PLACES=164, PETRI_TRANSITIONS=146} [2022-12-06 04:04:33,221 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 96 predicate places. [2022-12-06 04:04:33,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:33,221 INFO L89 Accepts]: Start accepts. Operand has 164 places, 146 transitions, 1710 flow [2022-12-06 04:04:33,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:33,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:33,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 146 transitions, 1710 flow [2022-12-06 04:04:33,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 146 transitions, 1710 flow [2022-12-06 04:04:33,258 INFO L130 PetriNetUnfolder]: 90/401 cut-off events. [2022-12-06 04:04:33,258 INFO L131 PetriNetUnfolder]: For 2045/2049 co-relation queries the response was YES. [2022-12-06 04:04:33,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 401 events. 90/401 cut-off events. For 2045/2049 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2529 event pairs, 4 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 1750. Up to 70 conditions per place. [2022-12-06 04:04:33,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 146 transitions, 1710 flow [2022-12-06 04:04:33,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 544 [2022-12-06 04:04:33,472 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:04:33,473 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 252 [2022-12-06 04:04:33,473 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 145 transitions, 1706 flow [2022-12-06 04:04:33,473 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 04:04:33,473 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:33,473 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 04:04:33,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 04:04:33,473 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:04:33,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:33,474 INFO L85 PathProgramCache]: Analyzing trace with hash -229824657, now seen corresponding path program 1 times [2022-12-06 04:04:33,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:33,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551799704] [2022-12-06 04:04:33,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:33,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:04:33,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:04:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:04:33,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:04:33,569 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:04:33,570 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:04:33,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:04:33,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:04:33,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:04:33,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-12-06 04:04:33,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-12-06 04:04:33,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:04:33,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 04:04:33,574 INFO L458 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:04:33,578 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:04:33,578 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:04:33,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:04:33 BasicIcfg [2022-12-06 04:04:33,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:04:33,643 INFO L158 Benchmark]: Toolchain (without parser) took 66402.11ms. Allocated memory was 206.6MB in the beginning and 916.5MB in the end (delta: 709.9MB). Free memory was 181.1MB in the beginning and 713.3MB in the end (delta: -532.2MB). Peak memory consumption was 178.2MB. Max. memory is 8.0GB. [2022-12-06 04:04:33,643 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 206.6MB. Free memory is still 182.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:04:33,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.13ms. Allocated memory is still 206.6MB. Free memory was 181.1MB in the beginning and 150.6MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-06 04:04:33,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.92ms. Allocated memory is still 206.6MB. Free memory was 150.6MB in the beginning and 147.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:04:33,644 INFO L158 Benchmark]: Boogie Preprocessor took 34.19ms. Allocated memory is still 206.6MB. Free memory was 147.5MB in the beginning and 145.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:04:33,644 INFO L158 Benchmark]: RCFGBuilder took 594.75ms. Allocated memory is still 206.6MB. Free memory was 145.4MB in the beginning and 121.8MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-06 04:04:33,646 INFO L158 Benchmark]: TraceAbstraction took 65249.41ms. Allocated memory was 206.6MB in the beginning and 916.5MB in the end (delta: 709.9MB). Free memory was 121.3MB in the beginning and 713.3MB in the end (delta: -592.0MB). Peak memory consumption was 118.4MB. Max. memory is 8.0GB. [2022-12-06 04:04:33,647 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 206.6MB. Free memory is still 182.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 461.13ms. Allocated memory is still 206.6MB. Free memory was 181.1MB in the beginning and 150.6MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.92ms. Allocated memory is still 206.6MB. Free memory was 150.6MB in the beginning and 147.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.19ms. Allocated memory is still 206.6MB. Free memory was 147.5MB in the beginning and 145.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 594.75ms. Allocated memory is still 206.6MB. Free memory was 145.4MB in the beginning and 121.8MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 65249.41ms. Allocated memory was 206.6MB in the beginning and 916.5MB in the end (delta: 709.9MB). Free memory was 121.3MB in the beginning and 713.3MB in the end (delta: -592.0MB). Peak memory consumption was 118.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 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: 203, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 175, dependent conditional: 0, dependent unconditional: 175, 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: 110, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 94, dependent conditional: 0, dependent unconditional: 94, 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: 111, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 108, dependent conditional: 0, dependent unconditional: 108, 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: 45, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 42, dependent conditional: 13, dependent unconditional: 30, 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: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 3, dependent unconditional: 15, 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: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 7, dependent unconditional: 7, 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, 76 PlacesBefore, 75 PlacesAfterwards, 77 TransitionsBefore, 76 TransitionsAfterwards, 1300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 984, independent: 832, independent conditional: 832, 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: 984, independent: 832, independent conditional: 232, independent unconditional: 600, dependent: 152, dependent conditional: 46, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1006, independent: 832, independent conditional: 232, independent unconditional: 600, dependent: 174, dependent conditional: 68, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1006, independent: 832, independent conditional: 232, independent unconditional: 600, dependent: 174, dependent conditional: 68, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 10, independent conditional: 7, independent unconditional: 3, dependent: 19, dependent conditional: 8, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 8, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 35, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1006, independent: 822, independent conditional: 225, independent unconditional: 597, dependent: 155, dependent conditional: 60, dependent unconditional: 95, unknown: 29, unknown conditional: 15, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 934, Positive cache size: 721, Positive conditional cache size: 9, Positive unconditional cache size: 712, Negative cache size: 213, Negative conditional cache size: 22, Negative unconditional cache size: 191, 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, 78 PlacesBefore, 76 PlacesAfterwards, 79 TransitionsBefore, 77 TransitionsAfterwards, 1332 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1363, independent: 1136, independent conditional: 1136, independent unconditional: 0, dependent: 227, dependent conditional: 227, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1363, independent: 1136, independent conditional: 214, independent unconditional: 922, dependent: 227, dependent conditional: 63, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1387, independent: 1136, independent conditional: 205, independent unconditional: 931, dependent: 251, dependent conditional: 87, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1387, independent: 1136, independent conditional: 205, independent unconditional: 931, dependent: 251, dependent conditional: 87, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 4, dependent unconditional: 15, 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: 6, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1387, independent: 1127, independent conditional: 200, independent unconditional: 927, dependent: 232, dependent conditional: 83, dependent unconditional: 149, unknown: 28, unknown conditional: 9, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 993, Positive cache size: 761, Positive conditional cache size: 14, Positive unconditional cache size: 747, Negative cache size: 232, Negative conditional cache size: 26, Negative unconditional cache size: 206, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 454, independent: 377, independent conditional: 377, independent unconditional: 0, dependent: 77, dependent conditional: 77, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 454, independent: 377, independent conditional: 68, independent unconditional: 309, dependent: 77, dependent conditional: 21, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 466, independent: 377, independent conditional: 65, independent unconditional: 312, dependent: 89, dependent conditional: 33, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 466, independent: 377, independent conditional: 65, independent unconditional: 312, dependent: 89, dependent conditional: 33, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 466, independent: 375, independent conditional: 63, independent unconditional: 312, dependent: 86, dependent conditional: 30, dependent unconditional: 56, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 998, Positive cache size: 763, Positive conditional cache size: 16, Positive unconditional cache size: 747, Negative cache size: 235, Negative conditional cache size: 29, Negative unconditional cache size: 206, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 515, independent: 435, independent conditional: 435, 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: 515, independent: 435, independent conditional: 94, independent unconditional: 341, dependent: 80, dependent conditional: 22, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 528, independent: 435, independent conditional: 91, independent unconditional: 344, dependent: 93, dependent conditional: 35, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 528, independent: 435, independent conditional: 91, independent unconditional: 344, dependent: 93, dependent conditional: 35, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 20, independent conditional: 2, independent unconditional: 18, 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: 29, independent: 20, independent conditional: 0, independent unconditional: 20, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 4, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 528, independent: 415, independent conditional: 89, independent unconditional: 326, dependent: 84, dependent conditional: 32, dependent unconditional: 52, unknown: 29, unknown conditional: 5, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 1027, Positive cache size: 783, Positive conditional cache size: 18, Positive unconditional cache size: 765, Negative cache size: 244, Negative conditional cache size: 32, Negative unconditional cache size: 212, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 78 PlacesBefore, 69 PlacesAfterwards, 77 TransitionsBefore, 68 TransitionsAfterwards, 614 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 332, independent: 240, independent conditional: 240, independent unconditional: 0, dependent: 92, dependent conditional: 92, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 332, independent: 240, independent conditional: 127, independent unconditional: 113, dependent: 92, dependent conditional: 32, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 348, independent: 240, independent conditional: 127, independent unconditional: 113, dependent: 108, dependent conditional: 48, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 348, independent: 240, independent conditional: 127, independent unconditional: 113, dependent: 108, dependent conditional: 48, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, independent: 27, independent conditional: 2, independent unconditional: 25, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 348, independent: 213, independent conditional: 125, independent unconditional: 88, dependent: 101, dependent conditional: 48, dependent unconditional: 53, unknown: 34, unknown conditional: 2, unknown unconditional: 32] , Statistics on independence cache: Total cache size (in pairs): 1350, Positive cache size: 1099, Positive conditional cache size: 20, Positive unconditional cache size: 1079, Negative cache size: 251, Negative conditional cache size: 32, Negative unconditional cache size: 219, 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, 74 PlacesBefore, 71 PlacesAfterwards, 68 TransitionsBefore, 65 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 279, independent: 208, independent conditional: 208, independent unconditional: 0, dependent: 71, dependent conditional: 71, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 279, independent: 208, independent conditional: 93, independent unconditional: 115, dependent: 71, dependent conditional: 42, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 313, independent: 208, independent conditional: 93, independent unconditional: 115, dependent: 105, dependent conditional: 76, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 313, independent: 208, independent conditional: 93, independent unconditional: 115, dependent: 105, dependent conditional: 76, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 13, independent conditional: 4, independent unconditional: 9, dependent: 8, dependent conditional: 7, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 7, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 8, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 313, independent: 195, independent conditional: 89, independent unconditional: 106, dependent: 97, dependent conditional: 69, dependent unconditional: 28, unknown: 21, unknown conditional: 11, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 1420, Positive cache size: 1161, Positive conditional cache size: 24, Positive unconditional cache size: 1137, Negative cache size: 259, Negative conditional cache size: 39, Negative unconditional cache size: 220, 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.4s, 83 PlacesBefore, 82 PlacesAfterwards, 77 TransitionsBefore, 76 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 268, independent: 188, independent conditional: 188, 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: 268, independent: 188, independent conditional: 98, independent unconditional: 90, dependent: 80, dependent conditional: 58, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 308, independent: 188, independent conditional: 98, independent unconditional: 90, dependent: 120, dependent conditional: 98, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 308, independent: 188, independent conditional: 98, independent unconditional: 90, dependent: 120, dependent conditional: 98, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 308, independent: 181, independent conditional: 95, independent unconditional: 86, dependent: 108, dependent conditional: 86, dependent unconditional: 22, unknown: 19, unknown conditional: 15, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1451, Positive cache size: 1180, Positive conditional cache size: 27, Positive unconditional cache size: 1153, Negative cache size: 271, Negative conditional cache size: 51, Negative unconditional cache size: 220, 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, 82 PlacesBefore, 82 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 95, independent: 56, independent conditional: 36, independent unconditional: 20, dependent: 39, dependent conditional: 22, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, independent: 56, independent conditional: 36, independent unconditional: 20, dependent: 52, dependent conditional: 35, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, independent: 56, independent conditional: 36, independent unconditional: 20, dependent: 52, dependent conditional: 35, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 108, independent: 54, independent conditional: 34, independent unconditional: 20, dependent: 48, dependent conditional: 31, dependent unconditional: 17, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1457, Positive cache size: 1182, Positive conditional cache size: 29, Positive unconditional cache size: 1153, Negative cache size: 275, Negative conditional cache size: 55, Negative unconditional cache size: 220, 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.3s, 103 PlacesBefore, 100 PlacesAfterwards, 103 TransitionsBefore, 100 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 179, independent: 121, independent conditional: 17, independent unconditional: 104, dependent: 58, dependent conditional: 50, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 217, independent: 121, independent conditional: 17, independent unconditional: 104, dependent: 96, dependent conditional: 86, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 217, independent: 121, independent conditional: 17, independent unconditional: 104, dependent: 96, dependent conditional: 86, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 14, independent conditional: 10, independent unconditional: 4, dependent: 12, dependent conditional: 10, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 10, dependent unconditional: 2, 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: 15, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 217, independent: 107, independent conditional: 7, independent unconditional: 100, dependent: 84, dependent conditional: 76, dependent unconditional: 8, unknown: 26, unknown conditional: 20, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1508, Positive cache size: 1221, Positive conditional cache size: 39, Positive unconditional cache size: 1182, Negative cache size: 287, Negative conditional cache size: 65, Negative unconditional cache size: 222, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 116 PlacesBefore, 116 PlacesAfterwards, 111 TransitionsBefore, 111 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 102, independent: 46, independent conditional: 10, independent unconditional: 36, dependent: 56, dependent conditional: 24, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 130, independent: 46, independent conditional: 10, independent unconditional: 36, dependent: 84, dependent conditional: 50, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 130, independent: 46, independent conditional: 10, independent unconditional: 36, dependent: 84, dependent conditional: 50, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 130, independent: 45, independent conditional: 9, independent unconditional: 36, dependent: 80, dependent conditional: 46, dependent unconditional: 34, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1513, Positive cache size: 1222, Positive conditional cache size: 40, Positive unconditional cache size: 1182, Negative cache size: 291, Negative conditional cache size: 69, Negative unconditional cache size: 222, 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, 134 PlacesBefore, 131 PlacesAfterwards, 135 TransitionsBefore, 132 TransitionsAfterwards, 548 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 203, independent: 113, independent conditional: 113, independent unconditional: 0, dependent: 90, dependent conditional: 90, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 203, independent: 113, independent conditional: 77, independent unconditional: 36, dependent: 90, dependent conditional: 57, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 254, independent: 113, independent conditional: 77, independent unconditional: 36, dependent: 141, dependent conditional: 105, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 254, independent: 113, independent conditional: 77, independent unconditional: 36, dependent: 141, dependent conditional: 105, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 254, independent: 97, independent conditional: 61, independent unconditional: 36, dependent: 137, dependent conditional: 101, dependent unconditional: 36, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1537, Positive cache size: 1242, Positive conditional cache size: 56, Positive unconditional cache size: 1186, Negative cache size: 295, Negative conditional cache size: 73, Negative unconditional cache size: 222, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 143 PlacesBefore, 141 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: 100, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 69, dependent conditional: 47, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 165, independent: 31, independent conditional: 30, independent unconditional: 1, dependent: 134, dependent conditional: 110, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 165, independent: 31, independent conditional: 30, independent unconditional: 1, dependent: 134, dependent conditional: 110, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, 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: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 165, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 126, dependent conditional: 102, dependent unconditional: 24, unknown: 19, unknown conditional: 18, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1585, Positive cache size: 1282, Positive conditional cache size: 66, Positive unconditional cache size: 1216, Negative cache size: 303, Negative conditional cache size: 81, Negative unconditional cache size: 222, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 129 PlacesBefore, 129 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 584 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 194, independent: 128, independent conditional: 128, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 194, independent: 128, independent conditional: 38, independent unconditional: 90, dependent: 66, dependent conditional: 62, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 252, independent: 128, independent conditional: 36, independent unconditional: 92, dependent: 124, dependent conditional: 116, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 252, independent: 128, independent conditional: 36, independent unconditional: 92, dependent: 124, dependent conditional: 116, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 252, independent: 125, independent conditional: 34, independent unconditional: 91, dependent: 124, dependent conditional: 116, dependent unconditional: 8, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1588, Positive cache size: 1285, Positive conditional cache size: 68, Positive unconditional cache size: 1217, Negative cache size: 303, Negative conditional cache size: 81, Negative unconditional cache size: 222, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 152 PlacesBefore, 151 PlacesAfterwards, 164 TransitionsBefore, 163 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 170, independent: 86, independent conditional: 86, independent unconditional: 0, dependent: 84, dependent conditional: 84, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 170, independent: 86, independent conditional: 34, independent unconditional: 52, dependent: 84, dependent conditional: 80, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 272, independent: 86, independent conditional: 34, independent unconditional: 52, dependent: 186, dependent conditional: 178, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 272, independent: 86, independent conditional: 34, independent unconditional: 52, dependent: 186, dependent conditional: 178, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 272, independent: 75, independent conditional: 23, independent unconditional: 52, dependent: 174, dependent conditional: 166, dependent unconditional: 8, unknown: 23, unknown conditional: 23, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1612, Positive cache size: 1297, Positive conditional cache size: 79, Positive unconditional cache size: 1218, Negative cache size: 315, Negative conditional cache size: 93, Negative unconditional cache size: 222, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 158 PlacesBefore, 158 PlacesAfterwards, 166 TransitionsBefore, 166 TransitionsAfterwards, 638 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 25, independent conditional: 11, independent unconditional: 14, dependent: 31, dependent conditional: 18, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, independent: 25, independent conditional: 11, independent unconditional: 14, dependent: 63, dependent conditional: 48, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 25, independent conditional: 11, independent unconditional: 14, dependent: 63, dependent conditional: 48, dependent unconditional: 15, 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: 3, dependent unconditional: 0, 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: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, independent: 25, independent conditional: 11, independent unconditional: 14, dependent: 60, dependent conditional: 45, dependent unconditional: 15, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1615, Positive cache size: 1297, Positive conditional cache size: 79, Positive unconditional cache size: 1218, Negative cache size: 318, Negative conditional cache size: 96, Negative unconditional cache size: 222, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 145 PlacesBefore, 143 PlacesAfterwards, 128 TransitionsBefore, 126 TransitionsAfterwards, 476 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 180, independent: 115, independent conditional: 115, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 180, independent: 115, independent conditional: 44, independent unconditional: 71, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 304, independent: 115, independent conditional: 40, independent unconditional: 75, dependent: 189, dependent conditional: 185, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 304, independent: 115, independent conditional: 40, independent unconditional: 75, dependent: 189, dependent conditional: 185, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 15, dependent conditional: 13, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 13, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 44, dependent conditional: 41, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 304, independent: 111, independent conditional: 38, independent unconditional: 73, dependent: 174, dependent conditional: 172, dependent unconditional: 2, unknown: 19, unknown conditional: 15, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1641, Positive cache size: 1308, Positive conditional cache size: 81, Positive unconditional cache size: 1227, Negative cache size: 333, Negative conditional cache size: 109, Negative unconditional cache size: 224, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 162 PlacesBefore, 161 PlacesAfterwards, 146 TransitionsBefore, 145 TransitionsAfterwards, 544 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 233, independent: 147, independent conditional: 147, independent unconditional: 0, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 233, independent: 147, independent conditional: 53, independent unconditional: 94, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 389, independent: 147, independent conditional: 53, independent unconditional: 94, dependent: 242, dependent conditional: 242, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 389, independent: 147, independent conditional: 53, independent unconditional: 94, dependent: 242, dependent conditional: 242, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 149, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 149, dependent conditional: 149, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 389, independent: 141, independent conditional: 47, independent unconditional: 94, dependent: 222, dependent conditional: 222, dependent unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1668, Positive cache size: 1315, Positive conditional cache size: 87, Positive unconditional cache size: 1228, Negative cache size: 353, Negative conditional cache size: 129, Negative unconditional cache size: 224, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 5 - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L947] 0 pthread_mutex_t m; [L949] 0 int stored_elements[(800)]; [L950] 0 _Bool enqueue_flag, dequeue_flag; [L951] 0 QType queue; [L1054] 0 pthread_t id1, id2; [L1055] 0 enqueue_flag=(1) [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 [L955] 0 q->tail=0 [L956] 0 q->amount=0 [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head [L960] EXPR 0 q->tail [L960] COND TRUE 0 q->head == q->tail [L963] 0 return (-1); [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) [L1062] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={7:0}, id2={6:0}, m={3:0}, pthread_create(&id1, ((void *)0), t1, &queue)=-2, queue={5:0}, stored_elements={4:0}] [L1063] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={7:0}, id2={6:0}, m={3:0}, pthread_create(&id2, ((void *)0), t2, &queue)=-1, queue={5:0}, stored_elements={4:0}] [L1036] 2 int i; [L1037] 2 i=0 [L1007] 2 int value, i; [L1009] 2 value = __VERIFIER_nondet_int() [L1010] CALL 2 enqueue(&queue,value) [L980] EXPR 2 q->tail [L980] 2 q->element[q->tail] = x [L981] EXPR 1 q->amount VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, q->amount=0, queue={5:0}, stored_elements={4:0}, x=0] [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (800)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L990] 1 return 0; [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) [L1013] 1 stored_elements[0]=value [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head [L960] EXPR 1 q->tail [L960] COND FALSE 1 !(q->head == q->tail) [L966] 1 return 0; [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) [L1018] 1 i=0 [L1037] COND TRUE 1 i<(800) [L1040] COND FALSE 1 !(\read(dequeue_flag)) [L1037] 1 i++ VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1018] COND TRUE 1 i<((800)-1) [L1021] COND TRUE 1 \read(enqueue_flag) [L1023] 1 value = __VERIFIER_nondet_int() [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, q->tail=1, queue={5:0}, stored_elements={4:0}, x=1] [L981] EXPR 1 q->amount VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, q->amount=1, queue={5:0}, stored_elements={4:0}, x=1] [L981] 1 q->amount++ VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, q->amount=1, q->amount++=1, queue={5:0}, stored_elements={4:0}, x=1] [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (800)) VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, q->tail=1, queue={5:0}, stored_elements={4:0}, x=1] [L988] EXPR 1 q->tail VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, q->tail=1, queue={5:0}, stored_elements={4:0}, x=1] [L988] 1 q->tail++ [L990] 1 return 0; [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value [L1026] 1 enqueue_flag=(0) [L1027] 1 dequeue_flag=(1) [L1018] 1 i++ VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}, value=1] [L1037] COND TRUE 2 i<(800) [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; [L995] EXPR 2 q->head [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] [L996] EXPR 2 q->amount [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (800)) [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q={5:0}, q={5:0}, q->head=0, queue={5:0}, stored_elements={4:0}, x=0] [L1002] 2 q->head++ [L1003] 2 return x; VAL [\result=0, dequeue_flag=1, enqueue_flag=0, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] - UnprovableResult [Line: 1059]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 403 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 65.0s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 31.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1369 SdHoareTripleChecker+Valid, 20.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1369 mSDsluCounter, 132 SdHoareTripleChecker+Invalid, 19.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 615 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9567 IncrementalHoareTripleChecker+Invalid, 10182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 615 mSolverCounterUnsat, 35 mSDtfsCounter, 9567 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1848occurred in iteration=20, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 321 ConstructedInterpolants, 0 QuantifiedInterpolants, 17284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:04:33,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...