/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:38:34,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:38:34,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:38:34,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:38:34,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:38:34,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:38:34,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:38:34,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:38:34,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:38:34,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:38:34,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:38:34,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:38:34,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:38:34,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:38:34,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:38:34,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:38:34,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:38:34,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:38:34,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:38:34,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:38:34,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:38:34,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:38:34,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:38:34,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:38:34,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:38:34,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:38:34,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:38:34,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:38:34,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:38:34,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:38:34,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:38:34,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:38:34,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:38:34,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:38:34,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:38:34,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:38:34,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:38:34,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:38:34,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:38:34,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:38:34,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:38:34,383 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:38:34,404 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:38:34,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:38:34,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:38:34,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:38:34,406 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:38:34,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:38:34,406 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:38:34,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:38:34,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:38:34,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:38:34,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:38:34,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:38:34,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:38:34,408 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:38:34,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:38:34,408 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:38:34,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:38:34,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:38:34,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:38:34,408 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:38:34,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:38:34,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:38:34,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:38:34,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:38:34,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:38:34,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:38:34,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:38:34,409 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:38:34,409 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:38:34,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:38:34,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:38:34,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:38:34,687 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:38:34,687 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:38:34,688 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-12-06 07:38:35,616 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:38:35,833 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:38:35,833 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-12-06 07:38:35,838 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5ade8d7/4e6c065d1e0c43dbb3e0fcd4991ce620/FLAG82f387e64 [2022-12-06 07:38:35,849 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5ade8d7/4e6c065d1e0c43dbb3e0fcd4991ce620 [2022-12-06 07:38:35,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:38:35,862 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:38:35,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:38:35,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:38:35,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:38:35,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:38:35" (1/1) ... [2022-12-06 07:38:35,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22afaba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:35, skipping insertion in model container [2022-12-06 07:38:35,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:38:35" (1/1) ... [2022-12-06 07:38:35,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:38:35,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:38:36,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:36,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:36,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:36,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:36,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:36,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:36,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:36,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:36,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:36,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:36,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:36,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:36,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:36,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:36,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:36,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:36,044 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2022-12-06 07:38:36,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:38:36,064 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:38:36,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:36,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:36,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:36,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:36,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:36,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:36,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:36,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:36,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:36,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:36,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:36,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:36,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:36,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:36,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:36,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:36,101 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2022-12-06 07:38:36,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:38:36,117 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:38:36,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:36 WrapperNode [2022-12-06 07:38:36,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:38:36,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:38:36,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:38:36,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:38:36,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:36" (1/1) ... [2022-12-06 07:38:36,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:36" (1/1) ... [2022-12-06 07:38:36,164 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2022-12-06 07:38:36,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:38:36,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:38:36,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:38:36,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:38:36,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:36" (1/1) ... [2022-12-06 07:38:36,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:36" (1/1) ... [2022-12-06 07:38:36,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:36" (1/1) ... [2022-12-06 07:38:36,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:36" (1/1) ... [2022-12-06 07:38:36,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:36" (1/1) ... [2022-12-06 07:38:36,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:36" (1/1) ... [2022-12-06 07:38:36,209 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:36" (1/1) ... [2022-12-06 07:38:36,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:36" (1/1) ... [2022-12-06 07:38:36,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:38:36,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:38:36,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:38:36,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:38:36,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:36" (1/1) ... [2022-12-06 07:38:36,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:38:36,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:38:36,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:38:36,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:38:36,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:38:36,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:38:36,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:38:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:38:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:38:36,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:38:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:38:36,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:38:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:38:36,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:38:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 07:38:36,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 07:38:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:38:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:38:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:38:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:38:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:38:36,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:38:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:38:36,293 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:38:36,415 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:38:36,417 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:38:36,727 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:38:36,819 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:38:36,819 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 07:38:36,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:38:36 BoogieIcfgContainer [2022-12-06 07:38:36,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:38:36,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:38:36,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:38:36,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:38:36,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:38:35" (1/3) ... [2022-12-06 07:38:36,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec7a98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:38:36, skipping insertion in model container [2022-12-06 07:38:36,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:36" (2/3) ... [2022-12-06 07:38:36,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec7a98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:38:36, skipping insertion in model container [2022-12-06 07:38:36,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:38:36" (3/3) ... [2022-12-06 07:38:36,826 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2022-12-06 07:38:36,840 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:38:36,840 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:38:36,841 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:38:36,920 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 07:38:36,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 160 transitions, 352 flow [2022-12-06 07:38:37,038 INFO L130 PetriNetUnfolder]: 12/156 cut-off events. [2022-12-06 07:38:37,038 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:38:37,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 156 events. 12/156 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2022-12-06 07:38:37,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 160 transitions, 352 flow [2022-12-06 07:38:37,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 144 transitions, 312 flow [2022-12-06 07:38:37,048 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:37,060 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 144 transitions, 312 flow [2022-12-06 07:38:37,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 144 transitions, 312 flow [2022-12-06 07:38:37,106 INFO L130 PetriNetUnfolder]: 12/144 cut-off events. [2022-12-06 07:38:37,107 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:38:37,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 144 events. 12/144 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2022-12-06 07:38:37,110 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 144 transitions, 312 flow [2022-12-06 07:38:37,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 2280 [2022-12-06 07:38:42,697 INFO L203 LiptonReduction]: Total number of compositions: 113 [2022-12-06 07:38:42,707 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:38:42,712 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;@57f41bd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:38:42,712 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 07:38:42,721 INFO L130 PetriNetUnfolder]: 4/30 cut-off events. [2022-12-06 07:38:42,721 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:38:42,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:42,722 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:42,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:38:42,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:42,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1695043003, now seen corresponding path program 1 times [2022-12-06 07:38:42,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:42,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010404320] [2022-12-06 07:38:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:42,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:43,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:43,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010404320] [2022-12-06 07:38:43,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010404320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:43,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:43,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:38:43,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218254033] [2022-12-06 07:38:43,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:43,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:43,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:43,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:43,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:43,067 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 07:38:43,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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 07:38:43,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:43,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 07:38:43,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:43,365 INFO L130 PetriNetUnfolder]: 1420/1898 cut-off events. [2022-12-06 07:38:43,366 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-12-06 07:38:43,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3999 conditions, 1898 events. 1420/1898 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7133 event pairs, 765 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 3498. Up to 1552 conditions per place. [2022-12-06 07:38:43,378 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 42 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-06 07:38:43,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 215 flow [2022-12-06 07:38:43,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:43,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:43,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 07:38:43,388 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2022-12-06 07:38:43,389 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 50 transitions. [2022-12-06 07:38:43,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 215 flow [2022-12-06 07:38:43,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-06 07:38:43,401 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2022-12-06 07:38:43,402 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2022-12-06 07:38:43,405 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2022-12-06 07:38:43,405 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:43,406 INFO L89 Accepts]: Start accepts. Operand has 36 places, 32 transitions, 84 flow [2022-12-06 07:38:43,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:43,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:43,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 32 transitions, 84 flow [2022-12-06 07:38:43,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 84 flow [2022-12-06 07:38:43,421 INFO L130 PetriNetUnfolder]: 4/32 cut-off events. [2022-12-06 07:38:43,421 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:38:43,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 4/32 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 4 conditions per place. [2022-12-06 07:38:43,422 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 32 transitions, 84 flow [2022-12-06 07:38:43,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 07:38:43,438 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:38:43,440 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 07:38:43,440 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2022-12-06 07:38:43,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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 07:38:43,440 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:43,440 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:43,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:38:43,443 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:38:43,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:43,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1731643137, now seen corresponding path program 1 times [2022-12-06 07:38:43,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:43,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905915709] [2022-12-06 07:38:43,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:43,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:38:43,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:43,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905915709] [2022-12-06 07:38:43,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905915709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:43,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:43,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:38:43,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272832824] [2022-12-06 07:38:43,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:43,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:43,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:43,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:43,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:43,567 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 07:38:43,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:43,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:43,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 07:38:43,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:43,773 INFO L130 PetriNetUnfolder]: 1718/2336 cut-off events. [2022-12-06 07:38:43,773 INFO L131 PetriNetUnfolder]: For 541/541 co-relation queries the response was YES. [2022-12-06 07:38:43,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 2336 events. 1718/2336 cut-off events. For 541/541 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8137 event pairs, 977 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 2424. Up to 1790 conditions per place. [2022-12-06 07:38:43,785 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2022-12-06 07:38:43,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 233 flow [2022-12-06 07:38:43,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:43,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 07:38:43,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3951612903225806 [2022-12-06 07:38:43,786 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 49 transitions. [2022-12-06 07:38:43,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 233 flow [2022-12-06 07:38:43,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 223 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 07:38:43,788 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2022-12-06 07:38:43,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2022-12-06 07:38:43,788 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2022-12-06 07:38:43,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:43,788 INFO L89 Accepts]: Start accepts. Operand has 38 places, 33 transitions, 92 flow [2022-12-06 07:38:43,789 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:43,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:43,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 33 transitions, 92 flow [2022-12-06 07:38:43,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 92 flow [2022-12-06 07:38:43,793 INFO L130 PetriNetUnfolder]: 4/33 cut-off events. [2022-12-06 07:38:43,793 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:38:43,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 4/33 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2022-12-06 07:38:43,794 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 33 transitions, 92 flow [2022-12-06 07:38:43,794 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-06 07:38:43,853 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:43,854 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 07:38:43,854 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 88 flow [2022-12-06 07:38:43,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:43,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:43,854 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:43,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:38:43,854 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:38:43,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:43,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1115120276, now seen corresponding path program 1 times [2022-12-06 07:38:43,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:43,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009179111] [2022-12-06 07:38:43,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:43,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:38:43,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:43,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009179111] [2022-12-06 07:38:43,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009179111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:43,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:43,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:38:43,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311117282] [2022-12-06 07:38:43,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:43,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:43,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:43,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:43,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:43,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 07:38:43,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:43,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:43,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 07:38:43,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:44,162 INFO L130 PetriNetUnfolder]: 1632/2222 cut-off events. [2022-12-06 07:38:44,163 INFO L131 PetriNetUnfolder]: For 867/867 co-relation queries the response was YES. [2022-12-06 07:38:44,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5558 conditions, 2222 events. 1632/2222 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7613 event pairs, 977 based on Foata normal form. 0/1833 useless extension candidates. Maximal degree in co-relation 1664. Up to 1790 conditions per place. [2022-12-06 07:38:44,174 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 46 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2022-12-06 07:38:44,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 237 flow [2022-12-06 07:38:44,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 07:38:44,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2022-12-06 07:38:44,175 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 88 flow. Second operand 4 states and 48 transitions. [2022-12-06 07:38:44,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 237 flow [2022-12-06 07:38:44,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 219 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:44,178 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2022-12-06 07:38:44,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2022-12-06 07:38:44,179 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2022-12-06 07:38:44,179 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:44,179 INFO L89 Accepts]: Start accepts. Operand has 38 places, 33 transitions, 92 flow [2022-12-06 07:38:44,179 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:44,180 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:44,180 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 33 transitions, 92 flow [2022-12-06 07:38:44,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 92 flow [2022-12-06 07:38:44,183 INFO L130 PetriNetUnfolder]: 4/33 cut-off events. [2022-12-06 07:38:44,183 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:38:44,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 4/33 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 32. Up to 4 conditions per place. [2022-12-06 07:38:44,184 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 33 transitions, 92 flow [2022-12-06 07:38:44,184 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-06 07:38:44,192 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:38:44,193 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 07:38:44,193 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2022-12-06 07:38:44,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:44,193 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:44,193 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:44,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:38:44,193 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:38:44,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:44,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1272676707, now seen corresponding path program 1 times [2022-12-06 07:38:44,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:44,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752454327] [2022-12-06 07:38:44,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:44,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:38:44,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:44,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752454327] [2022-12-06 07:38:44,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752454327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:44,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:44,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:38:44,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738398890] [2022-12-06 07:38:44,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:44,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:38:44,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:44,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:38:44,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:38:44,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 07:38:44,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 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 07:38:44,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:44,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 07:38:44,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:44,419 INFO L130 PetriNetUnfolder]: 1632/2223 cut-off events. [2022-12-06 07:38:44,419 INFO L131 PetriNetUnfolder]: For 699/699 co-relation queries the response was YES. [2022-12-06 07:38:44,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5424 conditions, 2223 events. 1632/2223 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7381 event pairs, 1243 based on Foata normal form. 0/1834 useless extension candidates. Maximal degree in co-relation 1727. Up to 2223 conditions per place. [2022-12-06 07:38:44,426 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 32 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2022-12-06 07:38:44,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 162 flow [2022-12-06 07:38:44,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:38:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:38:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 07:38:44,427 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-06 07:38:44,427 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 3 states and 33 transitions. [2022-12-06 07:38:44,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 162 flow [2022-12-06 07:38:44,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 156 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 07:38:44,429 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 98 flow [2022-12-06 07:38:44,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2022-12-06 07:38:44,429 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2022-12-06 07:38:44,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:44,430 INFO L89 Accepts]: Start accepts. Operand has 39 places, 34 transitions, 98 flow [2022-12-06 07:38:44,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:44,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:44,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 98 flow [2022-12-06 07:38:44,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 98 flow [2022-12-06 07:38:44,434 INFO L130 PetriNetUnfolder]: 4/34 cut-off events. [2022-12-06 07:38:44,434 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:38:44,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 34 events. 4/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 44. Up to 4 conditions per place. [2022-12-06 07:38:44,434 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 98 flow [2022-12-06 07:38:44,434 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-06 07:38:45,532 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:45,532 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1103 [2022-12-06 07:38:45,532 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 94 flow [2022-12-06 07:38:45,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 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 07:38:45,533 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:45,533 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:45,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:38:45,533 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:38:45,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:45,533 INFO L85 PathProgramCache]: Analyzing trace with hash -922744889, now seen corresponding path program 1 times [2022-12-06 07:38:45,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:45,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719080654] [2022-12-06 07:38:45,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:45,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:38:46,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:46,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719080654] [2022-12-06 07:38:46,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719080654] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:38:46,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197518648] [2022-12-06 07:38:46,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:46,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:38:46,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:38:46,186 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 07:38:46,193 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 07:38:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:46,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 07:38:46,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:38:46,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 07:38:46,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:38:46,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:38:46,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 07:38:46,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:38:46,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 07:38:46,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:38:46,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-12-06 07:38:46,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-12-06 07:38:46,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2022-12-06 07:38:46,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:46,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:38:47,060 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_186 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) c_~A~0.base) c_~A~0.offset))) (or (< 2147483645 .cse0) (< c_~min~0 (+ 3 .cse0))))) is different from false [2022-12-06 07:38:47,686 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) c_~A~0.base) c_~A~0.offset))) (or (< 2147483645 .cse0) (< c_~min~0 (+ 3 .cse0))))) (not (< c_~min~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset)))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse2 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse2) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) c_~A~0.base) c_~A~0.offset))) (or (< .cse2 (+ 3 .cse3)) (< 2147483645 .cse3))))))))) is different from false [2022-12-06 07:38:47,731 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) c_~A~0.base) c_~A~0.offset)) (.cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (< 2147483645 .cse0) (< .cse1 (+ 4 .cse0)) (< .cse1 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse4 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) c_~A~0.base) c_~A~0.offset))) (or (< (select (select .cse3 c_~A~0.base) c_~A~0.offset) (+ 3 .cse4)) (< 2147483645 .cse4)))))) is different from false [2022-12-06 07:38:47,766 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int)) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183))) (let ((.cse3 (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse0 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483645 .cse0) (< .cse1 (+ .cse0 4)) (< .cse1 (+ (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1))))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int)) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483645 .cse4) (< (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse4 3))))))) is different from false [2022-12-06 07:38:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:47,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197518648] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:38:47,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:38:47,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 33 [2022-12-06 07:38:47,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581879584] [2022-12-06 07:38:47,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:38:47,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-06 07:38:47,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:47,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-06 07:38:47,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=794, Unknown=23, NotChecked=244, Total=1190 [2022-12-06 07:38:47,770 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 07:38:47,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 94 flow. Second operand has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 34 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:47,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:47,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 07:38:47,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:56,485 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 71 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:39:04,741 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 73 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:39:13,620 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 91 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:39:22,751 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 73 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:39:31,202 WARN L233 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 75 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:39:39,345 WARN L233 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 93 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:39:40,693 INFO L130 PetriNetUnfolder]: 9238/12748 cut-off events. [2022-12-06 07:39:40,693 INFO L131 PetriNetUnfolder]: For 2165/2165 co-relation queries the response was YES. [2022-12-06 07:39:40,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30254 conditions, 12748 events. 9238/12748 cut-off events. For 2165/2165 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 64461 event pairs, 150 based on Foata normal form. 8/9943 useless extension candidates. Maximal degree in co-relation 30244. Up to 2567 conditions per place. [2022-12-06 07:39:40,729 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 235 selfloop transitions, 64 changer transitions 297/596 dead transitions. [2022-12-06 07:39:40,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 596 transitions, 2783 flow [2022-12-06 07:39:40,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-06 07:39:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-12-06 07:39:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 582 transitions. [2022-12-06 07:39:40,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4470046082949309 [2022-12-06 07:39:40,740 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 94 flow. Second operand 42 states and 582 transitions. [2022-12-06 07:39:40,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 596 transitions, 2783 flow [2022-12-06 07:39:40,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 596 transitions, 2775 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:39:40,765 INFO L231 Difference]: Finished difference. Result has 103 places, 119 transitions, 671 flow [2022-12-06 07:39:40,765 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=671, PETRI_PLACES=103, PETRI_TRANSITIONS=119} [2022-12-06 07:39:40,766 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 63 predicate places. [2022-12-06 07:39:40,766 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:40,766 INFO L89 Accepts]: Start accepts. Operand has 103 places, 119 transitions, 671 flow [2022-12-06 07:39:40,769 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:40,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:40,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 119 transitions, 671 flow [2022-12-06 07:39:40,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 119 transitions, 671 flow [2022-12-06 07:39:40,845 INFO L130 PetriNetUnfolder]: 329/834 cut-off events. [2022-12-06 07:39:40,845 INFO L131 PetriNetUnfolder]: For 2977/3185 co-relation queries the response was YES. [2022-12-06 07:39:40,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2262 conditions, 834 events. 329/834 cut-off events. For 2977/3185 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5337 event pairs, 2 based on Foata normal form. 2/809 useless extension candidates. Maximal degree in co-relation 2160. Up to 168 conditions per place. [2022-12-06 07:39:40,852 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 119 transitions, 671 flow [2022-12-06 07:39:40,852 INFO L188 LiptonReduction]: Number of co-enabled transitions 1518 [2022-12-06 07:39:40,854 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:39:40,855 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:39:40,855 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 119 transitions, 671 flow [2022-12-06 07:39:40,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 34 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:40,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:40,855 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:40,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 07:39:41,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:39:41,060 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:39:41,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:41,061 INFO L85 PathProgramCache]: Analyzing trace with hash -500927109, now seen corresponding path program 2 times [2022-12-06 07:39:41,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:41,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561674969] [2022-12-06 07:39:41,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:41,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:39:41,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:41,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561674969] [2022-12-06 07:39:41,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561674969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:41,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:41,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:39:41,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468929451] [2022-12-06 07:39:41,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:41,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:39:41,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:41,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:39:41,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:39:41,242 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 07:39:41,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 119 transitions, 671 flow. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 07:39:41,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:41,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 07:39:41,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:42,100 INFO L130 PetriNetUnfolder]: 7586/10590 cut-off events. [2022-12-06 07:39:42,101 INFO L131 PetriNetUnfolder]: For 66345/66345 co-relation queries the response was YES. [2022-12-06 07:39:42,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42474 conditions, 10590 events. 7586/10590 cut-off events. For 66345/66345 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 52213 event pairs, 1083 based on Foata normal form. 8/10597 useless extension candidates. Maximal degree in co-relation 42403. Up to 6483 conditions per place. [2022-12-06 07:39:42,140 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 94 selfloop transitions, 5 changer transitions 190/289 dead transitions. [2022-12-06 07:39:42,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 289 transitions, 2212 flow [2022-12-06 07:39:42,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:39:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:39:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-06 07:39:42,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49032258064516127 [2022-12-06 07:39:42,142 INFO L175 Difference]: Start difference. First operand has 83 places, 119 transitions, 671 flow. Second operand 5 states and 76 transitions. [2022-12-06 07:39:42,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 289 transitions, 2212 flow [2022-12-06 07:39:42,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 289 transitions, 2151 flow, removed 30 selfloop flow, removed 11 redundant places. [2022-12-06 07:39:42,381 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 391 flow [2022-12-06 07:39:42,381 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=391, PETRI_PLACES=78, PETRI_TRANSITIONS=75} [2022-12-06 07:39:42,381 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 38 predicate places. [2022-12-06 07:39:42,381 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:42,382 INFO L89 Accepts]: Start accepts. Operand has 78 places, 75 transitions, 391 flow [2022-12-06 07:39:42,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:42,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:42,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 75 transitions, 391 flow [2022-12-06 07:39:42,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 75 transitions, 391 flow [2022-12-06 07:39:42,404 INFO L130 PetriNetUnfolder]: 145/362 cut-off events. [2022-12-06 07:39:42,405 INFO L131 PetriNetUnfolder]: For 1306/1369 co-relation queries the response was YES. [2022-12-06 07:39:42,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 362 events. 145/362 cut-off events. For 1306/1369 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1759 event pairs, 0 based on Foata normal form. 2/356 useless extension candidates. Maximal degree in co-relation 1014. Up to 74 conditions per place. [2022-12-06 07:39:42,408 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 75 transitions, 391 flow [2022-12-06 07:39:42,408 INFO L188 LiptonReduction]: Number of co-enabled transitions 858 [2022-12-06 07:39:42,408 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:39:42,409 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 07:39:42,409 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 75 transitions, 391 flow [2022-12-06 07:39:42,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 07:39:42,409 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:42,409 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:42,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:39:42,410 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:39:42,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:42,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1265561741, now seen corresponding path program 3 times [2022-12-06 07:39:42,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:42,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539241067] [2022-12-06 07:39:42,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:42,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:39:42,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:42,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539241067] [2022-12-06 07:39:42,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539241067] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:39:42,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524705361] [2022-12-06 07:39:42,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 07:39:42,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:39:42,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:39:42,657 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 07:39:42,659 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 07:39:42,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 07:39:42,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:39:42,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 07:39:42,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:39:42,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 07:39:42,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-06 07:39:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:39:42,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:39:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:39:43,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524705361] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 07:39:43,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 07:39:43,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 7] total 16 [2022-12-06 07:39:43,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969840069] [2022-12-06 07:39:43,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:43,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:39:43,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:43,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:39:43,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:39:43,040 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 07:39:43,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 75 transitions, 391 flow. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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 07:39:43,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:43,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 07:39:43,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:44,117 INFO L130 PetriNetUnfolder]: 9511/13173 cut-off events. [2022-12-06 07:39:44,117 INFO L131 PetriNetUnfolder]: For 98591/98591 co-relation queries the response was YES. [2022-12-06 07:39:44,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54377 conditions, 13173 events. 9511/13173 cut-off events. For 98591/98591 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 67214 event pairs, 1384 based on Foata normal form. 8/13180 useless extension candidates. Maximal degree in co-relation 54333. Up to 4522 conditions per place. [2022-12-06 07:39:44,160 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 123 selfloop transitions, 13 changer transitions 170/306 dead transitions. [2022-12-06 07:39:44,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 306 transitions, 2211 flow [2022-12-06 07:39:44,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:39:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:39:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2022-12-06 07:39:44,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5668202764976958 [2022-12-06 07:39:44,161 INFO L175 Difference]: Start difference. First operand has 67 places, 75 transitions, 391 flow. Second operand 7 states and 123 transitions. [2022-12-06 07:39:44,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 306 transitions, 2211 flow [2022-12-06 07:39:44,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 306 transitions, 2062 flow, removed 60 selfloop flow, removed 14 redundant places. [2022-12-06 07:39:44,387 INFO L231 Difference]: Finished difference. Result has 64 places, 86 transitions, 530 flow [2022-12-06 07:39:44,388 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=530, PETRI_PLACES=64, PETRI_TRANSITIONS=86} [2022-12-06 07:39:44,388 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2022-12-06 07:39:44,388 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:44,388 INFO L89 Accepts]: Start accepts. Operand has 64 places, 86 transitions, 530 flow [2022-12-06 07:39:44,390 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:44,390 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:44,391 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 86 transitions, 530 flow [2022-12-06 07:39:44,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 86 transitions, 530 flow [2022-12-06 07:39:44,455 INFO L130 PetriNetUnfolder]: 554/1238 cut-off events. [2022-12-06 07:39:44,456 INFO L131 PetriNetUnfolder]: For 1692/1741 co-relation queries the response was YES. [2022-12-06 07:39:44,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3679 conditions, 1238 events. 554/1238 cut-off events. For 1692/1741 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7844 event pairs, 44 based on Foata normal form. 8/1212 useless extension candidates. Maximal degree in co-relation 3642. Up to 301 conditions per place. [2022-12-06 07:39:44,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 86 transitions, 530 flow [2022-12-06 07:39:44,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 872 [2022-12-06 07:39:44,467 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:39:44,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:39:44,467 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 86 transitions, 530 flow [2022-12-06 07:39:44,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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 07:39:44,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:44,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:44,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 07:39:44,672 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,SelfDestructingSolverStorable6 [2022-12-06 07:39:44,672 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:39:44,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:44,672 INFO L85 PathProgramCache]: Analyzing trace with hash -103512581, now seen corresponding path program 4 times [2022-12-06 07:39:44,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:44,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514584741] [2022-12-06 07:39:44,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:44,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:39:44,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:44,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514584741] [2022-12-06 07:39:44,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514584741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:44,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:44,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:39:44,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793044942] [2022-12-06 07:39:44,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:44,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:39:44,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:44,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:39:44,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:39:44,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 07:39:44,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 86 transitions, 530 flow. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 07:39:44,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:44,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 07:39:44,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:45,588 INFO L130 PetriNetUnfolder]: 6739/9560 cut-off events. [2022-12-06 07:39:45,588 INFO L131 PetriNetUnfolder]: For 22849/22849 co-relation queries the response was YES. [2022-12-06 07:39:45,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35736 conditions, 9560 events. 6739/9560 cut-off events. For 22849/22849 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 47664 event pairs, 1103 based on Foata normal form. 7/9566 useless extension candidates. Maximal degree in co-relation 35703. Up to 6229 conditions per place. [2022-12-06 07:39:45,612 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 91 selfloop transitions, 4 changer transitions 100/195 dead transitions. [2022-12-06 07:39:45,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 195 transitions, 1642 flow [2022-12-06 07:39:45,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:39:45,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:39:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-06 07:39:45,614 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4258064516129032 [2022-12-06 07:39:45,614 INFO L175 Difference]: Start difference. First operand has 62 places, 86 transitions, 530 flow. Second operand 5 states and 66 transitions. [2022-12-06 07:39:45,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 195 transitions, 1642 flow [2022-12-06 07:39:45,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 195 transitions, 1505 flow, removed 56 selfloop flow, removed 4 redundant places. [2022-12-06 07:39:45,692 INFO L231 Difference]: Finished difference. Result has 64 places, 78 transitions, 433 flow [2022-12-06 07:39:45,692 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=433, PETRI_PLACES=64, PETRI_TRANSITIONS=78} [2022-12-06 07:39:45,692 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2022-12-06 07:39:45,692 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:45,692 INFO L89 Accepts]: Start accepts. Operand has 64 places, 78 transitions, 433 flow [2022-12-06 07:39:45,693 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:45,693 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:45,693 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 78 transitions, 433 flow [2022-12-06 07:39:45,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 78 transitions, 433 flow [2022-12-06 07:39:45,724 INFO L130 PetriNetUnfolder]: 282/587 cut-off events. [2022-12-06 07:39:45,725 INFO L131 PetriNetUnfolder]: For 884/904 co-relation queries the response was YES. [2022-12-06 07:39:45,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 587 events. 282/587 cut-off events. For 884/904 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2865 event pairs, 11 based on Foata normal form. 2/578 useless extension candidates. Maximal degree in co-relation 1711. Up to 170 conditions per place. [2022-12-06 07:39:45,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 78 transitions, 433 flow [2022-12-06 07:39:45,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 742 [2022-12-06 07:39:45,729 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:39:45,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 07:39:45,730 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 78 transitions, 433 flow [2022-12-06 07:39:45,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 07:39:45,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:45,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:45,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:39:45,730 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:39:45,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:45,731 INFO L85 PathProgramCache]: Analyzing trace with hash 496730675, now seen corresponding path program 5 times [2022-12-06 07:39:45,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:45,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17793216] [2022-12-06 07:39:45,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:45,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:39:46,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:46,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17793216] [2022-12-06 07:39:46,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17793216] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:39:46,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343164227] [2022-12-06 07:39:46,119 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 07:39:46,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:39:46,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:39:46,120 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 07:39:46,162 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 07:39:46,236 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:39:46,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:39:46,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 07:39:46,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:39:46,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 07:39:46,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:39:46,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 07:39:46,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:39:46,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 39 [2022-12-06 07:39:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:39:46,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:39:48,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:39:48,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 46 [2022-12-06 07:39:48,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:39:48,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 62 [2022-12-06 07:39:48,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:39:48,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2022-12-06 07:39:48,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:39:48,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343164227] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:39:48,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:39:48,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 10] total 23 [2022-12-06 07:39:48,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201485907] [2022-12-06 07:39:48,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:39:48,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 07:39:48,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:48,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 07:39:48,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=483, Unknown=4, NotChecked=0, Total=600 [2022-12-06 07:39:48,878 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 07:39:48,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 78 transitions, 433 flow. Second operand has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:48,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:48,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 07:39:48,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:52,032 INFO L130 PetriNetUnfolder]: 12901/17947 cut-off events. [2022-12-06 07:39:52,032 INFO L131 PetriNetUnfolder]: For 58290/58290 co-relation queries the response was YES. [2022-12-06 07:39:52,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67717 conditions, 17947 events. 12901/17947 cut-off events. For 58290/58290 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 96110 event pairs, 1333 based on Foata normal form. 18/17964 useless extension candidates. Maximal degree in co-relation 67679. Up to 4269 conditions per place. [2022-12-06 07:39:52,113 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 117 selfloop transitions, 59 changer transitions 475/651 dead transitions. [2022-12-06 07:39:52,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 651 transitions, 4713 flow [2022-12-06 07:39:52,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 07:39:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 07:39:52,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 365 transitions. [2022-12-06 07:39:52,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45285359801488834 [2022-12-06 07:39:52,117 INFO L175 Difference]: Start difference. First operand has 61 places, 78 transitions, 433 flow. Second operand 26 states and 365 transitions. [2022-12-06 07:39:52,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 651 transitions, 4713 flow [2022-12-06 07:39:52,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 651 transitions, 4641 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-06 07:39:52,212 INFO L231 Difference]: Finished difference. Result has 105 places, 117 transitions, 981 flow [2022-12-06 07:39:52,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=981, PETRI_PLACES=105, PETRI_TRANSITIONS=117} [2022-12-06 07:39:52,213 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 65 predicate places. [2022-12-06 07:39:52,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:52,213 INFO L89 Accepts]: Start accepts. Operand has 105 places, 117 transitions, 981 flow [2022-12-06 07:39:52,216 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:52,216 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:52,216 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 117 transitions, 981 flow [2022-12-06 07:39:52,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 117 transitions, 981 flow [2022-12-06 07:39:52,289 INFO L130 PetriNetUnfolder]: 402/870 cut-off events. [2022-12-06 07:39:52,289 INFO L131 PetriNetUnfolder]: For 4898/4949 co-relation queries the response was YES. [2022-12-06 07:39:52,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3635 conditions, 870 events. 402/870 cut-off events. For 4898/4949 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4775 event pairs, 38 based on Foata normal form. 3/854 useless extension candidates. Maximal degree in co-relation 3549. Up to 230 conditions per place. [2022-12-06 07:39:52,299 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 117 transitions, 981 flow [2022-12-06 07:39:52,299 INFO L188 LiptonReduction]: Number of co-enabled transitions 1078 [2022-12-06 07:39:52,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [632] $Ultimate##0-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_252| v_~A~0.base_124)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_41| 4) v_~A~0.offset_124 (- 4)))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|) (= (store |v_#memory_int_252| v_~A~0.base_124 (store .cse0 .cse1 (+ .cse2 1))) |v_#memory_int_251|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| (ite (< .cse2 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_41| 1) (< |v_thread3Thread1of1ForFork0_~i~2#1_41| (+ 1 v_~N~0_91))))) InVars {~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, #memory_int=|v_#memory_int_252|, ~N~0=v_~N~0_91} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_19|, ~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_251|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_23|, ~N~0=v_~N~0_91, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_41|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_19|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_19|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-06 07:39:52,431 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [532] L84-4-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< .cse0 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|) (= (store |v_#memory_int_126| v_~A~0.base_66 (store .cse1 .cse2 (+ .cse0 1))) |v_#memory_int_125|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-06 07:39:52,483 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [612] L111-4-->L112-3: Formula: (and (= |v_#pthreadsForks_58| |v_ULTIMATE.start_main_#t~pre21#1_31|) (= |v_#memory_int_191| (store |v_#memory_int_192| |v_ULTIMATE.start_main_~#t3~0#1.base_29| (store (select |v_#memory_int_192| |v_ULTIMATE.start_main_~#t3~0#1.base_29|) |v_ULTIMATE.start_main_~#t3~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre21#1_31|))) (= (+ |v_#pthreadsForks_58| 1) |v_#pthreadsForks_57|)) InVars {#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_29|, #memory_int=|v_#memory_int_192|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_29|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_17|, #memory_int=|v_#memory_int_191|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_29|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_31|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet20#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 07:39:52,508 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [632] $Ultimate##0-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_252| v_~A~0.base_124)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_41| 4) v_~A~0.offset_124 (- 4)))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|) (= (store |v_#memory_int_252| v_~A~0.base_124 (store .cse0 .cse1 (+ .cse2 1))) |v_#memory_int_251|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| (ite (< .cse2 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_41| 1) (< |v_thread3Thread1of1ForFork0_~i~2#1_41| (+ 1 v_~N~0_91))))) InVars {~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, #memory_int=|v_#memory_int_252|, ~N~0=v_~N~0_91} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_19|, ~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_251|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_23|, ~N~0=v_~N~0_91, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_41|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_19|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_19|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-06 07:39:52,559 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [532] L84-4-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< .cse0 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|) (= (store |v_#memory_int_126| v_~A~0.base_66 (store .cse1 .cse2 (+ .cse0 1))) |v_#memory_int_125|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-06 07:39:52,820 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:39:52,820 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 607 [2022-12-06 07:39:52,821 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 114 transitions, 986 flow [2022-12-06 07:39:52,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:52,821 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:52,821 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:52,829 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 07:39:53,021 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 07:39:53,022 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:39:53,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:53,022 INFO L85 PathProgramCache]: Analyzing trace with hash -551739182, now seen corresponding path program 1 times [2022-12-06 07:39:53,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:53,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451417906] [2022-12-06 07:39:53,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:53,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:53,848 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 07:39:53,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:53,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451417906] [2022-12-06 07:39:53,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451417906] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:39:53,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189282829] [2022-12-06 07:39:53,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:53,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:39:53,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:39:53,850 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 07:39:53,876 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 07:39:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:53,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 07:39:53,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:39:54,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:39:54,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 07:39:54,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-06 07:39:54,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:39:54,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-06 07:39:54,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-06 07:39:54,221 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 07:39:54,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:39:58,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 07:39:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:39:58,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189282829] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 07:39:58,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 07:39:58,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 10] total 31 [2022-12-06 07:39:58,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550024468] [2022-12-06 07:39:58,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:58,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:39:58,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:58,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:39:58,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=882, Unknown=8, NotChecked=0, Total=1056 [2022-12-06 07:39:58,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:39:58,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 114 transitions, 986 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:58,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:58,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:39:58,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:40:00,235 INFO L130 PetriNetUnfolder]: 9061/12587 cut-off events. [2022-12-06 07:40:00,235 INFO L131 PetriNetUnfolder]: For 139638/139638 co-relation queries the response was YES. [2022-12-06 07:40:00,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64383 conditions, 12587 events. 9061/12587 cut-off events. For 139638/139638 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 63024 event pairs, 2411 based on Foata normal form. 7/12593 useless extension candidates. Maximal degree in co-relation 64289. Up to 6007 conditions per place. [2022-12-06 07:40:00,290 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 123 selfloop transitions, 19 changer transitions 230/372 dead transitions. [2022-12-06 07:40:00,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 372 transitions, 3896 flow [2022-12-06 07:40:00,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:40:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:40:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-12-06 07:40:00,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.346031746031746 [2022-12-06 07:40:00,292 INFO L175 Difference]: Start difference. First operand has 87 places, 114 transitions, 986 flow. Second operand 9 states and 109 transitions. [2022-12-06 07:40:00,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 372 transitions, 3896 flow [2022-12-06 07:40:00,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 372 transitions, 3613 flow, removed 135 selfloop flow, removed 18 redundant places. [2022-12-06 07:40:00,711 INFO L231 Difference]: Finished difference. Result has 83 places, 122 transitions, 1088 flow [2022-12-06 07:40:00,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1088, PETRI_PLACES=83, PETRI_TRANSITIONS=122} [2022-12-06 07:40:00,712 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2022-12-06 07:40:00,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:40:00,712 INFO L89 Accepts]: Start accepts. Operand has 83 places, 122 transitions, 1088 flow [2022-12-06 07:40:00,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:40:00,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:40:00,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 122 transitions, 1088 flow [2022-12-06 07:40:00,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 122 transitions, 1088 flow [2022-12-06 07:40:00,776 INFO L130 PetriNetUnfolder]: 359/809 cut-off events. [2022-12-06 07:40:00,776 INFO L131 PetriNetUnfolder]: For 3095/3150 co-relation queries the response was YES. [2022-12-06 07:40:00,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3354 conditions, 809 events. 359/809 cut-off events. For 3095/3150 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4369 event pairs, 9 based on Foata normal form. 10/798 useless extension candidates. Maximal degree in co-relation 3313. Up to 208 conditions per place. [2022-12-06 07:40:00,827 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 122 transitions, 1088 flow [2022-12-06 07:40:00,827 INFO L188 LiptonReduction]: Number of co-enabled transitions 1054 [2022-12-06 07:40:00,828 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:40:00,828 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-06 07:40:00,828 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 122 transitions, 1088 flow [2022-12-06 07:40:00,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:40:00,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:40:00,828 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:40:00,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 07:40:01,029 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 07:40:01,029 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:40:01,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:40:01,029 INFO L85 PathProgramCache]: Analyzing trace with hash -744074074, now seen corresponding path program 1 times [2022-12-06 07:40:01,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:40:01,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984647656] [2022-12-06 07:40:01,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:01,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:40:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:40:01,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:40:01,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984647656] [2022-12-06 07:40:01,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984647656] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:40:01,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822369116] [2022-12-06 07:40:01,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:01,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:40:01,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:40:01,688 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 07:40:01,691 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 07:40:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:01,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 07:40:01,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:40:01,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:01,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 07:40:01,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:01,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 07:40:01,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-06 07:40:02,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-06 07:40:02,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:40:02,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:40:02,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 63 [2022-12-06 07:40:02,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-06 07:40:02,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-06 07:40:02,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 140 [2022-12-06 07:40:02,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2022-12-06 07:40:02,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 104 [2022-12-06 07:40:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:40:02,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822369116] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:40:02,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:40:02,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-12-06 07:40:02,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989850765] [2022-12-06 07:40:02,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:40:02,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-06 07:40:02,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:40:02,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-06 07:40:02,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=779, Unknown=7, NotChecked=0, Total=930 [2022-12-06 07:40:02,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:40:02,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 122 transitions, 1088 flow. Second operand has 31 states, 30 states have (on average 2.7) internal successors, (81), 30 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:40:02,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:40:02,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:40:02,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:40:11,013 INFO L130 PetriNetUnfolder]: 18993/26561 cut-off events. [2022-12-06 07:40:11,013 INFO L131 PetriNetUnfolder]: For 170870/170870 co-relation queries the response was YES. [2022-12-06 07:40:11,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126068 conditions, 26561 events. 18993/26561 cut-off events. For 170870/170870 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 150009 event pairs, 758 based on Foata normal form. 33/26571 useless extension candidates. Maximal degree in co-relation 126001. Up to 6500 conditions per place. [2022-12-06 07:40:11,146 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 232 selfloop transitions, 115 changer transitions 1064/1411 dead transitions. [2022-12-06 07:40:11,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 1411 transitions, 12555 flow [2022-12-06 07:40:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-12-06 07:40:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2022-12-06 07:40:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 1002 transitions. [2022-12-06 07:40:11,149 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32532467532467535 [2022-12-06 07:40:11,149 INFO L175 Difference]: Start difference. First operand has 80 places, 122 transitions, 1088 flow. Second operand 88 states and 1002 transitions. [2022-12-06 07:40:11,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 1411 transitions, 12555 flow [2022-12-06 07:40:12,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 1411 transitions, 11670 flow, removed 433 selfloop flow, removed 7 redundant places. [2022-12-06 07:40:12,235 INFO L231 Difference]: Finished difference. Result has 238 places, 172 transitions, 2383 flow [2022-12-06 07:40:12,235 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=987, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=2383, PETRI_PLACES=238, PETRI_TRANSITIONS=172} [2022-12-06 07:40:12,235 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 198 predicate places. [2022-12-06 07:40:12,236 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:40:12,236 INFO L89 Accepts]: Start accepts. Operand has 238 places, 172 transitions, 2383 flow [2022-12-06 07:40:12,238 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:40:12,239 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:40:12,239 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 172 transitions, 2383 flow [2022-12-06 07:40:12,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 172 transitions, 2383 flow [2022-12-06 07:40:12,388 INFO L130 PetriNetUnfolder]: 448/1053 cut-off events. [2022-12-06 07:40:12,388 INFO L131 PetriNetUnfolder]: For 35217/35332 co-relation queries the response was YES. [2022-12-06 07:40:12,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7843 conditions, 1053 events. 448/1053 cut-off events. For 35217/35332 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5974 event pairs, 44 based on Foata normal form. 10/1037 useless extension candidates. Maximal degree in co-relation 7567. Up to 268 conditions per place. [2022-12-06 07:40:12,410 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 172 transitions, 2383 flow [2022-12-06 07:40:12,410 INFO L188 LiptonReduction]: Number of co-enabled transitions 1334 [2022-12-06 07:40:12,446 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:40:12,447 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-06 07:40:12,447 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 172 transitions, 2383 flow [2022-12-06 07:40:12,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 30 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:40:12,447 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:40:12,447 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:40:12,455 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 07:40:12,652 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 07:40:12,653 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:40:12,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:40:12,653 INFO L85 PathProgramCache]: Analyzing trace with hash 350538384, now seen corresponding path program 1 times [2022-12-06 07:40:12,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:40:12,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568769218] [2022-12-06 07:40:12,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:12,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:40:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:40:12,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:40:12,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568769218] [2022-12-06 07:40:12,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568769218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:40:12,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:40:12,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:40:12,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404710573] [2022-12-06 07:40:12,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:40:12,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:40:12,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:40:12,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:40:12,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:40:12,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:40:12,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 172 transitions, 2383 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 07:40:12,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:40:12,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:40:12,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:40:14,432 INFO L130 PetriNetUnfolder]: 6655/9549 cut-off events. [2022-12-06 07:40:14,433 INFO L131 PetriNetUnfolder]: For 512207/512207 co-relation queries the response was YES. [2022-12-06 07:40:14,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76103 conditions, 9549 events. 6655/9549 cut-off events. For 512207/512207 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 49315 event pairs, 848 based on Foata normal form. 11/9537 useless extension candidates. Maximal degree in co-relation 75762. Up to 3510 conditions per place. [2022-12-06 07:40:14,499 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 275 selfloop transitions, 59 changer transitions 33/367 dead transitions. [2022-12-06 07:40:14,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 367 transitions, 6246 flow [2022-12-06 07:40:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:40:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:40:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2022-12-06 07:40:14,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47346938775510206 [2022-12-06 07:40:14,500 INFO L175 Difference]: Start difference. First operand has 174 places, 172 transitions, 2383 flow. Second operand 7 states and 116 transitions. [2022-12-06 07:40:14,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 367 transitions, 6246 flow [2022-12-06 07:40:14,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 367 transitions, 4771 flow, removed 732 selfloop flow, removed 55 redundant places. [2022-12-06 07:40:14,863 INFO L231 Difference]: Finished difference. Result has 129 places, 194 transitions, 2325 flow [2022-12-06 07:40:14,863 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2325, PETRI_PLACES=129, PETRI_TRANSITIONS=194} [2022-12-06 07:40:14,864 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 89 predicate places. [2022-12-06 07:40:14,864 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:40:14,864 INFO L89 Accepts]: Start accepts. Operand has 129 places, 194 transitions, 2325 flow [2022-12-06 07:40:14,866 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:40:14,866 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:40:14,866 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 194 transitions, 2325 flow [2022-12-06 07:40:14,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 194 transitions, 2325 flow [2022-12-06 07:40:15,037 INFO L130 PetriNetUnfolder]: 695/1569 cut-off events. [2022-12-06 07:40:15,037 INFO L131 PetriNetUnfolder]: For 17604/17955 co-relation queries the response was YES. [2022-12-06 07:40:15,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9047 conditions, 1569 events. 695/1569 cut-off events. For 17604/17955 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9891 event pairs, 54 based on Foata normal form. 38/1583 useless extension candidates. Maximal degree in co-relation 8680. Up to 435 conditions per place. [2022-12-06 07:40:15,057 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 194 transitions, 2325 flow [2022-12-06 07:40:15,057 INFO L188 LiptonReduction]: Number of co-enabled transitions 1648 [2022-12-06 07:40:15,058 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:40:15,059 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 07:40:15,059 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 194 transitions, 2325 flow [2022-12-06 07:40:15,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 07:40:15,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:40:15,059 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:40:15,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:40:15,059 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:40:15,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:40:15,059 INFO L85 PathProgramCache]: Analyzing trace with hash -388125292, now seen corresponding path program 2 times [2022-12-06 07:40:15,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:40:15,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157681341] [2022-12-06 07:40:15,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:15,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:40:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:40:15,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:40:15,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157681341] [2022-12-06 07:40:15,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157681341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:40:15,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:40:15,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:40:15,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143225812] [2022-12-06 07:40:15,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:40:15,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:40:15,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:40:15,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:40:15,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:40:15,126 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:40:15,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 194 transitions, 2325 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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 07:40:15,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:40:15,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:40:15,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:40:16,399 INFO L130 PetriNetUnfolder]: 6966/10216 cut-off events. [2022-12-06 07:40:16,400 INFO L131 PetriNetUnfolder]: For 158759/158759 co-relation queries the response was YES. [2022-12-06 07:40:16,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64094 conditions, 10216 events. 6966/10216 cut-off events. For 158759/158759 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 54221 event pairs, 1648 based on Foata normal form. 135/10349 useless extension candidates. Maximal degree in co-relation 61559. Up to 4837 conditions per place. [2022-12-06 07:40:16,467 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 221 selfloop transitions, 5 changer transitions 66/292 dead transitions. [2022-12-06 07:40:16,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 292 transitions, 3964 flow [2022-12-06 07:40:16,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:40:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:40:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-06 07:40:16,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-06 07:40:16,468 INFO L175 Difference]: Start difference. First operand has 129 places, 194 transitions, 2325 flow. Second operand 6 states and 80 transitions. [2022-12-06 07:40:16,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 292 transitions, 3964 flow [2022-12-06 07:40:16,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 292 transitions, 3898 flow, removed 31 selfloop flow, removed 3 redundant places. [2022-12-06 07:40:16,721 INFO L231 Difference]: Finished difference. Result has 134 places, 195 transitions, 2375 flow [2022-12-06 07:40:16,724 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2285, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2375, PETRI_PLACES=134, PETRI_TRANSITIONS=195} [2022-12-06 07:40:16,725 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 94 predicate places. [2022-12-06 07:40:16,725 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:40:16,725 INFO L89 Accepts]: Start accepts. Operand has 134 places, 195 transitions, 2375 flow [2022-12-06 07:40:16,727 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:40:16,727 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:40:16,727 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 195 transitions, 2375 flow [2022-12-06 07:40:16,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 195 transitions, 2375 flow [2022-12-06 07:40:16,885 INFO L130 PetriNetUnfolder]: 647/1448 cut-off events. [2022-12-06 07:40:16,885 INFO L131 PetriNetUnfolder]: For 15302/15593 co-relation queries the response was YES. [2022-12-06 07:40:16,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8413 conditions, 1448 events. 647/1448 cut-off events. For 15302/15593 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8942 event pairs, 53 based on Foata normal form. 35/1457 useless extension candidates. Maximal degree in co-relation 8351. Up to 386 conditions per place. [2022-12-06 07:40:16,908 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 195 transitions, 2375 flow [2022-12-06 07:40:16,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 1648 [2022-12-06 07:40:18,781 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:40:18,782 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2057 [2022-12-06 07:40:18,782 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 194 transitions, 2371 flow [2022-12-06 07:40:18,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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 07:40:18,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:40:18,782 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:40:18,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 07:40:18,782 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:40:18,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:40:18,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1098667857, now seen corresponding path program 1 times [2022-12-06 07:40:18,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:40:18,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111029422] [2022-12-06 07:40:18,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:18,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:40:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 07:40:18,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:40:18,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111029422] [2022-12-06 07:40:18,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111029422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:40:18,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:40:18,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:40:18,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811528550] [2022-12-06 07:40:18,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:40:18,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:40:18,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:40:18,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:40:18,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:40:18,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:40:18,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 194 transitions, 2371 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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 07:40:18,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:40:18,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:40:18,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:40:19,894 INFO L130 PetriNetUnfolder]: 6028/8671 cut-off events. [2022-12-06 07:40:19,894 INFO L131 PetriNetUnfolder]: For 128358/128358 co-relation queries the response was YES. [2022-12-06 07:40:19,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55400 conditions, 8671 events. 6028/8671 cut-off events. For 128358/128358 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 42897 event pairs, 2382 based on Foata normal form. 212/8882 useless extension candidates. Maximal degree in co-relation 55336. Up to 6866 conditions per place. [2022-12-06 07:40:19,947 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 176 selfloop transitions, 55 changer transitions 0/231 dead transitions. [2022-12-06 07:40:19,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 231 transitions, 3303 flow [2022-12-06 07:40:19,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:40:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:40:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 07:40:19,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2022-12-06 07:40:19,948 INFO L175 Difference]: Start difference. First operand has 131 places, 194 transitions, 2371 flow. Second operand 4 states and 52 transitions. [2022-12-06 07:40:19,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 231 transitions, 3303 flow [2022-12-06 07:40:20,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 231 transitions, 3181 flow, removed 60 selfloop flow, removed 5 redundant places. [2022-12-06 07:40:20,147 INFO L231 Difference]: Finished difference. Result has 127 places, 191 transitions, 2365 flow [2022-12-06 07:40:20,147 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2255, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2365, PETRI_PLACES=127, PETRI_TRANSITIONS=191} [2022-12-06 07:40:20,147 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 87 predicate places. [2022-12-06 07:40:20,147 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:40:20,148 INFO L89 Accepts]: Start accepts. Operand has 127 places, 191 transitions, 2365 flow [2022-12-06 07:40:20,150 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:40:20,150 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:40:20,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 191 transitions, 2365 flow [2022-12-06 07:40:20,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 191 transitions, 2365 flow [2022-12-06 07:40:20,333 INFO L130 PetriNetUnfolder]: 625/1382 cut-off events. [2022-12-06 07:40:20,333 INFO L131 PetriNetUnfolder]: For 15811/16051 co-relation queries the response was YES. [2022-12-06 07:40:20,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8331 conditions, 1382 events. 625/1382 cut-off events. For 15811/16051 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8366 event pairs, 52 based on Foata normal form. 28/1382 useless extension candidates. Maximal degree in co-relation 8002. Up to 348 conditions per place. [2022-12-06 07:40:20,349 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 191 transitions, 2365 flow [2022-12-06 07:40:20,349 INFO L188 LiptonReduction]: Number of co-enabled transitions 1508 [2022-12-06 07:40:20,391 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:40:20,392 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 245 [2022-12-06 07:40:20,392 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 191 transitions, 2365 flow [2022-12-06 07:40:20,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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 07:40:20,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:40:20,392 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:40:20,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:40:20,392 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:40:20,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:40:20,393 INFO L85 PathProgramCache]: Analyzing trace with hash 233517695, now seen corresponding path program 1 times [2022-12-06 07:40:20,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:40:20,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582367755] [2022-12-06 07:40:20,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:20,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:40:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:40:20,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:40:20,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582367755] [2022-12-06 07:40:20,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582367755] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:40:20,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156834327] [2022-12-06 07:40:20,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:20,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:40:20,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:40:20,467 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 07:40:20,468 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 07:40:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:20,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:40:20,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:40:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:40:20,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:40:20,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156834327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:40:20,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:40:20,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-12-06 07:40:20,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123517490] [2022-12-06 07:40:20,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:40:20,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:40:20,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:40:20,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:40:20,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:40:20,672 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:40:20,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 191 transitions, 2365 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 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 07:40:20,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:40:20,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:40:20,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:40:22,002 INFO L130 PetriNetUnfolder]: 6766/9968 cut-off events. [2022-12-06 07:40:22,002 INFO L131 PetriNetUnfolder]: For 141305/141305 co-relation queries the response was YES. [2022-12-06 07:40:22,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63352 conditions, 9968 events. 6766/9968 cut-off events. For 141305/141305 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 52262 event pairs, 3306 based on Foata normal form. 125/10091 useless extension candidates. Maximal degree in co-relation 61016. Up to 8672 conditions per place. [2022-12-06 07:40:22,050 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 190 selfloop transitions, 2 changer transitions 98/290 dead transitions. [2022-12-06 07:40:22,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 290 transitions, 4079 flow [2022-12-06 07:40:22,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:40:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:40:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-06 07:40:22,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-06 07:40:22,051 INFO L175 Difference]: Start difference. First operand has 127 places, 191 transitions, 2365 flow. Second operand 6 states and 75 transitions. [2022-12-06 07:40:22,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 290 transitions, 4079 flow [2022-12-06 07:40:22,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 290 transitions, 3917 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 07:40:22,243 INFO L231 Difference]: Finished difference. Result has 133 places, 192 transitions, 2373 flow [2022-12-06 07:40:22,244 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2255, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2373, PETRI_PLACES=133, PETRI_TRANSITIONS=192} [2022-12-06 07:40:22,244 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 93 predicate places. [2022-12-06 07:40:22,244 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:40:22,244 INFO L89 Accepts]: Start accepts. Operand has 133 places, 192 transitions, 2373 flow [2022-12-06 07:40:22,245 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:40:22,245 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:40:22,245 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 192 transitions, 2373 flow [2022-12-06 07:40:22,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 192 transitions, 2373 flow [2022-12-06 07:40:22,364 INFO L130 PetriNetUnfolder]: 623/1383 cut-off events. [2022-12-06 07:40:22,364 INFO L131 PetriNetUnfolder]: For 15170/15415 co-relation queries the response was YES. [2022-12-06 07:40:22,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8204 conditions, 1383 events. 623/1383 cut-off events. For 15170/15415 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8359 event pairs, 52 based on Foata normal form. 29/1386 useless extension candidates. Maximal degree in co-relation 8146. Up to 345 conditions per place. [2022-12-06 07:40:22,382 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 192 transitions, 2373 flow [2022-12-06 07:40:22,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 1508 [2022-12-06 07:40:24,327 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:40:24,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2084 [2022-12-06 07:40:24,328 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 191 transitions, 2369 flow [2022-12-06 07:40:24,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 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 07:40:24,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:40:24,328 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:40:24,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 07:40:24,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 07:40:24,529 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:40:24,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:40:24,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1182630804, now seen corresponding path program 1 times [2022-12-06 07:40:24,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:40:24,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321147602] [2022-12-06 07:40:24,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:24,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:40:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:40:24,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:40:24,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321147602] [2022-12-06 07:40:24,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321147602] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:40:24,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550810262] [2022-12-06 07:40:24,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:24,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:40:24,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:40:24,648 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 07:40:24,670 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 07:40:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:24,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:40:24,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:40:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:40:24,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:40:24,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:40:24,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550810262] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:40:24,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:40:24,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2022-12-06 07:40:24,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493167712] [2022-12-06 07:40:24,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:40:24,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:40:24,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:40:24,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:40:24,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:40:24,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:40:24,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 191 transitions, 2369 flow. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:40:24,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:40:24,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:40:24,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:40:26,923 INFO L130 PetriNetUnfolder]: 10117/14383 cut-off events. [2022-12-06 07:40:26,923 INFO L131 PetriNetUnfolder]: For 203342/203342 co-relation queries the response was YES. [2022-12-06 07:40:26,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96087 conditions, 14383 events. 10117/14383 cut-off events. For 203342/203342 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 77432 event pairs, 2200 based on Foata normal form. 1496/15878 useless extension candidates. Maximal degree in co-relation 96029. Up to 6958 conditions per place. [2022-12-06 07:40:27,007 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 330 selfloop transitions, 73 changer transitions 0/403 dead transitions. [2022-12-06 07:40:27,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 403 transitions, 5727 flow [2022-12-06 07:40:27,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:40:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:40:27,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-12-06 07:40:27,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39591836734693875 [2022-12-06 07:40:27,008 INFO L175 Difference]: Start difference. First operand has 129 places, 191 transitions, 2369 flow. Second operand 7 states and 97 transitions. [2022-12-06 07:40:27,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 403 transitions, 5727 flow [2022-12-06 07:40:27,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 403 transitions, 5515 flow, removed 106 selfloop flow, removed 5 redundant places. [2022-12-06 07:40:27,179 INFO L231 Difference]: Finished difference. Result has 133 places, 206 transitions, 2716 flow [2022-12-06 07:40:27,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2716, PETRI_PLACES=133, PETRI_TRANSITIONS=206} [2022-12-06 07:40:27,180 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 93 predicate places. [2022-12-06 07:40:27,180 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:40:27,180 INFO L89 Accepts]: Start accepts. Operand has 133 places, 206 transitions, 2716 flow [2022-12-06 07:40:27,181 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:40:27,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:40:27,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 206 transitions, 2716 flow [2022-12-06 07:40:27,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 206 transitions, 2716 flow [2022-12-06 07:40:27,448 INFO L130 PetriNetUnfolder]: 1032/2254 cut-off events. [2022-12-06 07:40:27,448 INFO L131 PetriNetUnfolder]: For 31458/31877 co-relation queries the response was YES. [2022-12-06 07:40:27,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16001 conditions, 2254 events. 1032/2254 cut-off events. For 31458/31877 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15391 event pairs, 157 based on Foata normal form. 77/2271 useless extension candidates. Maximal degree in co-relation 15164. Up to 705 conditions per place. [2022-12-06 07:40:27,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 206 transitions, 2716 flow [2022-12-06 07:40:27,484 INFO L188 LiptonReduction]: Number of co-enabled transitions 1860 [2022-12-06 07:40:27,508 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:40:27,508 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 328 [2022-12-06 07:40:27,508 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 206 transitions, 2716 flow [2022-12-06 07:40:27,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:40:27,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:40:27,509 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:40:27,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 07:40:27,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:40:27,714 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:40:27,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:40:27,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1316109578, now seen corresponding path program 1 times [2022-12-06 07:40:27,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:40:27,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103973471] [2022-12-06 07:40:27,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:27,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:40:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:40:27,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:40:27,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103973471] [2022-12-06 07:40:27,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103973471] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:40:27,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423541575] [2022-12-06 07:40:27,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:27,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:40:27,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:40:27,793 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 07:40:27,797 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 07:40:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:27,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:40:27,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:40:27,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:40:27,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:40:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:40:27,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423541575] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:40:27,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:40:27,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-06 07:40:27,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430323341] [2022-12-06 07:40:27,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:40:27,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:40:27,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:40:27,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:40:27,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:40:27,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:40:27,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 206 transitions, 2716 flow. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:40:27,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:40:27,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:40:27,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:40:29,982 INFO L130 PetriNetUnfolder]: 11493/16183 cut-off events. [2022-12-06 07:40:29,982 INFO L131 PetriNetUnfolder]: For 281109/281109 co-relation queries the response was YES. [2022-12-06 07:40:30,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115816 conditions, 16183 events. 11493/16183 cut-off events. For 281109/281109 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 83413 event pairs, 3476 based on Foata normal form. 1188/17370 useless extension candidates. Maximal degree in co-relation 106726. Up to 9397 conditions per place. [2022-12-06 07:40:30,092 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 301 selfloop transitions, 23 changer transitions 4/328 dead transitions. [2022-12-06 07:40:30,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 328 transitions, 5223 flow [2022-12-06 07:40:30,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:40:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:40:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-12-06 07:40:30,093 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.319047619047619 [2022-12-06 07:40:30,093 INFO L175 Difference]: Start difference. First operand has 133 places, 206 transitions, 2716 flow. Second operand 6 states and 67 transitions. [2022-12-06 07:40:30,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 328 transitions, 5223 flow [2022-12-06 07:40:30,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 328 transitions, 5047 flow, removed 36 selfloop flow, removed 2 redundant places. [2022-12-06 07:40:30,338 INFO L231 Difference]: Finished difference. Result has 138 places, 212 transitions, 2763 flow [2022-12-06 07:40:30,338 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2632, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2763, PETRI_PLACES=138, PETRI_TRANSITIONS=212} [2022-12-06 07:40:30,339 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 98 predicate places. [2022-12-06 07:40:30,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:40:30,339 INFO L89 Accepts]: Start accepts. Operand has 138 places, 212 transitions, 2763 flow [2022-12-06 07:40:30,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:40:30,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:40:30,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 212 transitions, 2763 flow [2022-12-06 07:40:30,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 212 transitions, 2763 flow [2022-12-06 07:40:30,688 INFO L130 PetriNetUnfolder]: 1229/2619 cut-off events. [2022-12-06 07:40:30,688 INFO L131 PetriNetUnfolder]: For 36289/36608 co-relation queries the response was YES. [2022-12-06 07:40:30,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17949 conditions, 2619 events. 1229/2619 cut-off events. For 36289/36608 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17940 event pairs, 213 based on Foata normal form. 82/2641 useless extension candidates. Maximal degree in co-relation 16848. Up to 599 conditions per place. [2022-12-06 07:40:30,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 212 transitions, 2763 flow [2022-12-06 07:40:30,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 1838 [2022-12-06 07:40:30,739 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] L56-4-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_77) (let ((.cse1 (select (select |v_#memory_int_213| v_~A~0.base_104) (+ v_~A~0.offset_104 (* v_thread1Thread1of1ForFork1_~i~0_36 4))))) (let ((.cse0 (< v_~min~0_74 .cse1))) (or (and (not .cse0) (= v_~min~0_73 |v_thread1_#t~mem4_35|) (= .cse1 |v_thread1_#t~mem4_35|)) (and (= |v_thread1_#t~mem4_35| |v_thread1Thread1of1ForFork1_#t~mem4_22|) (= v_~min~0_74 v_~min~0_73) .cse0))))) InVars {~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_22|, ~min~0=v_~min~0_74, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_77} OutVars{~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_13|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_17|, ~min~0=v_~min~0_73, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_77, thread1Thread1of1ForFork1_#t~ite5=|v_thread1Thread1of1ForFork1_#t~ite5_13|} AuxVars[|v_thread1_#t~mem4_35|] AssignedVars[thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~post2, ~min~0, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~ite5] and [532] L84-4-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< .cse0 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|) (= (store |v_#memory_int_126| v_~A~0.base_66 (store .cse1 .cse2 (+ .cse0 1))) |v_#memory_int_125|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-06 07:40:30,877 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:40:30,878 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 539 [2022-12-06 07:40:30,878 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 212 transitions, 2771 flow [2022-12-06 07:40:30,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:40:30,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:40:30,878 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:40:30,884 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 07:40:31,083 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,SelfDestructingSolverStorable16 [2022-12-06 07:40:31,084 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:40:31,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:40:31,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1518170262, now seen corresponding path program 1 times [2022-12-06 07:40:31,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:40:31,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147860228] [2022-12-06 07:40:31,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:31,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:40:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:31,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 07:40:31,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:40:31,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147860228] [2022-12-06 07:40:31,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147860228] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:40:31,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080045315] [2022-12-06 07:40:31,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:31,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:40:31,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:40:31,888 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 07:40:31,890 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 07:40:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:32,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 07:40:32,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:40:32,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:32,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 07:40:32,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:32,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-12-06 07:40:32,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:40:32,307 INFO L321 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2022-12-06 07:40:32,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 66 [2022-12-06 07:40:32,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:32,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-06 07:40:32,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:32,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-06 07:40:32,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-06 07:40:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-06 07:40:32,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:40:51,509 WARN L233 SmtUtils]: Spent 11.14s on a formula simplification. DAG size of input: 151 DAG size of output: 149 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:40:51,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6245 treesize of output 5981 [2022-12-06 07:40:53,337 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:40:53,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 6082 treesize of output 6579 [2022-12-06 07:40:55,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:40:55,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 5611 treesize of output 6089 [2022-12-06 07:40:56,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:40:56,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5050 treesize of output 4933 [2022-12-06 07:40:56,882 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:40:56,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4938 treesize of output 4893 [2022-12-06 07:40:57,399 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:40:57,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4898 treesize of output 4845 [2022-12-06 07:40:58,004 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:40:58,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4866 treesize of output 4749 [2022-12-06 07:40:58,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:40:58,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4746 treesize of output 4729 [2022-12-06 07:40:59,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:40:59,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4726 treesize of output 4709 [2022-12-06 07:40:59,539 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-06 07:40:59,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:40:59,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4730 treesize of output 4637 [2022-12-06 07:41:00,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:41:00,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4634 treesize of output 4613 Received shutdown request... [2022-12-06 07:52:51,236 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 07:52:51,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 07:52:51,248 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:52:51,248 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:52:51,268 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 07:52:51,443 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,SelfDestructingSolverStorable17 [2022-12-06 07:52:51,443 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 34 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 16ms.. [2022-12-06 07:52:51,444 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 07:52:51,444 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 07:52:51,444 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 07:52:51,444 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 07:52:51,445 INFO L458 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:51,447 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:52:51,447 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:52:51,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:52:51 BasicIcfg [2022-12-06 07:52:51,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:52:51,450 INFO L158 Benchmark]: Toolchain (without parser) took 855588.34ms. Allocated memory was 231.7MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 207.7MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2022-12-06 07:52:51,450 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 231.7MB. Free memory was 208.4MB in the beginning and 208.3MB in the end (delta: 92.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:52:51,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.59ms. Allocated memory is still 231.7MB. Free memory was 207.7MB in the beginning and 193.4MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 07:52:51,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.59ms. Allocated memory is still 231.7MB. Free memory was 193.4MB in the beginning and 191.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:52:51,451 INFO L158 Benchmark]: Boogie Preprocessor took 46.35ms. Allocated memory is still 231.7MB. Free memory was 191.9MB in the beginning and 189.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:52:51,451 INFO L158 Benchmark]: RCFGBuilder took 608.83ms. Allocated memory is still 231.7MB. Free memory was 189.8MB in the beginning and 166.2MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 07:52:51,452 INFO L158 Benchmark]: TraceAbstraction took 854628.09ms. Allocated memory was 231.7MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 165.1MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2022-12-06 07:52:51,453 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.12ms. Allocated memory is still 231.7MB. Free memory was 208.4MB in the beginning and 208.3MB in the end (delta: 92.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.59ms. Allocated memory is still 231.7MB. Free memory was 207.7MB in the beginning and 193.4MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.59ms. Allocated memory is still 231.7MB. Free memory was 193.4MB in the beginning and 191.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.35ms. Allocated memory is still 231.7MB. Free memory was 191.9MB in the beginning and 189.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 608.83ms. Allocated memory is still 231.7MB. Free memory was 189.8MB in the beginning and 166.2MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 854628.09ms. Allocated memory was 231.7MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 165.1MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 145 PlacesBefore, 40 PlacesAfterwards, 144 TransitionsBefore, 31 TransitionsAfterwards, 2280 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 66 TrivialYvCompositions, 39 ConcurrentYvCompositions, 8 ChoiceCompositions, 113 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1331, independent: 1309, independent conditional: 1309, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1331, independent: 1309, independent conditional: 0, independent unconditional: 1309, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1331, independent: 1309, independent conditional: 0, independent unconditional: 1309, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1331, independent: 1309, independent conditional: 0, independent unconditional: 1309, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1267, independent: 1249, independent conditional: 0, independent unconditional: 1249, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1267, independent: 1249, independent conditional: 0, independent unconditional: 1249, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1331, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 1267, unknown conditional: 0, unknown unconditional: 1267] , Statistics on independence cache: Total cache size (in pairs): 2030, Positive cache size: 2012, Positive conditional cache size: 0, Positive unconditional cache size: 2012, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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, 36 PlacesBefore, 36 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 63, independent: 55, independent conditional: 43, independent unconditional: 12, dependent: 8, dependent conditional: 5, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 55, independent conditional: 14, independent unconditional: 41, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 55, independent conditional: 14, independent unconditional: 41, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 47, independent: 40, independent conditional: 10, independent unconditional: 30, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 47, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 8, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 15, independent conditional: 4, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 47, unknown conditional: 12, unknown unconditional: 35] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 40, Positive conditional cache size: 10, Positive unconditional cache size: 30, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 37 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, independent: 93, independent conditional: 93, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 105, independent: 93, independent conditional: 29, independent unconditional: 64, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 106, independent: 93, independent conditional: 14, independent unconditional: 79, dependent: 13, dependent conditional: 5, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 106, independent: 93, independent conditional: 14, independent unconditional: 79, dependent: 13, dependent conditional: 5, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 6, independent unconditional: 16, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, independent: 71, independent conditional: 8, independent unconditional: 63, dependent: 9, dependent conditional: 1, dependent unconditional: 8, unknown: 26, unknown conditional: 10, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 65, Positive conditional cache size: 16, Positive unconditional cache size: 49, Negative cache size: 11, Negative conditional cache size: 6, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 73, independent conditional: 73, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 83, independent: 73, independent conditional: 47, independent unconditional: 26, dependent: 10, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 83, independent: 73, independent conditional: 27, independent unconditional: 46, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 83, independent: 73, independent conditional: 27, independent unconditional: 46, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 9, independent unconditional: 7, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, independent: 57, independent conditional: 18, independent unconditional: 39, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 19, unknown conditional: 11, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 81, Positive conditional cache size: 25, Positive unconditional cache size: 56, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 39 PlacesBefore, 38 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 132, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 132, independent: 116, independent conditional: 16, independent unconditional: 100, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 132, independent: 116, independent conditional: 16, independent unconditional: 100, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 132, independent: 116, independent conditional: 16, independent unconditional: 100, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, independent: 110, independent conditional: 15, independent unconditional: 95, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 87, Positive conditional cache size: 26, Positive unconditional cache size: 61, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, 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, 83 PlacesBefore, 83 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 1518 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): 101, Positive cache size: 87, Positive conditional cache size: 26, Positive unconditional cache size: 61, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, 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, 67 PlacesBefore, 67 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 858 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): 101, Positive cache size: 87, Positive conditional cache size: 26, Positive unconditional cache size: 61, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, 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, 62 PlacesBefore, 62 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 872 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): 101, Positive cache size: 87, Positive conditional cache size: 26, Positive unconditional cache size: 61, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, 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, 61 PlacesBefore, 61 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 742 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): 101, Positive cache size: 87, Positive conditional cache size: 26, Positive unconditional cache size: 61, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, 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, 88 PlacesBefore, 87 PlacesAfterwards, 117 TransitionsBefore, 114 TransitionsAfterwards, 1078 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 55, independent conditional: 55, 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: 55, independent: 55, independent conditional: 55, 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: 55, independent: 55, independent conditional: 37, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 55, independent conditional: 37, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 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: 55, independent: 45, independent conditional: 27, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 117, Positive conditional cache size: 36, Positive unconditional cache size: 81, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 122 TransitionsBefore, 122 TransitionsAfterwards, 1054 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): 131, Positive cache size: 117, Positive conditional cache size: 36, Positive unconditional cache size: 81, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, 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, 174 PlacesBefore, 174 PlacesAfterwards, 172 TransitionsBefore, 172 TransitionsAfterwards, 1334 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 133, Positive conditional cache size: 52, Positive unconditional cache size: 81, Negative cache size: 25, Negative conditional cache size: 19, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 129 PlacesBefore, 129 PlacesAfterwards, 194 TransitionsBefore, 194 TransitionsAfterwards, 1648 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 10, independent conditional: 10, 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: 16, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 134, Positive conditional cache size: 53, Positive unconditional cache size: 81, Negative cache size: 25, Negative conditional cache size: 19, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 132 PlacesBefore, 131 PlacesAfterwards, 195 TransitionsBefore, 194 TransitionsAfterwards, 1648 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 134, Positive conditional cache size: 53, Positive unconditional cache size: 81, Negative cache size: 25, Negative conditional cache size: 19, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 127 PlacesBefore, 127 PlacesAfterwards, 191 TransitionsBefore, 191 TransitionsAfterwards, 1508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 12, 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: 18, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 136, Positive conditional cache size: 55, Positive unconditional cache size: 81, Negative cache size: 30, Negative conditional cache size: 24, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 130 PlacesBefore, 129 PlacesAfterwards, 192 TransitionsBefore, 191 TransitionsAfterwards, 1508 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 136, Positive conditional cache size: 55, Positive unconditional cache size: 81, Negative cache size: 30, Negative conditional cache size: 24, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 133 PlacesBefore, 133 PlacesAfterwards, 206 TransitionsBefore, 206 TransitionsAfterwards, 1860 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 136, Positive conditional cache size: 55, Positive unconditional cache size: 81, Negative cache size: 34, Negative conditional cache size: 28, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 138 PlacesBefore, 138 PlacesAfterwards, 212 TransitionsBefore, 212 TransitionsAfterwards, 1838 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 10, 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: 12, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 149, Positive conditional cache size: 66, Positive unconditional cache size: 83, Negative cache size: 36, Negative conditional cache size: 30, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 34 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 16ms.. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 34 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 16ms.. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 34 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 16ms.. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 34 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 16ms.. - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 34 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 16ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 188 locations, 5 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: 854.5s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 83.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4920 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4920 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 969 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 563 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6878 IncrementalHoareTripleChecker+Invalid, 8410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 563 mSolverCounterUnsat, 1 mSDtfsCounter, 6878 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 708 GetRequests, 336 SyntacticMatches, 20 SemanticMatches, 352 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 6891 ImplicationChecksByTransitivity, 65.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2771occurred in iteration=17, InterpolantAutomatonStates: 233, 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.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 717 NumberOfCodeBlocks, 717 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 886 ConstructedInterpolants, 33 QuantifiedInterpolants, 6832 SizeOfPredicates, 96 NumberOfNonLiveVariables, 2374 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 68/93 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown