/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/triangular-longer-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:06:10,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:06:10,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:06:11,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:06:11,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:06:11,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:06:11,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:06:11,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:06:11,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:06:11,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:06:11,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:06:11,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:06:11,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:06:11,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:06:11,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:06:11,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:06:11,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:06:11,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:06:11,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:06:11,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:06:11,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:06:11,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:06:11,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:06:11,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:06:11,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:06:11,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:06:11,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:06:11,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:06:11,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:06:11,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:06:11,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:06:11,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:06:11,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:06:11,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:06:11,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:06:11,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:06:11,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:06:11,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:06:11,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:06:11,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:06:11,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:06:11,083 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:06:11,106 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:06:11,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:06:11,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:06:11,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:06:11,108 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:06:11,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:06:11,108 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:06:11,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:06:11,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:06:11,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:06:11,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:06:11,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:06:11,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:06:11,109 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:06:11,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:06:11,109 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:06:11,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:06:11,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:06:11,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:06:11,109 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:06:11,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:06:11,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:06:11,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:06:11,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:06:11,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:06:11,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:06:11,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:06:11,110 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:06:11,111 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:06:11,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:06:11,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:06:11,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:06:11,398 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:06:11,399 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:06:11,400 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-1.i [2022-12-06 04:06:12,368 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:06:12,564 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:06:12,564 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-1.i [2022-12-06 04:06:12,574 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18912b968/d6c447adf8774d398704b7625baaa327/FLAGbb164cbe9 [2022-12-06 04:06:12,589 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18912b968/d6c447adf8774d398704b7625baaa327 [2022-12-06 04:06:12,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:06:12,592 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:06:12,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:06:12,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:06:12,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:06:12,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:06:12" (1/1) ... [2022-12-06 04:06:12,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c57fb01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:12, skipping insertion in model container [2022-12-06 04:06:12,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:06:12" (1/1) ... [2022-12-06 04:06:12,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:06:12,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:06:12,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:12,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:12,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:12,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:12,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:12,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:12,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:12,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:12,905 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/triangular-longer-1.i[30961,30974] [2022-12-06 04:06:12,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:06:12,913 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:06:12,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:12,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:12,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:12,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:12,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:12,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:12,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:12,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:12,954 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/triangular-longer-1.i[30961,30974] [2022-12-06 04:06:12,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:06:12,988 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:06:12,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:12 WrapperNode [2022-12-06 04:06:12,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:06:12,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:06:12,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:06:12,990 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:06:12,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:12" (1/1) ... [2022-12-06 04:06:13,020 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:06:12" (1/1) ... [2022-12-06 04:06:13,032 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-12-06 04:06:13,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:06:13,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:06:13,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:06:13,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:06:13,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:12" (1/1) ... [2022-12-06 04:06:13,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:12" (1/1) ... [2022-12-06 04:06:13,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:12" (1/1) ... [2022-12-06 04:06:13,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:12" (1/1) ... [2022-12-06 04:06:13,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:12" (1/1) ... [2022-12-06 04:06:13,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:12" (1/1) ... [2022-12-06 04:06:13,059 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:12" (1/1) ... [2022-12-06 04:06:13,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:12" (1/1) ... [2022-12-06 04:06:13,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:06:13,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:06:13,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:06:13,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:06:13,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:12" (1/1) ... [2022-12-06 04:06:13,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:06:13,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:13,090 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:06:13,107 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:06:13,122 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 04:06:13,122 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 04:06:13,122 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 04:06:13,123 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 04:06:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:06:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:06:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:06:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:06:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:06:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:06:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:06:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:06:13,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:06:13,125 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:06:13,213 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:06:13,214 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:06:13,355 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:06:13,359 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:06:13,359 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 04:06:13,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:06:13 BoogieIcfgContainer [2022-12-06 04:06:13,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:06:13,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:06:13,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:06:13,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:06:13,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:06:12" (1/3) ... [2022-12-06 04:06:13,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6b30c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:06:13, skipping insertion in model container [2022-12-06 04:06:13,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:12" (2/3) ... [2022-12-06 04:06:13,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6b30c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:06:13, skipping insertion in model container [2022-12-06 04:06:13,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:06:13" (3/3) ... [2022-12-06 04:06:13,369 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longer-1.i [2022-12-06 04:06:13,381 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:06:13,382 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:06:13,382 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:06:13,425 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:06:13,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 66 transitions, 142 flow [2022-12-06 04:06:13,516 INFO L130 PetriNetUnfolder]: 5/64 cut-off events. [2022-12-06 04:06:13,516 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:13,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 64 events. 5/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-06 04:06:13,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 66 transitions, 142 flow [2022-12-06 04:06:13,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 64 transitions, 134 flow [2022-12-06 04:06:13,526 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:13,545 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 64 transitions, 134 flow [2022-12-06 04:06:13,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 64 transitions, 134 flow [2022-12-06 04:06:13,572 INFO L130 PetriNetUnfolder]: 5/64 cut-off events. [2022-12-06 04:06:13,573 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:13,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 64 events. 5/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-06 04:06:13,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 64 transitions, 134 flow [2022-12-06 04:06:13,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 1078 [2022-12-06 04:06:15,467 INFO L203 LiptonReduction]: Total number of compositions: 51 [2022-12-06 04:06:15,481 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:06:15,486 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;@22b745fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:06:15,486 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 04:06:15,488 INFO L130 PetriNetUnfolder]: 2/11 cut-off events. [2022-12-06 04:06:15,489 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:15,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:15,489 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 04:06:15,489 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:15,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:15,492 INFO L85 PathProgramCache]: Analyzing trace with hash -977143138, now seen corresponding path program 1 times [2022-12-06 04:06:15,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:15,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603566344] [2022-12-06 04:06:15,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:15,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:15,779 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:06:15,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:15,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603566344] [2022-12-06 04:06:15,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603566344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:15,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:15,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:06:15,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013299349] [2022-12-06 04:06:15,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:15,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:06:15,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:15,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:06:15,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:06:15,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 04:06:15,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 32 flow. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:06:15,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:15,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 04:06:15,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:15,873 INFO L130 PetriNetUnfolder]: 94/152 cut-off events. [2022-12-06 04:06:15,873 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:06:15,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 152 events. 94/152 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 395 event pairs, 11 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 306. Up to 76 conditions per place. [2022-12-06 04:06:15,875 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 18 selfloop transitions, 4 changer transitions 4/26 dead transitions. [2022-12-06 04:06:15,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 26 transitions, 110 flow [2022-12-06 04:06:15,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:06:15,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:06:15,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-06 04:06:15,882 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2022-12-06 04:06:15,883 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 32 flow. Second operand 4 states and 27 transitions. [2022-12-06 04:06:15,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 26 transitions, 110 flow [2022-12-06 04:06:15,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:06:15,886 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 53 flow [2022-12-06 04:06:15,887 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=53, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2022-12-06 04:06:15,890 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2022-12-06 04:06:15,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:15,890 INFO L89 Accepts]: Start accepts. Operand has 21 places, 15 transitions, 53 flow [2022-12-06 04:06:15,892 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:15,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:15,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 15 transitions, 53 flow [2022-12-06 04:06:15,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 15 transitions, 53 flow [2022-12-06 04:06:15,896 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-06 04:06:15,896 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:06:15,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 18 events. 4/18 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 28. Up to 5 conditions per place. [2022-12-06 04:06:15,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 15 transitions, 53 flow [2022-12-06 04:06:15,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 04:06:15,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 26 v_~i~0_26) 1 0)) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-06 04:06:15,924 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:15,925 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 04:06:15,925 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 14 transitions, 51 flow [2022-12-06 04:06:15,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:06:15,925 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:15,925 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:15,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:06:15,925 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:15,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:15,926 INFO L85 PathProgramCache]: Analyzing trace with hash -226702759, now seen corresponding path program 1 times [2022-12-06 04:06:15,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:15,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361205060] [2022-12-06 04:06:15,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:15,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:16,018 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:06:16,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:16,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361205060] [2022-12-06 04:06:16,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361205060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:16,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:16,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:06:16,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060631677] [2022-12-06 04:06:16,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:16,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:06:16,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:16,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:06:16,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:06:16,020 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 04:06:16,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 14 transitions, 51 flow. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:06:16,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:16,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 04:06:16,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:16,079 INFO L130 PetriNetUnfolder]: 91/157 cut-off events. [2022-12-06 04:06:16,079 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-06 04:06:16,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 157 events. 91/157 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 450 event pairs, 32 based on Foata normal form. 10/141 useless extension candidates. Maximal degree in co-relation 390. Up to 69 conditions per place. [2022-12-06 04:06:16,080 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 26 selfloop transitions, 5 changer transitions 3/34 dead transitions. [2022-12-06 04:06:16,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 34 transitions, 181 flow [2022-12-06 04:06:16,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:06:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:06:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-06 04:06:16,081 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5230769230769231 [2022-12-06 04:06:16,081 INFO L175 Difference]: Start difference. First operand has 19 places, 14 transitions, 51 flow. Second operand 5 states and 34 transitions. [2022-12-06 04:06:16,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 34 transitions, 181 flow [2022-12-06 04:06:16,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 34 transitions, 173 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 04:06:16,083 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 91 flow [2022-12-06 04:06:16,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2022-12-06 04:06:16,083 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 04:06:16,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:16,083 INFO L89 Accepts]: Start accepts. Operand has 25 places, 18 transitions, 91 flow [2022-12-06 04:06:16,084 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:16,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:16,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 18 transitions, 91 flow [2022-12-06 04:06:16,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 18 transitions, 91 flow [2022-12-06 04:06:16,087 INFO L130 PetriNetUnfolder]: 11/32 cut-off events. [2022-12-06 04:06:16,087 INFO L131 PetriNetUnfolder]: For 18/19 co-relation queries the response was YES. [2022-12-06 04:06:16,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 32 events. 11/32 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 75. Up to 10 conditions per place. [2022-12-06 04:06:16,088 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 18 transitions, 91 flow [2022-12-06 04:06:16,088 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-06 04:06:16,091 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:16,092 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 04:06:16,092 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 91 flow [2022-12-06 04:06:16,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:06:16,092 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:16,092 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:16,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:06:16,092 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:16,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1562125437, now seen corresponding path program 1 times [2022-12-06 04:06:16,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:16,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877351985] [2022-12-06 04:06:16,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:16,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:16,176 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:06:16,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:16,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877351985] [2022-12-06 04:06:16,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877351985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:16,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:16,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:06:16,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638606002] [2022-12-06 04:06:16,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:16,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:06:16,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:16,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:06:16,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:06:16,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 04:06:16,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 91 flow. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:06:16,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:16,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 04:06:16,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:16,273 INFO L130 PetriNetUnfolder]: 91/159 cut-off events. [2022-12-06 04:06:16,274 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 04:06:16,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 159 events. 91/159 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 16 based on Foata normal form. 10/169 useless extension candidates. Maximal degree in co-relation 479. Up to 66 conditions per place. [2022-12-06 04:06:16,277 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 24 selfloop transitions, 12 changer transitions 8/44 dead transitions. [2022-12-06 04:06:16,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 44 transitions, 270 flow [2022-12-06 04:06:16,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:06:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:06:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-12-06 04:06:16,278 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4725274725274725 [2022-12-06 04:06:16,278 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 91 flow. Second operand 7 states and 43 transitions. [2022-12-06 04:06:16,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 44 transitions, 270 flow [2022-12-06 04:06:16,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 44 transitions, 263 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 04:06:16,280 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 171 flow [2022-12-06 04:06:16,280 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2022-12-06 04:06:16,281 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 16 predicate places. [2022-12-06 04:06:16,281 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:16,281 INFO L89 Accepts]: Start accepts. Operand has 34 places, 25 transitions, 171 flow [2022-12-06 04:06:16,281 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:16,281 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:16,282 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 171 flow [2022-12-06 04:06:16,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 171 flow [2022-12-06 04:06:16,285 INFO L130 PetriNetUnfolder]: 16/42 cut-off events. [2022-12-06 04:06:16,285 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-06 04:06:16,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 42 events. 16/42 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 88 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 126. Up to 13 conditions per place. [2022-12-06 04:06:16,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 171 flow [2022-12-06 04:06:16,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 04:06:16,299 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:16,300 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 04:06:16,300 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 163 flow [2022-12-06 04:06:16,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:06:16,300 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:16,300 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:16,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:06:16,300 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:16,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:16,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1436153506, now seen corresponding path program 1 times [2022-12-06 04:06:16,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:16,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022136247] [2022-12-06 04:06:16,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:16,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:16,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:06:16,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:16,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022136247] [2022-12-06 04:06:16,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022136247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:16,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:16,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:06:16,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159847718] [2022-12-06 04:06:16,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:16,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:06:16,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:16,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:06:16,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:06:16,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 04:06:16,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 163 flow. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:06:16,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:16,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 04:06:16,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:16,437 INFO L130 PetriNetUnfolder]: 115/203 cut-off events. [2022-12-06 04:06:16,437 INFO L131 PetriNetUnfolder]: For 453/453 co-relation queries the response was YES. [2022-12-06 04:06:16,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 203 events. 115/203 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 621 event pairs, 28 based on Foata normal form. 8/211 useless extension candidates. Maximal degree in co-relation 728. Up to 63 conditions per place. [2022-12-06 04:06:16,440 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 27 selfloop transitions, 12 changer transitions 4/43 dead transitions. [2022-12-06 04:06:16,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 339 flow [2022-12-06 04:06:16,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:06:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:06:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-12-06 04:06:16,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2022-12-06 04:06:16,442 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 163 flow. Second operand 6 states and 35 transitions. [2022-12-06 04:06:16,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 339 flow [2022-12-06 04:06:16,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 331 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-06 04:06:16,448 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 224 flow [2022-12-06 04:06:16,448 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-12-06 04:06:16,449 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 24 predicate places. [2022-12-06 04:06:16,449 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:16,449 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 224 flow [2022-12-06 04:06:16,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:16,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:16,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 224 flow [2022-12-06 04:06:16,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 27 transitions, 224 flow [2022-12-06 04:06:16,456 INFO L130 PetriNetUnfolder]: 19/53 cut-off events. [2022-12-06 04:06:16,456 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2022-12-06 04:06:16,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 53 events. 19/53 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 205. Up to 16 conditions per place. [2022-12-06 04:06:16,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 27 transitions, 224 flow [2022-12-06 04:06:16,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-06 04:06:16,461 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:16,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 04:06:16,464 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 224 flow [2022-12-06 04:06:16,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:06:16,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:16,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:16,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:06:16,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:16,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:16,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1617536060, now seen corresponding path program 1 times [2022-12-06 04:06:16,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:16,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827951102] [2022-12-06 04:06:16,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:16,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:16,549 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:06:16,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:16,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827951102] [2022-12-06 04:06:16,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827951102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:16,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:16,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:16,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628272013] [2022-12-06 04:06:16,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:16,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:06:16,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:16,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:06:16,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:06:16,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 04:06:16,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 224 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:06:16,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:16,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 04:06:16,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:16,611 INFO L130 PetriNetUnfolder]: 111/199 cut-off events. [2022-12-06 04:06:16,612 INFO L131 PetriNetUnfolder]: For 765/765 co-relation queries the response was YES. [2022-12-06 04:06:16,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 199 events. 111/199 cut-off events. For 765/765 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 626 event pairs, 18 based on Foata normal form. 8/207 useless extension candidates. Maximal degree in co-relation 807. Up to 53 conditions per place. [2022-12-06 04:06:16,613 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 21 selfloop transitions, 17 changer transitions 6/44 dead transitions. [2022-12-06 04:06:16,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 403 flow [2022-12-06 04:06:16,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:06:16,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:06:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-12-06 04:06:16,614 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2022-12-06 04:06:16,614 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 224 flow. Second operand 6 states and 34 transitions. [2022-12-06 04:06:16,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 403 flow [2022-12-06 04:06:16,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 369 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 04:06:16,616 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 285 flow [2022-12-06 04:06:16,617 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2022-12-06 04:06:16,617 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 30 predicate places. [2022-12-06 04:06:16,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:16,617 INFO L89 Accepts]: Start accepts. Operand has 48 places, 30 transitions, 285 flow [2022-12-06 04:06:16,618 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:16,618 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:16,618 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 30 transitions, 285 flow [2022-12-06 04:06:16,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 30 transitions, 285 flow [2022-12-06 04:06:16,622 INFO L130 PetriNetUnfolder]: 19/54 cut-off events. [2022-12-06 04:06:16,622 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2022-12-06 04:06:16,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 54 events. 19/54 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 217. Up to 16 conditions per place. [2022-12-06 04:06:16,623 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 30 transitions, 285 flow [2022-12-06 04:06:16,623 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 04:06:16,623 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:16,624 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 04:06:16,624 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 285 flow [2022-12-06 04:06:16,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:06:16,624 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:16,624 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:16,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:06:16,625 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:16,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:16,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1571201197, now seen corresponding path program 1 times [2022-12-06 04:06:16,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:16,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690275913] [2022-12-06 04:06:16,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:16,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:16,691 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:06:16,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:16,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690275913] [2022-12-06 04:06:16,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690275913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:16,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:16,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:16,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247749623] [2022-12-06 04:06:16,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:16,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:06:16,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:16,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:06:16,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:06:16,693 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 04:06:16,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 285 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:06:16,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:16,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 04:06:16,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:16,770 INFO L130 PetriNetUnfolder]: 129/235 cut-off events. [2022-12-06 04:06:16,771 INFO L131 PetriNetUnfolder]: For 1059/1059 co-relation queries the response was YES. [2022-12-06 04:06:16,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 235 events. 129/235 cut-off events. For 1059/1059 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 806 event pairs, 34 based on Foata normal form. 8/243 useless extension candidates. Maximal degree in co-relation 1012. Up to 126 conditions per place. [2022-12-06 04:06:16,772 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 33 selfloop transitions, 13 changer transitions 11/57 dead transitions. [2022-12-06 04:06:16,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 549 flow [2022-12-06 04:06:16,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:06:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:06:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-12-06 04:06:16,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2022-12-06 04:06:16,773 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 285 flow. Second operand 8 states and 46 transitions. [2022-12-06 04:06:16,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 549 flow [2022-12-06 04:06:16,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 57 transitions, 485 flow, removed 23 selfloop flow, removed 3 redundant places. [2022-12-06 04:06:16,777 INFO L231 Difference]: Finished difference. Result has 56 places, 35 transitions, 345 flow [2022-12-06 04:06:16,777 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=345, PETRI_PLACES=56, PETRI_TRANSITIONS=35} [2022-12-06 04:06:16,779 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 38 predicate places. [2022-12-06 04:06:16,779 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:16,779 INFO L89 Accepts]: Start accepts. Operand has 56 places, 35 transitions, 345 flow [2022-12-06 04:06:16,780 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:16,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:16,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 35 transitions, 345 flow [2022-12-06 04:06:16,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 35 transitions, 345 flow [2022-12-06 04:06:16,785 INFO L130 PetriNetUnfolder]: 23/65 cut-off events. [2022-12-06 04:06:16,785 INFO L131 PetriNetUnfolder]: For 226/226 co-relation queries the response was YES. [2022-12-06 04:06:16,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 65 events. 23/65 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 185 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 265. Up to 20 conditions per place. [2022-12-06 04:06:16,786 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 35 transitions, 345 flow [2022-12-06 04:06:16,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 04:06:16,795 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 26 v_~i~0_26) 1 0)) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-06 04:06:16,815 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 26 v_~i~0_26) 1 0)) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-06 04:06:16,834 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:16,835 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 04:06:16,835 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 35 transitions, 359 flow [2022-12-06 04:06:16,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:06:16,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:16,835 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:16,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:06:16,836 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:16,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:16,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1458297736, now seen corresponding path program 2 times [2022-12-06 04:06:16,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:16,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151723409] [2022-12-06 04:06:16,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:16,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:16,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:16,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151723409] [2022-12-06 04:06:16,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151723409] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:16,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960282867] [2022-12-06 04:06:16,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 04:06:16,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:16,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:16,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:06:16,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 04:06:16,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 04:06:16,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:06:17,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 04:06:17,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:17,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:06:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:17,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960282867] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:06:17,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:06:17,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 04:06:17,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189906693] [2022-12-06 04:06:17,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:06:17,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 04:06:17,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:17,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 04:06:17,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-12-06 04:06:17,165 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 04:06:17,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 35 transitions, 359 flow. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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:06:17,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:17,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 04:06:17,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:17,345 INFO L130 PetriNetUnfolder]: 185/331 cut-off events. [2022-12-06 04:06:17,346 INFO L131 PetriNetUnfolder]: For 1491/1491 co-relation queries the response was YES. [2022-12-06 04:06:17,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 331 events. 185/331 cut-off events. For 1491/1491 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1163 event pairs, 20 based on Foata normal form. 16/347 useless extension candidates. Maximal degree in co-relation 1450. Up to 79 conditions per place. [2022-12-06 04:06:17,348 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 28 selfloop transitions, 35 changer transitions 21/84 dead transitions. [2022-12-06 04:06:17,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 84 transitions, 840 flow [2022-12-06 04:06:17,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 04:06:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 04:06:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 70 transitions. [2022-12-06 04:06:17,350 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.358974358974359 [2022-12-06 04:06:17,350 INFO L175 Difference]: Start difference. First operand has 56 places, 35 transitions, 359 flow. Second operand 13 states and 70 transitions. [2022-12-06 04:06:17,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 84 transitions, 840 flow [2022-12-06 04:06:17,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 794 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-06 04:06:17,356 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 629 flow [2022-12-06 04:06:17,356 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=629, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2022-12-06 04:06:17,356 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 52 predicate places. [2022-12-06 04:06:17,356 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:17,356 INFO L89 Accepts]: Start accepts. Operand has 70 places, 52 transitions, 629 flow [2022-12-06 04:06:17,358 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:17,358 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:17,358 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 52 transitions, 629 flow [2022-12-06 04:06:17,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 52 transitions, 629 flow [2022-12-06 04:06:17,368 INFO L130 PetriNetUnfolder]: 36/97 cut-off events. [2022-12-06 04:06:17,368 INFO L131 PetriNetUnfolder]: For 493/493 co-relation queries the response was YES. [2022-12-06 04:06:17,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 97 events. 36/97 cut-off events. For 493/493 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 297 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 474. Up to 33 conditions per place. [2022-12-06 04:06:17,369 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 52 transitions, 629 flow [2022-12-06 04:06:17,369 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 04:06:17,383 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:17,384 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 04:06:17,384 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 595 flow [2022-12-06 04:06:17,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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:06:17,384 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:17,384 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:17,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 04:06:17,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:17,591 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:17,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:17,591 INFO L85 PathProgramCache]: Analyzing trace with hash 531828353, now seen corresponding path program 1 times [2022-12-06 04:06:17,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:17,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016142499] [2022-12-06 04:06:17,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:17,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:17,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:17,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016142499] [2022-12-06 04:06:17,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016142499] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:17,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269984879] [2022-12-06 04:06:17,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:17,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:17,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:17,695 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:06:17,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 04:06:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:17,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 04:06:17,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:17,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:06:17,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:17,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269984879] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:06:17,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:06:17,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 04:06:17,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669546788] [2022-12-06 04:06:17,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:06:17,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 04:06:17,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:17,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 04:06:17,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-06 04:06:17,877 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 04:06:17,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 595 flow. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 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:06:17,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:17,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 04:06:17,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:18,195 INFO L130 PetriNetUnfolder]: 238/450 cut-off events. [2022-12-06 04:06:18,195 INFO L131 PetriNetUnfolder]: For 3575/3575 co-relation queries the response was YES. [2022-12-06 04:06:18,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 450 events. 238/450 cut-off events. For 3575/3575 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1731 event pairs, 40 based on Foata normal form. 32/482 useless extension candidates. Maximal degree in co-relation 2247. Up to 155 conditions per place. [2022-12-06 04:06:18,198 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 56 selfloop transitions, 37 changer transitions 32/125 dead transitions. [2022-12-06 04:06:18,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 1450 flow [2022-12-06 04:06:18,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 04:06:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 04:06:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 97 transitions. [2022-12-06 04:06:18,199 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34035087719298246 [2022-12-06 04:06:18,200 INFO L175 Difference]: Start difference. First operand has 69 places, 49 transitions, 595 flow. Second operand 19 states and 97 transitions. [2022-12-06 04:06:18,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 1450 flow [2022-12-06 04:06:18,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 125 transitions, 1101 flow, removed 156 selfloop flow, removed 7 redundant places. [2022-12-06 04:06:18,211 INFO L231 Difference]: Finished difference. Result has 92 places, 67 transitions, 764 flow [2022-12-06 04:06:18,211 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=764, PETRI_PLACES=92, PETRI_TRANSITIONS=67} [2022-12-06 04:06:18,213 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 74 predicate places. [2022-12-06 04:06:18,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:18,213 INFO L89 Accepts]: Start accepts. Operand has 92 places, 67 transitions, 764 flow [2022-12-06 04:06:18,214 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:18,214 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:18,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 67 transitions, 764 flow [2022-12-06 04:06:18,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 67 transitions, 764 flow [2022-12-06 04:06:18,228 INFO L130 PetriNetUnfolder]: 51/148 cut-off events. [2022-12-06 04:06:18,228 INFO L131 PetriNetUnfolder]: For 1363/1363 co-relation queries the response was YES. [2022-12-06 04:06:18,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 148 events. 51/148 cut-off events. For 1363/1363 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 520 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 769. Up to 51 conditions per place. [2022-12-06 04:06:18,230 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 67 transitions, 764 flow [2022-12-06 04:06:18,230 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 04:06:18,232 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:18,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 04:06:18,234 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 67 transitions, 764 flow [2022-12-06 04:06:18,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 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:06:18,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:18,234 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:18,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 04:06:18,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-06 04:06:18,441 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:18,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:18,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1259191637, now seen corresponding path program 2 times [2022-12-06 04:06:18,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:18,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052319890] [2022-12-06 04:06:18,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:18,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:18,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:18,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052319890] [2022-12-06 04:06:18,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052319890] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:18,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466142197] [2022-12-06 04:06:18,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 04:06:18,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:18,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:18,532 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:06:18,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 04:06:18,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 04:06:18,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:06:18,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 04:06:18,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:18,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:06:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:18,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466142197] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:06:18,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:06:18,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-06 04:06:18,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221879405] [2022-12-06 04:06:18,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:06:18,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 04:06:18,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:18,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 04:06:18,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-12-06 04:06:18,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 04:06:18,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 67 transitions, 764 flow. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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:06:18,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:18,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 04:06:18,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:19,027 INFO L130 PetriNetUnfolder]: 362/698 cut-off events. [2022-12-06 04:06:19,027 INFO L131 PetriNetUnfolder]: For 10721/10721 co-relation queries the response was YES. [2022-12-06 04:06:19,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3832 conditions, 698 events. 362/698 cut-off events. For 10721/10721 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3158 event pairs, 37 based on Foata normal form. 32/730 useless extension candidates. Maximal degree in co-relation 3786. Up to 175 conditions per place. [2022-12-06 04:06:19,030 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 48 selfloop transitions, 73 changer transitions 35/156 dead transitions. [2022-12-06 04:06:19,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 156 transitions, 1957 flow [2022-12-06 04:06:19,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 04:06:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 04:06:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2022-12-06 04:06:19,032 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33 [2022-12-06 04:06:19,032 INFO L175 Difference]: Start difference. First operand has 92 places, 67 transitions, 764 flow. Second operand 20 states and 99 transitions. [2022-12-06 04:06:19,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 156 transitions, 1957 flow [2022-12-06 04:06:19,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 156 transitions, 1769 flow, removed 82 selfloop flow, removed 6 redundant places. [2022-12-06 04:06:19,052 INFO L231 Difference]: Finished difference. Result has 117 places, 99 transitions, 1347 flow [2022-12-06 04:06:19,052 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1347, PETRI_PLACES=117, PETRI_TRANSITIONS=99} [2022-12-06 04:06:19,053 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 99 predicate places. [2022-12-06 04:06:19,053 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:19,053 INFO L89 Accepts]: Start accepts. Operand has 117 places, 99 transitions, 1347 flow [2022-12-06 04:06:19,055 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:19,055 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:19,055 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 99 transitions, 1347 flow [2022-12-06 04:06:19,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 99 transitions, 1347 flow [2022-12-06 04:06:19,092 INFO L130 PetriNetUnfolder]: 84/242 cut-off events. [2022-12-06 04:06:19,093 INFO L131 PetriNetUnfolder]: For 5515/5515 co-relation queries the response was YES. [2022-12-06 04:06:19,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 242 events. 84/242 cut-off events. For 5515/5515 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1043 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 1686. Up to 82 conditions per place. [2022-12-06 04:06:19,095 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 99 transitions, 1347 flow [2022-12-06 04:06:19,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 04:06:19,099 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 26 v_~i~0_26) 1 0)) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-06 04:06:19,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 26 v_~i~0_26) 1 0)) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-06 04:06:19,154 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:06:19,155 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 04:06:19,155 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 98 transitions, 1349 flow [2022-12-06 04:06:19,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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:06:19,155 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:19,155 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:19,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 04:06:19,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:19,360 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:19,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:19,360 INFO L85 PathProgramCache]: Analyzing trace with hash -835740951, now seen corresponding path program 3 times [2022-12-06 04:06:19,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:19,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443360042] [2022-12-06 04:06:19,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:19,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:19,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:19,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443360042] [2022-12-06 04:06:19,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443360042] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:19,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841239178] [2022-12-06 04:06:19,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 04:06:19,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:19,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:19,444 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:06:19,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 04:06:19,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 04:06:19,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:06:19,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 04:06:19,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:19,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:06:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:19,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841239178] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:06:19,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:06:19,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-06 04:06:19,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764168378] [2022-12-06 04:06:19,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:06:19,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 04:06:19,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:19,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 04:06:19,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-12-06 04:06:19,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:06:19,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 98 transitions, 1349 flow. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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:06:19,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:19,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:06:19,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:20,134 INFO L130 PetriNetUnfolder]: 582/1110 cut-off events. [2022-12-06 04:06:20,134 INFO L131 PetriNetUnfolder]: For 33102/33102 co-relation queries the response was YES. [2022-12-06 04:06:20,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7687 conditions, 1110 events. 582/1110 cut-off events. For 33102/33102 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5718 event pairs, 34 based on Foata normal form. 32/1142 useless extension candidates. Maximal degree in co-relation 7629. Up to 273 conditions per place. [2022-12-06 04:06:20,141 INFO L137 encePairwiseOnDemand]: 7/17 looper letters, 61 selfloop transitions, 100 changer transitions 65/226 dead transitions. [2022-12-06 04:06:20,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 226 transitions, 3428 flow [2022-12-06 04:06:20,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 04:06:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 04:06:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 129 transitions. [2022-12-06 04:06:20,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3035294117647059 [2022-12-06 04:06:20,143 INFO L175 Difference]: Start difference. First operand has 117 places, 98 transitions, 1349 flow. Second operand 25 states and 129 transitions. [2022-12-06 04:06:20,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 226 transitions, 3428 flow [2022-12-06 04:06:20,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 226 transitions, 3033 flow, removed 168 selfloop flow, removed 8 redundant places. [2022-12-06 04:06:20,240 INFO L231 Difference]: Finished difference. Result has 147 places, 122 transitions, 1980 flow [2022-12-06 04:06:20,240 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1980, PETRI_PLACES=147, PETRI_TRANSITIONS=122} [2022-12-06 04:06:20,240 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 129 predicate places. [2022-12-06 04:06:20,240 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:20,240 INFO L89 Accepts]: Start accepts. Operand has 147 places, 122 transitions, 1980 flow [2022-12-06 04:06:20,244 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:20,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:20,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 122 transitions, 1980 flow [2022-12-06 04:06:20,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 122 transitions, 1980 flow [2022-12-06 04:06:20,270 INFO L130 PetriNetUnfolder]: 106/296 cut-off events. [2022-12-06 04:06:20,270 INFO L131 PetriNetUnfolder]: For 14614/14614 co-relation queries the response was YES. [2022-12-06 04:06:20,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2818 conditions, 296 events. 106/296 cut-off events. For 14614/14614 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1379 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 2751. Up to 97 conditions per place. [2022-12-06 04:06:20,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 122 transitions, 1980 flow [2022-12-06 04:06:20,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-06 04:06:20,284 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:20,285 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 04:06:20,285 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 120 transitions, 1961 flow [2022-12-06 04:06:20,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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:06:20,285 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:20,285 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:20,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 04:06:20,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:20,490 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:20,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:20,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1685771555, now seen corresponding path program 4 times [2022-12-06 04:06:20,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:20,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731186611] [2022-12-06 04:06:20,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:20,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 04:06:20,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:20,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731186611] [2022-12-06 04:06:20,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731186611] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:20,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209588262] [2022-12-06 04:06:20,579 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 04:06:20,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:20,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:20,580 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:06:20,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 04:06:20,634 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 04:06:20,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:06:20,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 04:06:20,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 04:06:20,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:06:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 04:06:20,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209588262] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:06:20,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:06:20,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-12-06 04:06:20,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924683150] [2022-12-06 04:06:20,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:06:20,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 04:06:20,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:20,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 04:06:20,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-12-06 04:06:20,769 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 04:06:20,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 120 transitions, 1961 flow. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 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:06:20,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:20,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 04:06:20,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:21,430 INFO L130 PetriNetUnfolder]: 852/1584 cut-off events. [2022-12-06 04:06:21,431 INFO L131 PetriNetUnfolder]: For 85506/85506 co-relation queries the response was YES. [2022-12-06 04:06:21,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14726 conditions, 1584 events. 852/1584 cut-off events. For 85506/85506 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8341 event pairs, 37 based on Foata normal form. 32/1616 useless extension candidates. Maximal degree in co-relation 14656. Up to 373 conditions per place. [2022-12-06 04:06:21,442 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 58 selfloop transitions, 151 changer transitions 80/289 dead transitions. [2022-12-06 04:06:21,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 289 transitions, 6028 flow [2022-12-06 04:06:21,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 04:06:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 04:06:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 143 transitions. [2022-12-06 04:06:21,446 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32873563218390806 [2022-12-06 04:06:21,446 INFO L175 Difference]: Start difference. First operand has 147 places, 120 transitions, 1961 flow. Second operand 29 states and 143 transitions. [2022-12-06 04:06:21,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 289 transitions, 6028 flow [2022-12-06 04:06:21,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 289 transitions, 4503 flow, removed 710 selfloop flow, removed 25 redundant places. [2022-12-06 04:06:21,557 INFO L231 Difference]: Finished difference. Result has 161 places, 186 transitions, 3261 flow [2022-12-06 04:06:21,558 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3261, PETRI_PLACES=161, PETRI_TRANSITIONS=186} [2022-12-06 04:06:21,559 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 143 predicate places. [2022-12-06 04:06:21,559 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:21,559 INFO L89 Accepts]: Start accepts. Operand has 161 places, 186 transitions, 3261 flow [2022-12-06 04:06:21,564 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:21,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:21,564 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 186 transitions, 3261 flow [2022-12-06 04:06:21,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 186 transitions, 3261 flow [2022-12-06 04:06:21,606 INFO L130 PetriNetUnfolder]: 160/447 cut-off events. [2022-12-06 04:06:21,606 INFO L131 PetriNetUnfolder]: For 27932/27932 co-relation queries the response was YES. [2022-12-06 04:06:21,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4585 conditions, 447 events. 160/447 cut-off events. For 27932/27932 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2241 event pairs, 0 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 4515. Up to 149 conditions per place. [2022-12-06 04:06:21,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 186 transitions, 3261 flow [2022-12-06 04:06:21,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-06 04:06:21,636 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:21,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 04:06:21,637 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 182 transitions, 3223 flow [2022-12-06 04:06:21,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 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:06:21,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:21,637 INFO L213 CegarLoopForPetriNet]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:21,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 04:06:21,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 04:06:21,843 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:21,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:21,844 INFO L85 PathProgramCache]: Analyzing trace with hash -551833473, now seen corresponding path program 3 times [2022-12-06 04:06:21,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:21,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666206703] [2022-12-06 04:06:21,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:21,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:22,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:22,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666206703] [2022-12-06 04:06:22,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666206703] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:22,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852317896] [2022-12-06 04:06:22,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 04:06:22,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:22,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:22,114 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:06:22,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 04:06:22,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-06 04:06:22,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:06:22,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 04:06:22,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:22,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:06:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:22,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852317896] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:06:22,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:06:22,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 25 [2022-12-06 04:06:22,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464723010] [2022-12-06 04:06:22,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:06:22,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 04:06:22,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:22,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 04:06:22,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2022-12-06 04:06:22,477 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 04:06:22,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 182 transitions, 3223 flow. Second operand has 27 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 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:06:22,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:22,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 04:06:22,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:23,065 INFO L130 PetriNetUnfolder]: 732/1408 cut-off events. [2022-12-06 04:06:23,065 INFO L131 PetriNetUnfolder]: For 102492/102492 co-relation queries the response was YES. [2022-12-06 04:06:23,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13175 conditions, 1408 events. 732/1408 cut-off events. For 102492/102492 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7088 event pairs, 270 based on Foata normal form. 48/1456 useless extension candidates. Maximal degree in co-relation 13102. Up to 1056 conditions per place. [2022-12-06 04:06:23,074 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 138 selfloop transitions, 44 changer transitions 98/280 dead transitions. [2022-12-06 04:06:23,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 280 transitions, 5808 flow [2022-12-06 04:06:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 04:06:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 04:06:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 131 transitions. [2022-12-06 04:06:23,076 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3234567901234568 [2022-12-06 04:06:23,076 INFO L175 Difference]: Start difference. First operand has 161 places, 182 transitions, 3223 flow. Second operand 27 states and 131 transitions. [2022-12-06 04:06:23,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 280 transitions, 5808 flow [2022-12-06 04:06:23,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 280 transitions, 4270 flow, removed 726 selfloop flow, removed 12 redundant places. [2022-12-06 04:06:23,188 INFO L231 Difference]: Finished difference. Result has 187 places, 147 transitions, 2225 flow [2022-12-06 04:06:23,189 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2225, PETRI_PLACES=187, PETRI_TRANSITIONS=147} [2022-12-06 04:06:23,189 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 169 predicate places. [2022-12-06 04:06:23,189 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:23,189 INFO L89 Accepts]: Start accepts. Operand has 187 places, 147 transitions, 2225 flow [2022-12-06 04:06:23,192 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:23,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:23,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 147 transitions, 2225 flow [2022-12-06 04:06:23,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 147 transitions, 2225 flow [2022-12-06 04:06:23,226 INFO L130 PetriNetUnfolder]: 124/368 cut-off events. [2022-12-06 04:06:23,226 INFO L131 PetriNetUnfolder]: For 25042/25042 co-relation queries the response was YES. [2022-12-06 04:06:23,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3398 conditions, 368 events. 124/368 cut-off events. For 25042/25042 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1554 event pairs, 0 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 3319. Up to 123 conditions per place. [2022-12-06 04:06:23,231 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 147 transitions, 2225 flow [2022-12-06 04:06:23,231 INFO L188 LiptonReduction]: Number of co-enabled transitions 340 [2022-12-06 04:06:23,232 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:23,233 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 04:06:23,233 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 147 transitions, 2225 flow [2022-12-06 04:06:23,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 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:06:23,233 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:23,233 INFO L213 CegarLoopForPetriNet]: trace histogram [8, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:23,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 04:06:23,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:23,438 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2113716159, now seen corresponding path program 2 times [2022-12-06 04:06:23,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:23,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861860495] [2022-12-06 04:06:23,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:23,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:23,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:23,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861860495] [2022-12-06 04:06:23,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861860495] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:23,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748834001] [2022-12-06 04:06:23,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 04:06:23,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:23,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:23,652 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:06:23,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 04:06:23,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 04:06:23,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:06:23,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 04:06:23,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:23,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:06:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:24,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748834001] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:06:24,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:06:24,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2022-12-06 04:06:24,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472815908] [2022-12-06 04:06:24,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:06:24,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 04:06:24,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:24,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 04:06:24,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2022-12-06 04:06:24,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 04:06:24,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 147 transitions, 2225 flow. Second operand has 29 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 28 states have internal predecessors, (44), 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:06:24,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:24,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 04:06:24,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:24,674 INFO L130 PetriNetUnfolder]: 572/1124 cut-off events. [2022-12-06 04:06:24,674 INFO L131 PetriNetUnfolder]: For 102882/102882 co-relation queries the response was YES. [2022-12-06 04:06:24,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9825 conditions, 1124 events. 572/1124 cut-off events. For 102882/102882 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5110 event pairs, 110 based on Foata normal form. 48/1172 useless extension candidates. Maximal degree in co-relation 9743. Up to 431 conditions per place. [2022-12-06 04:06:24,684 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 107 selfloop transitions, 86 changer transitions 57/250 dead transitions. [2022-12-06 04:06:24,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 250 transitions, 4644 flow [2022-12-06 04:06:24,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 04:06:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 04:06:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 148 transitions. [2022-12-06 04:06:24,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31827956989247314 [2022-12-06 04:06:24,685 INFO L175 Difference]: Start difference. First operand has 186 places, 147 transitions, 2225 flow. Second operand 31 states and 148 transitions. [2022-12-06 04:06:24,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 250 transitions, 4644 flow [2022-12-06 04:06:24,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 250 transitions, 3970 flow, removed 264 selfloop flow, removed 22 redundant places. [2022-12-06 04:06:24,780 INFO L231 Difference]: Finished difference. Result has 206 places, 159 transitions, 2481 flow [2022-12-06 04:06:24,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=1615, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=2481, PETRI_PLACES=206, PETRI_TRANSITIONS=159} [2022-12-06 04:06:24,781 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 188 predicate places. [2022-12-06 04:06:24,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:24,781 INFO L89 Accepts]: Start accepts. Operand has 206 places, 159 transitions, 2481 flow [2022-12-06 04:06:24,784 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:24,784 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:24,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 159 transitions, 2481 flow [2022-12-06 04:06:24,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 159 transitions, 2481 flow [2022-12-06 04:06:24,834 INFO L130 PetriNetUnfolder]: 136/404 cut-off events. [2022-12-06 04:06:24,834 INFO L131 PetriNetUnfolder]: For 39481/39481 co-relation queries the response was YES. [2022-12-06 04:06:24,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4216 conditions, 404 events. 136/404 cut-off events. For 39481/39481 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1677 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 4130. Up to 135 conditions per place. [2022-12-06 04:06:24,840 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 159 transitions, 2481 flow [2022-12-06 04:06:24,840 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-06 04:06:24,841 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:24,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 04:06:24,842 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 159 transitions, 2481 flow [2022-12-06 04:06:24,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 28 states have internal predecessors, (44), 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:06:24,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:24,842 INFO L213 CegarLoopForPetriNet]: trace histogram [8, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:24,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 04:06:25,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:25,049 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:25,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:25,050 INFO L85 PathProgramCache]: Analyzing trace with hash -48882893, now seen corresponding path program 5 times [2022-12-06 04:06:25,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:25,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790672535] [2022-12-06 04:06:25,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:25,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:25,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:25,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790672535] [2022-12-06 04:06:25,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790672535] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:25,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190782384] [2022-12-06 04:06:25,215 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 04:06:25,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:25,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:25,216 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:06:25,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 04:06:25,276 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-12-06 04:06:25,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:06:25,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 04:06:25,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:25,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:06:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:25,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190782384] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:06:25,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:06:25,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2022-12-06 04:06:25,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189470026] [2022-12-06 04:06:25,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:06:25,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-06 04:06:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:25,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-06 04:06:25,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2022-12-06 04:06:25,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 04:06:25,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 159 transitions, 2481 flow. Second operand has 32 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 31 states have internal predecessors, (47), 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:06:25,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:25,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 04:06:25,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:26,679 INFO L130 PetriNetUnfolder]: 780/1500 cut-off events. [2022-12-06 04:06:26,680 INFO L131 PetriNetUnfolder]: For 183602/183602 co-relation queries the response was YES. [2022-12-06 04:06:26,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14638 conditions, 1500 events. 780/1500 cut-off events. For 183602/183602 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 7127 event pairs, 14 based on Foata normal form. 52/1552 useless extension candidates. Maximal degree in co-relation 14549. Up to 367 conditions per place. [2022-12-06 04:06:26,691 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 90 selfloop transitions, 188 changer transitions 93/371 dead transitions. [2022-12-06 04:06:26,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 371 transitions, 7529 flow [2022-12-06 04:06:26,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-06 04:06:26,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-06 04:06:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 236 transitions. [2022-12-06 04:06:26,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31466666666666665 [2022-12-06 04:06:26,694 INFO L175 Difference]: Start difference. First operand has 206 places, 159 transitions, 2481 flow. Second operand 50 states and 236 transitions. [2022-12-06 04:06:26,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 371 transitions, 7529 flow [2022-12-06 04:06:26,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 371 transitions, 6823 flow, removed 296 selfloop flow, removed 18 redundant places. [2022-12-06 04:06:26,839 INFO L231 Difference]: Finished difference. Result has 263 places, 216 transitions, 4204 flow [2022-12-06 04:06:26,839 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=1821, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=4204, PETRI_PLACES=263, PETRI_TRANSITIONS=216} [2022-12-06 04:06:26,839 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 245 predicate places. [2022-12-06 04:06:26,839 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:26,839 INFO L89 Accepts]: Start accepts. Operand has 263 places, 216 transitions, 4204 flow [2022-12-06 04:06:26,849 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:26,849 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:26,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 263 places, 216 transitions, 4204 flow [2022-12-06 04:06:26,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 216 transitions, 4204 flow [2022-12-06 04:06:26,925 INFO L130 PetriNetUnfolder]: 188/534 cut-off events. [2022-12-06 04:06:26,925 INFO L131 PetriNetUnfolder]: For 103542/103542 co-relation queries the response was YES. [2022-12-06 04:06:26,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7487 conditions, 534 events. 188/534 cut-off events. For 103542/103542 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2463 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 7375. Up to 177 conditions per place. [2022-12-06 04:06:26,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 216 transitions, 4204 flow [2022-12-06 04:06:26,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 498 [2022-12-06 04:06:26,939 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 26 v_~i~0_26) 1 0)) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-06 04:06:26,955 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 26 v_~i~0_26) 1 0)) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-06 04:06:26,986 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [242] L714-4-->L704-5: Formula: (and (= (+ v_t2Thread1of1ForFork1_~k~1_143 1) v_t2Thread1of1ForFork1_~k~1_142) (= (ite (< 26 v_~i~0_203) 1 0) |v_ULTIMATE.start_main_~condI~0#1_111|) (< v_t2Thread1of1ForFork1_~k~1_143 10) (= v_~j~0_187 (+ v_~i~0_203 1))) InVars {~i~0=v_~i~0_203, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_143} OutVars{~j~0=v_~j~0_187, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_90|, ~i~0=v_~i~0_203, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_81|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_97|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_111|, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_142} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1, t2Thread1of1ForFork1_~k~1] and [213] L717-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_~condJ~0#1_19| (ite (< 26 v_~j~0_31) 1 0)) (or (not (= |v_ULTIMATE.start_main_~condI~0#1_21| 0)) (not (= |v_ULTIMATE.start_main_~condJ~0#1_19| 0)))) InVars {~j~0=v_~j~0_31, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_21|} OutVars{~j~0=v_~j~0_31, ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_19|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0#1] [2022-12-06 04:06:27,028 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:06:27,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 04:06:27,029 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 209 transitions, 4170 flow [2022-12-06 04:06:27,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 31 states have internal predecessors, (47), 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:06:27,029 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:27,029 INFO L213 CegarLoopForPetriNet]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:27,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 04:06:27,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 04:06:27,234 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:27,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:27,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1636819805, now seen corresponding path program 1 times [2022-12-06 04:06:27,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:27,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875781542] [2022-12-06 04:06:27,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:27,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:27,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:27,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875781542] [2022-12-06 04:06:27,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875781542] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:27,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697115949] [2022-12-06 04:06:27,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:27,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:27,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:27,432 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:06:27,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 04:06:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:27,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 04:06:27,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:27,522 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:27,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:06:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:27,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697115949] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:06:27,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:06:27,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2022-12-06 04:06:27,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700126256] [2022-12-06 04:06:27,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:06:27,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 04:06:27,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:27,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 04:06:27,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-12-06 04:06:27,667 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 04:06:27,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 209 transitions, 4170 flow. Second operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:27,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:27,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 04:06:27,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:28,192 INFO L130 PetriNetUnfolder]: 882/1710 cut-off events. [2022-12-06 04:06:28,192 INFO L131 PetriNetUnfolder]: For 269073/269073 co-relation queries the response was YES. [2022-12-06 04:06:28,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22287 conditions, 1710 events. 882/1710 cut-off events. For 269073/269073 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 8367 event pairs, 64 based on Foata normal form. 2/1712 useless extension candidates. Maximal degree in co-relation 22172. Up to 421 conditions per place. [2022-12-06 04:06:28,207 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 80 selfloop transitions, 159 changer transitions 52/291 dead transitions. [2022-12-06 04:06:28,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 291 transitions, 7277 flow [2022-12-06 04:06:28,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 04:06:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 04:06:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2022-12-06 04:06:28,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29829545454545453 [2022-12-06 04:06:28,216 INFO L175 Difference]: Start difference. First operand has 263 places, 209 transitions, 4170 flow. Second operand 22 states and 105 transitions. [2022-12-06 04:06:28,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 291 transitions, 7277 flow [2022-12-06 04:06:28,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 291 transitions, 4717 flow, removed 1220 selfloop flow, removed 19 redundant places. [2022-12-06 04:06:28,616 INFO L231 Difference]: Finished difference. Result has 269 places, 209 transitions, 2997 flow [2022-12-06 04:06:28,616 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=2566, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2997, PETRI_PLACES=269, PETRI_TRANSITIONS=209} [2022-12-06 04:06:28,617 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 251 predicate places. [2022-12-06 04:06:28,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:28,617 INFO L89 Accepts]: Start accepts. Operand has 269 places, 209 transitions, 2997 flow [2022-12-06 04:06:28,621 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:28,621 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:28,622 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 269 places, 209 transitions, 2997 flow [2022-12-06 04:06:28,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 268 places, 209 transitions, 2997 flow [2022-12-06 04:06:28,704 INFO L130 PetriNetUnfolder]: 190/550 cut-off events. [2022-12-06 04:06:28,704 INFO L131 PetriNetUnfolder]: For 89971/90021 co-relation queries the response was YES. [2022-12-06 04:06:28,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6884 conditions, 550 events. 190/550 cut-off events. For 89971/90021 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2498 event pairs, 1 based on Foata normal form. 0/548 useless extension candidates. Maximal degree in co-relation 6768. Up to 184 conditions per place. [2022-12-06 04:06:28,715 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 268 places, 209 transitions, 2997 flow [2022-12-06 04:06:28,715 INFO L188 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-06 04:06:28,717 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:28,717 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 04:06:28,717 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 209 transitions, 2997 flow [2022-12-06 04:06:28,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:28,717 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:28,717 INFO L213 CegarLoopForPetriNet]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:28,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 04:06:28,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 04:06:28,923 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:28,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:28,923 INFO L85 PathProgramCache]: Analyzing trace with hash -66233281, now seen corresponding path program 6 times [2022-12-06 04:06:28,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:28,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695211281] [2022-12-06 04:06:28,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:28,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:29,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:29,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695211281] [2022-12-06 04:06:29,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695211281] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:29,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524673529] [2022-12-06 04:06:29,182 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 04:06:29,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:29,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:29,184 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:06:29,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 04:06:29,255 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-12-06 04:06:29,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:06:29,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 04:06:29,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:29,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:06:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:29,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524673529] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:06:29,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:06:29,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 23 [2022-12-06 04:06:29,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409404423] [2022-12-06 04:06:29,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:06:29,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 04:06:29,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:29,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 04:06:29,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2022-12-06 04:06:29,494 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 04:06:29,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 209 transitions, 2997 flow. Second operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 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:06:29,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:29,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 04:06:29,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:30,520 INFO L130 PetriNetUnfolder]: 774/1518 cut-off events. [2022-12-06 04:06:30,521 INFO L131 PetriNetUnfolder]: For 198151/198151 co-relation queries the response was YES. [2022-12-06 04:06:30,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15800 conditions, 1518 events. 774/1518 cut-off events. For 198151/198151 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7317 event pairs, 34 based on Foata normal form. 8/1526 useless extension candidates. Maximal degree in co-relation 15681. Up to 379 conditions per place. [2022-12-06 04:06:30,533 INFO L137 encePairwiseOnDemand]: 8/16 looper letters, 88 selfloop transitions, 170 changer transitions 80/338 dead transitions. [2022-12-06 04:06:30,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 338 transitions, 6353 flow [2022-12-06 04:06:30,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-06 04:06:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-12-06 04:06:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 189 transitions. [2022-12-06 04:06:30,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2747093023255814 [2022-12-06 04:06:30,543 INFO L175 Difference]: Start difference. First operand has 268 places, 209 transitions, 2997 flow. Second operand 43 states and 189 transitions. [2022-12-06 04:06:30,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 338 transitions, 6353 flow [2022-12-06 04:06:30,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 338 transitions, 5548 flow, removed 302 selfloop flow, removed 22 redundant places. [2022-12-06 04:06:30,762 INFO L231 Difference]: Finished difference. Result has 291 places, 214 transitions, 3074 flow [2022-12-06 04:06:30,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=2621, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=3074, PETRI_PLACES=291, PETRI_TRANSITIONS=214} [2022-12-06 04:06:30,763 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 273 predicate places. [2022-12-06 04:06:30,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:30,763 INFO L89 Accepts]: Start accepts. Operand has 291 places, 214 transitions, 3074 flow [2022-12-06 04:06:30,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:30,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:30,767 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 291 places, 214 transitions, 3074 flow [2022-12-06 04:06:30,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 214 transitions, 3074 flow [2022-12-06 04:06:30,826 INFO L130 PetriNetUnfolder]: 189/550 cut-off events. [2022-12-06 04:06:30,826 INFO L131 PetriNetUnfolder]: For 65466/65466 co-relation queries the response was YES. [2022-12-06 04:06:30,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6087 conditions, 550 events. 189/550 cut-off events. For 65466/65466 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2485 event pairs, 0 based on Foata normal form. 0/550 useless extension candidates. Maximal degree in co-relation 5974. Up to 184 conditions per place. [2022-12-06 04:06:30,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 291 places, 214 transitions, 3074 flow [2022-12-06 04:06:30,833 INFO L188 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-06 04:06:30,834 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:30,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-06 04:06:30,835 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 214 transitions, 3074 flow [2022-12-06 04:06:30,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 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:06:30,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:30,835 INFO L213 CegarLoopForPetriNet]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:30,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 04:06:31,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 04:06:31,036 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:31,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:31,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1442876579, now seen corresponding path program 2 times [2022-12-06 04:06:31,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:31,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313951616] [2022-12-06 04:06:31,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:31,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:31,157 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:31,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:31,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313951616] [2022-12-06 04:06:31,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313951616] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:31,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573176014] [2022-12-06 04:06:31,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 04:06:31,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:31,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:31,159 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:06:31,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 04:06:31,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 04:06:31,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:06:31,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 04:06:31,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:31,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 04:06:31,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573176014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:31,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 04:06:31,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 24 [2022-12-06 04:06:31,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856709708] [2022-12-06 04:06:31,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:31,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 04:06:31,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:31,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 04:06:31,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2022-12-06 04:06:31,343 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 04:06:31,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 214 transitions, 3074 flow. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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:06:31,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:31,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 04:06:31,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:32,365 INFO L130 PetriNetUnfolder]: 3374/5538 cut-off events. [2022-12-06 04:06:32,366 INFO L131 PetriNetUnfolder]: For 385152/385152 co-relation queries the response was YES. [2022-12-06 04:06:32,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42212 conditions, 5538 events. 3374/5538 cut-off events. For 385152/385152 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 31593 event pairs, 44 based on Foata normal form. 334/5872 useless extension candidates. Maximal degree in co-relation 42106. Up to 2803 conditions per place. [2022-12-06 04:06:32,404 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 38 selfloop transitions, 14 changer transitions 946/998 dead transitions. [2022-12-06 04:06:32,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 998 transitions, 16294 flow [2022-12-06 04:06:32,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 04:06:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 04:06:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 88 transitions. [2022-12-06 04:06:32,405 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2022-12-06 04:06:32,405 INFO L175 Difference]: Start difference. First operand has 291 places, 214 transitions, 3074 flow. Second operand 13 states and 88 transitions. [2022-12-06 04:06:32,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 998 transitions, 16294 flow [2022-12-06 04:06:33,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 998 transitions, 14210 flow, removed 11 selfloop flow, removed 46 redundant places. [2022-12-06 04:06:33,086 INFO L231 Difference]: Finished difference. Result has 259 places, 39 transitions, 585 flow [2022-12-06 04:06:33,086 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=2306, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=585, PETRI_PLACES=259, PETRI_TRANSITIONS=39} [2022-12-06 04:06:33,087 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 241 predicate places. [2022-12-06 04:06:33,087 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:33,087 INFO L89 Accepts]: Start accepts. Operand has 259 places, 39 transitions, 585 flow [2022-12-06 04:06:33,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:33,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:33,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 259 places, 39 transitions, 585 flow [2022-12-06 04:06:33,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 39 transitions, 585 flow [2022-12-06 04:06:33,100 INFO L130 PetriNetUnfolder]: 15/66 cut-off events. [2022-12-06 04:06:33,100 INFO L131 PetriNetUnfolder]: For 9919/9919 co-relation queries the response was YES. [2022-12-06 04:06:33,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 66 events. 15/66 cut-off events. For 9919/9919 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 823. Up to 30 conditions per place. [2022-12-06 04:06:33,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 39 transitions, 585 flow [2022-12-06 04:06:33,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 04:06:33,103 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-06 04:06:33,165 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-06 04:06:33,194 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] and [245] L696-5-->L696-5: Formula: (and (< v_t1Thread1of1ForFork0_~k~0_247 11) (= v_t1Thread1of1ForFork0_~k~0_247 (+ 2 v_t1Thread1of1ForFork0_~k~0_249)) (= (+ v_~j~0_229 1) v_~i~0_255)) InVars {~j~0=v_~j~0_229, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_249} OutVars{~j~0=v_~j~0_229, ~i~0=v_~i~0_255, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_153|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_247} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-06 04:06:33,225 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-06 04:06:33,366 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-06 04:06:33,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] and [249] $Ultimate##0-->L696-5: Formula: (and (= v_t2Thread1of1ForFork1_~arg.base_27 |v_t2Thread1of1ForFork1_#in~arg.base_17|) (= |v_t2Thread1of1ForFork1_#in~arg.offset_17| v_t2Thread1of1ForFork1_~arg.offset_27) (= v_t2Thread1of1ForFork1_~k~1_201 1) (= (+ v_t1Thread1of1ForFork0_~k~0_266 1) v_t1Thread1of1ForFork0_~k~0_265) (= (+ v_~j~0_237 1) v_~i~0_271) (= v_~j~0_237 (+ v_~i~0_272 1)) (< v_t1Thread1of1ForFork0_~k~0_266 10)) InVars {t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_17|, ~i~0=v_~i~0_272, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_266, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_17|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_17|, ~j~0=v_~j~0_237, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_27, ~i~0=v_~i~0_271, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_124|, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_163|, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_27, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_265, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_17|, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_201} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_~arg.base, ~i~0, t2Thread1of1ForFork1_#t~post4, t1Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork1_~arg.offset, t1Thread1of1ForFork0_~k~0, t2Thread1of1ForFork1_~k~1] [2022-12-06 04:06:33,456 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] and [250] $Ultimate##0-->L696-5: Formula: (and (= v_~j~0_239 (+ v_~i~0_276 1)) (= |v_t2Thread1of1ForFork1_#in~arg.offset_19| v_t2Thread1of1ForFork1_~arg.offset_29) (= (+ v_~j~0_239 1) v_~i~0_275) (= v_t1Thread1of1ForFork0_~k~0_269 (+ 2 v_t1Thread1of1ForFork0_~k~0_270)) (< v_t1Thread1of1ForFork0_~k~0_269 11) (= v_t2Thread1of1ForFork1_~k~1_205 1) (= v_t2Thread1of1ForFork1_~arg.base_29 |v_t2Thread1of1ForFork1_#in~arg.base_19|)) InVars {t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_19|, ~i~0=v_~i~0_276, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_270, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_19|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_19|, ~j~0=v_~j~0_239, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_29, ~i~0=v_~i~0_275, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_126|, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_165|, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_29, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_269, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_19|, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_205} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_~arg.base, ~i~0, t2Thread1of1ForFork1_#t~post4, t1Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork1_~arg.offset, t1Thread1of1ForFork0_~k~0, t2Thread1of1ForFork1_~k~1] [2022-12-06 04:06:33,520 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-06 04:06:33,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-06 04:06:33,585 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] and [251] L704-5-->L696-5: Formula: (and (= (+ v_t1Thread1of1ForFork0_~k~0_274 1) v_t1Thread1of1ForFork0_~k~0_273) (< v_t2Thread1of1ForFork1_~k~1_210 10) (< v_t1Thread1of1ForFork0_~k~0_274 10) (= (+ v_t2Thread1of1ForFork1_~k~1_210 1) v_t2Thread1of1ForFork1_~k~1_209) (= v_~j~0_241 (+ v_~i~0_280 1)) (= v_~i~0_279 (+ v_~j~0_241 1))) InVars {~i~0=v_~i~0_280, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_274, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_210} OutVars{~j~0=v_~j~0_241, ~i~0=v_~i~0_279, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_128|, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_167|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_273, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_209} AuxVars[] AssignedVars[~j~0, ~i~0, t2Thread1of1ForFork1_#t~post4, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0, t2Thread1of1ForFork1_~k~1] [2022-12-06 04:06:33,637 INFO L203 LiptonReduction]: Total number of compositions: 10 [2022-12-06 04:06:33,638 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 551 [2022-12-06 04:06:33,638 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 32 transitions, 581 flow [2022-12-06 04:06:33,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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:06:33,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:33,638 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:33,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-06 04:06:33,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 04:06:33,844 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:06:33,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:33,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1317729255, now seen corresponding path program 1 times [2022-12-06 04:06:33,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:33,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151579355] [2022-12-06 04:06:33,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:33,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:33,968 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:33,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:33,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151579355] [2022-12-06 04:06:33,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151579355] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:33,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540147906] [2022-12-06 04:06:33,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:33,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:33,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:33,969 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:06:33,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 04:06:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:34,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 04:06:34,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:34,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 04:06:34,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540147906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:34,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 04:06:34,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2022-12-06 04:06:34,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787820559] [2022-12-06 04:06:34,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:34,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 04:06:34,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:34,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 04:06:34,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2022-12-06 04:06:34,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:06:34,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 32 transitions, 581 flow. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:06:34,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:34,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:06:34,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:34,181 INFO L130 PetriNetUnfolder]: 132/265 cut-off events. [2022-12-06 04:06:34,181 INFO L131 PetriNetUnfolder]: For 31405/31405 co-relation queries the response was YES. [2022-12-06 04:06:34,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3248 conditions, 265 events. 132/265 cut-off events. For 31405/31405 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 853 event pairs, 2 based on Foata normal form. 24/289 useless extension candidates. Maximal degree in co-relation 3159. Up to 142 conditions per place. [2022-12-06 04:06:34,183 INFO L137 encePairwiseOnDemand]: 8/19 looper letters, 0 selfloop transitions, 0 changer transitions 116/116 dead transitions. [2022-12-06 04:06:34,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 116 transitions, 2392 flow [2022-12-06 04:06:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 04:06:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 04:06:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2022-12-06 04:06:34,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29385964912280704 [2022-12-06 04:06:34,184 INFO L175 Difference]: Start difference. First operand has 153 places, 32 transitions, 581 flow. Second operand 12 states and 67 transitions. [2022-12-06 04:06:34,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 116 transitions, 2392 flow [2022-12-06 04:06:34,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 116 transitions, 1150 flow, removed 373 selfloop flow, removed 73 redundant places. [2022-12-06 04:06:34,200 INFO L231 Difference]: Finished difference. Result has 89 places, 0 transitions, 0 flow [2022-12-06 04:06:34,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=0, PETRI_PLACES=89, PETRI_TRANSITIONS=0} [2022-12-06 04:06:34,200 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 71 predicate places. [2022-12-06 04:06:34,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:34,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 0 transitions, 0 flow [2022-12-06 04:06:34,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 04:06:34,201 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 04:06:34,201 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:34,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 04:06:34,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 04:06:34,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 04:06:34,201 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:34,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-06 04:06:34,203 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 04:06:34,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:06:34,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 04:06:34,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 04:06:34,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 04:06:34,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 04:06:34,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 04:06:34,410 INFO L458 BasicCegarLoop]: Path program histogram: [6, 3, 2, 2, 1, 1, 1, 1, 1] [2022-12-06 04:06:34,412 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:06:34,412 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:06:34,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:06:34 BasicIcfg [2022-12-06 04:06:34,414 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:06:34,415 INFO L158 Benchmark]: Toolchain (without parser) took 21822.77ms. Allocated memory was 184.5MB in the beginning and 628.1MB in the end (delta: 443.5MB). Free memory was 160.0MB in the beginning and 438.6MB in the end (delta: -278.7MB). Peak memory consumption was 165.9MB. Max. memory is 8.0GB. [2022-12-06 04:06:34,415 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:06:34,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.42ms. Allocated memory is still 184.5MB. Free memory was 159.5MB in the beginning and 139.6MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 04:06:34,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.04ms. Allocated memory is still 184.5MB. Free memory was 139.6MB in the beginning and 137.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:06:34,415 INFO L158 Benchmark]: Boogie Preprocessor took 27.94ms. Allocated memory is still 184.5MB. Free memory was 137.8MB in the beginning and 136.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 04:06:34,415 INFO L158 Benchmark]: RCFGBuilder took 302.45ms. Allocated memory is still 184.5MB. Free memory was 136.4MB in the beginning and 123.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 04:06:34,417 INFO L158 Benchmark]: TraceAbstraction took 21048.61ms. Allocated memory was 184.5MB in the beginning and 628.1MB in the end (delta: 443.5MB). Free memory was 123.3MB in the beginning and 438.6MB in the end (delta: -315.4MB). Peak memory consumption was 129.2MB. Max. memory is 8.0GB. [2022-12-06 04:06:34,418 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 184.5MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 396.42ms. Allocated memory is still 184.5MB. Free memory was 159.5MB in the beginning and 139.6MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.04ms. Allocated memory is still 184.5MB. Free memory was 139.6MB in the beginning and 137.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.94ms. Allocated memory is still 184.5MB. Free memory was 137.8MB in the beginning and 136.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 302.45ms. Allocated memory is still 184.5MB. Free memory was 136.4MB in the beginning and 123.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 21048.61ms. Allocated memory was 184.5MB in the beginning and 628.1MB in the end (delta: 443.5MB). Free memory was 123.3MB in the beginning and 438.6MB in the end (delta: -315.4MB). Peak memory consumption was 129.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 66 PlacesBefore, 18 PlacesAfterwards, 64 TransitionsBefore, 13 TransitionsAfterwards, 1078 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 18 TrivialYvCompositions, 30 ConcurrentYvCompositions, 3 ChoiceCompositions, 51 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 613, independent: 598, independent conditional: 598, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 613, independent: 598, independent conditional: 0, independent unconditional: 598, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 613, independent: 598, independent conditional: 0, independent unconditional: 598, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 613, independent: 598, independent conditional: 0, independent unconditional: 598, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 598, independent: 588, independent conditional: 0, independent unconditional: 588, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 598, independent: 588, independent conditional: 0, independent unconditional: 588, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 613, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 598, unknown conditional: 0, unknown unconditional: 598] , Statistics on independence cache: Total cache size (in pairs): 1033, Positive cache size: 1023, Positive conditional cache size: 0, Positive unconditional cache size: 1023, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 20 PlacesBefore, 19 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 10, unknown conditional: 4, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 8, Positive conditional cache size: 4, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 8, Positive conditional cache size: 4, Positive unconditional cache size: 4, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 2, independent unconditional: 2, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 12, Positive conditional cache size: 6, Positive unconditional cache size: 6, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 12, Positive conditional cache size: 6, Positive unconditional cache size: 6, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 12, Positive conditional cache size: 6, Positive unconditional cache size: 6, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 13, Positive conditional cache size: 7, Positive unconditional cache size: 6, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 52 TransitionsBefore, 49 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 19, Positive conditional cache size: 13, Positive unconditional cache size: 6, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 92 PlacesBefore, 92 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 19, Positive conditional cache size: 13, Positive unconditional cache size: 6, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 117 PlacesBefore, 117 PlacesAfterwards, 99 TransitionsBefore, 98 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 10, independent: 8, independent conditional: 3, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 21, Positive conditional cache size: 14, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 146 PlacesBefore, 147 PlacesAfterwards, 122 TransitionsBefore, 120 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 30, Positive conditional cache size: 23, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 160 PlacesBefore, 161 PlacesAfterwards, 186 TransitionsBefore, 182 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 33, independent conditional: 31, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, independent: 33, independent conditional: 31, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, independent: 33, independent conditional: 31, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, independent: 18, independent conditional: 16, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 45, Positive conditional cache size: 38, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 186 PlacesBefore, 186 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 45, Positive conditional cache size: 38, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 206 PlacesBefore, 206 PlacesAfterwards, 159 TransitionsBefore, 159 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 45, Positive conditional cache size: 38, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 263 PlacesBefore, 263 PlacesAfterwards, 216 TransitionsBefore, 209 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 26, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 30, independent conditional: 26, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 26, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 16, independent conditional: 12, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 59, Positive conditional cache size: 52, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 268 PlacesBefore, 268 PlacesAfterwards, 209 TransitionsBefore, 209 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 59, Positive conditional cache size: 52, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 291 PlacesBefore, 291 PlacesAfterwards, 214 TransitionsBefore, 214 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 59, Positive conditional cache size: 52, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 170 PlacesBefore, 153 PlacesAfterwards, 39 TransitionsBefore, 32 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 13, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23, independent: 21, independent conditional: 13, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 13, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 9, independent unconditional: 3, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 23, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 12, unknown conditional: 9, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 88, Positive conditional cache size: 77, Positive unconditional cache size: 11, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 88, Positive conditional cache size: 77, Positive unconditional cache size: 11, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 722]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 84 locations, 3 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: 21.0s, OverallIterations: 18, TraceHistogramMax: 11, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3790 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3790 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 591 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2514 IncrementalHoareTripleChecker+Invalid, 3105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 591 mSolverCounterUnsat, 0 mSDtfsCounter, 2514 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 817 GetRequests, 263 SyntacticMatches, 54 SemanticMatches, 500 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5957 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4204occurred in iteration=14, InterpolantAutomatonStates: 340, 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.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 524 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 671 ConstructedInterpolants, 0 QuantifiedInterpolants, 2673 SizeOfPredicates, 102 NumberOfNonLiveVariables, 2087 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 40 InterpolantComputations, 8 PerfectInterpolantSequences, 312/1284 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 04:06:34,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...