/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:09:44,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:09:44,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:09:44,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:09:44,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:09:44,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:09:44,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:09:44,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:09:44,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:09:44,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:09:44,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:09:44,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:09:44,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:09:44,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:09:44,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:09:44,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:09:44,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:09:44,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:09:44,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:09:44,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:09:44,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:09:44,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:09:44,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:09:44,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:09:44,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:09:44,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:09:44,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:09:44,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:09:44,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:09:44,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:09:44,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:09:44,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:09:44,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:09:44,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:09:44,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:09:44,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:09:44,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:09:44,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:09:44,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:09:44,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:09:44,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:09:44,508 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-RepeatedSemanticLbe.epf [2022-12-06 00:09:44,535 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:09:44,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:09:44,537 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:09:44,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:09:44,537 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:09:44,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:09:44,538 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:09:44,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:09:44,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:09:44,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:09:44,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:09:44,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:09:44,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:09:44,539 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:09:44,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:09:44,540 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:09:44,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:09:44,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:09:44,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:09:44,540 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:09:44,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:09:44,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:09:44,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:09:44,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:09:44,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:09:44,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:09:44,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:09:44,541 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:09:44,541 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 00:09:44,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:09:44,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:09:44,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:09:44,838 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:09:44,838 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:09:44,839 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c [2022-12-06 00:09:45,905 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:09:46,090 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:09:46,090 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c [2022-12-06 00:09:46,112 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9979c5f/b6a072b1b355420abbe52585cd71b120/FLAG5517281fc [2022-12-06 00:09:46,123 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9979c5f/b6a072b1b355420abbe52585cd71b120 [2022-12-06 00:09:46,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:09:46,125 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:09:46,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:09:46,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:09:46,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:09:46,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:09:46" (1/1) ... [2022-12-06 00:09:46,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17be83a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:46, skipping insertion in model container [2022-12-06 00:09:46,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:09:46" (1/1) ... [2022-12-06 00:09:46,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:09:46,157 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:09:46,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:46,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:46,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:46,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:46,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:46,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:46,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:46,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:46,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:46,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:46,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:46,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:46,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:46,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:46,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:46,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:46,276 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-bad-ring-nondet.wvr.c[4085,4098] [2022-12-06 00:09:46,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:09:46,293 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:09:46,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:46,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:46,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:46,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:46,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:46,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:46,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:46,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:46,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:46,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:46,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:46,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:46,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:46,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:46,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:46,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:46,316 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-bad-ring-nondet.wvr.c[4085,4098] [2022-12-06 00:09:46,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:09:46,330 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:09:46,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:46 WrapperNode [2022-12-06 00:09:46,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:09:46,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:09:46,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:09:46,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:09:46,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:46" (1/1) ... [2022-12-06 00:09:46,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:46" (1/1) ... [2022-12-06 00:09:46,366 INFO L138 Inliner]: procedures = 25, calls = 63, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 317 [2022-12-06 00:09:46,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:09:46,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:09:46,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:09:46,368 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:09:46,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:46" (1/1) ... [2022-12-06 00:09:46,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:46" (1/1) ... [2022-12-06 00:09:46,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:46" (1/1) ... [2022-12-06 00:09:46,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:46" (1/1) ... [2022-12-06 00:09:46,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:46" (1/1) ... [2022-12-06 00:09:46,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:46" (1/1) ... [2022-12-06 00:09:46,390 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:46" (1/1) ... [2022-12-06 00:09:46,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:46" (1/1) ... [2022-12-06 00:09:46,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:09:46,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:09:46,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:09:46,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:09:46,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:46" (1/1) ... [2022-12-06 00:09:46,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:09:46,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:09:46,436 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 00:09:46,453 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 00:09:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:09:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:09:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:09:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:09:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:09:46,476 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:09:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:09:46,477 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:09:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:09:46,477 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:09:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:09:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:09:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:09:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:09:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:09:46,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:09:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:09:46,478 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 00:09:46,616 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:09:46,617 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:09:46,903 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:09:46,995 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:09:46,996 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 00:09:46,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:09:46 BoogieIcfgContainer [2022-12-06 00:09:46,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:09:47,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:09:47,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:09:47,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:09:47,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:09:46" (1/3) ... [2022-12-06 00:09:47,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731e0ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:09:47, skipping insertion in model container [2022-12-06 00:09:47,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:46" (2/3) ... [2022-12-06 00:09:47,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731e0ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:09:47, skipping insertion in model container [2022-12-06 00:09:47,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:09:46" (3/3) ... [2022-12-06 00:09:47,006 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring-nondet.wvr.c [2022-12-06 00:09:47,018 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:09:47,018 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:09:47,018 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:09:47,090 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 00:09:47,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 241 places, 256 transitions, 536 flow [2022-12-06 00:09:47,229 INFO L130 PetriNetUnfolder]: 25/253 cut-off events. [2022-12-06 00:09:47,230 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:09:47,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 253 events. 25/253 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 206 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 215. Up to 4 conditions per place. [2022-12-06 00:09:47,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 241 places, 256 transitions, 536 flow [2022-12-06 00:09:47,243 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 243 transitions, 504 flow [2022-12-06 00:09:47,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:47,260 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 243 transitions, 504 flow [2022-12-06 00:09:47,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 243 transitions, 504 flow [2022-12-06 00:09:47,304 INFO L130 PetriNetUnfolder]: 25/243 cut-off events. [2022-12-06 00:09:47,304 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:09:47,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 243 events. 25/243 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 204 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 215. Up to 4 conditions per place. [2022-12-06 00:09:47,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 243 transitions, 504 flow [2022-12-06 00:09:47,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 2820 [2022-12-06 00:09:55,842 INFO L203 LiptonReduction]: Total number of compositions: 210 [2022-12-06 00:09:55,853 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:09:55,858 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;@3bdf8163, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:09:55,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 00:09:55,863 INFO L130 PetriNetUnfolder]: 8/32 cut-off events. [2022-12-06 00:09:55,863 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:09:55,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:55,864 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] [2022-12-06 00:09:55,864 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 1 more)] === [2022-12-06 00:09:55,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:55,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1935456720, now seen corresponding path program 1 times [2022-12-06 00:09:55,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:55,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351353101] [2022-12-06 00:09:55,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:55,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:56,199 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 00:09:56,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:56,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351353101] [2022-12-06 00:09:56,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351353101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:56,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:56,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:09:56,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300882902] [2022-12-06 00:09:56,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:56,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:09:56,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:56,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:09:56,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:09:56,230 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 00:09:56,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:56,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:56,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 00:09:56,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:56,370 INFO L130 PetriNetUnfolder]: 472/693 cut-off events. [2022-12-06 00:09:56,370 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-06 00:09:56,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 693 events. 472/693 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2150 event pairs, 135 based on Foata normal form. 30/576 useless extension candidates. Maximal degree in co-relation 1219. Up to 449 conditions per place. [2022-12-06 00:09:56,374 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 40 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2022-12-06 00:09:56,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 198 flow [2022-12-06 00:09:56,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:09:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:09:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 00:09:56,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2022-12-06 00:09:56,383 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 84 flow. Second operand 3 states and 52 transitions. [2022-12-06 00:09:56,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 198 flow [2022-12-06 00:09:56,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 44 transitions, 182 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 00:09:56,388 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 89 flow [2022-12-06 00:09:56,389 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2022-12-06 00:09:56,391 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-06 00:09:56,391 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:56,392 INFO L89 Accepts]: Start accepts. Operand has 32 places, 33 transitions, 89 flow [2022-12-06 00:09:56,394 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:56,394 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:56,394 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 33 transitions, 89 flow [2022-12-06 00:09:56,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 89 flow [2022-12-06 00:09:56,401 INFO L130 PetriNetUnfolder]: 14/44 cut-off events. [2022-12-06 00:09:56,401 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:09:56,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 44 events. 14/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 45. Up to 17 conditions per place. [2022-12-06 00:09:56,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 33 transitions, 89 flow [2022-12-06 00:09:56,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-06 00:09:56,424 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:09:56,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 00:09:56,426 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 89 flow [2022-12-06 00:09:56,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:56,426 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:56,426 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] [2022-12-06 00:09:56,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:09:56,429 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 1 more)] === [2022-12-06 00:09:56,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:56,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1141673692, now seen corresponding path program 1 times [2022-12-06 00:09:56,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:56,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110547816] [2022-12-06 00:09:56,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:56,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:56,626 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 00:09:56,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:56,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110547816] [2022-12-06 00:09:56,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110547816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:56,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:56,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:09:56,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104043811] [2022-12-06 00:09:56,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:56,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:56,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:56,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:56,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:56,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 00:09:56,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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 00:09:56,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:56,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 00:09:56,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:56,753 INFO L130 PetriNetUnfolder]: 501/754 cut-off events. [2022-12-06 00:09:56,753 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 00:09:56,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1798 conditions, 754 events. 501/754 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2341 event pairs, 344 based on Foata normal form. 26/630 useless extension candidates. Maximal degree in co-relation 631. Up to 691 conditions per place. [2022-12-06 00:09:56,760 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 31 selfloop transitions, 2 changer transitions 14/48 dead transitions. [2022-12-06 00:09:56,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 216 flow [2022-12-06 00:09:56,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 00:09:56,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2022-12-06 00:09:56,763 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 89 flow. Second operand 4 states and 52 transitions. [2022-12-06 00:09:56,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 216 flow [2022-12-06 00:09:56,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:09:56,764 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 104 flow [2022-12-06 00:09:56,764 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, 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=4, PETRI_FLOW=104, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2022-12-06 00:09:56,765 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2022-12-06 00:09:56,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:56,765 INFO L89 Accepts]: Start accepts. Operand has 36 places, 34 transitions, 104 flow [2022-12-06 00:09:56,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:56,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:56,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 34 transitions, 104 flow [2022-12-06 00:09:56,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 34 transitions, 104 flow [2022-12-06 00:09:56,775 INFO L130 PetriNetUnfolder]: 22/65 cut-off events. [2022-12-06 00:09:56,775 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:09:56,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 65 events. 22/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 165 event pairs, 4 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 100. Up to 17 conditions per place. [2022-12-06 00:09:56,776 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 34 transitions, 104 flow [2022-12-06 00:09:56,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 00:09:58,183 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:58,184 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1419 [2022-12-06 00:09:58,184 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 100 flow [2022-12-06 00:09:58,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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 00:09:58,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:58,184 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] [2022-12-06 00:09:58,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:09:58,184 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 1 more)] === [2022-12-06 00:09:58,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:58,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1336645822, now seen corresponding path program 1 times [2022-12-06 00:09:58,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:58,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778658409] [2022-12-06 00:09:58,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:58,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:58,311 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 00:09:58,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:58,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778658409] [2022-12-06 00:09:58,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778658409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:58,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:58,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:58,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086440693] [2022-12-06 00:09:58,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:58,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:58,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:58,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:58,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:58,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 00:09:58,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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 00:09:58,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:58,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 00:09:58,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:58,467 INFO L130 PetriNetUnfolder]: 759/1175 cut-off events. [2022-12-06 00:09:58,467 INFO L131 PetriNetUnfolder]: For 267/267 co-relation queries the response was YES. [2022-12-06 00:09:58,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 1175 events. 759/1175 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4437 event pairs, 563 based on Foata normal form. 56/1041 useless extension candidates. Maximal degree in co-relation 2890. Up to 691 conditions per place. [2022-12-06 00:09:58,471 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 31 selfloop transitions, 2 changer transitions 35/69 dead transitions. [2022-12-06 00:09:58,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 69 transitions, 328 flow [2022-12-06 00:09:58,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:09:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:09:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-06 00:09:58,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2022-12-06 00:09:58,472 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 100 flow. Second operand 5 states and 75 transitions. [2022-12-06 00:09:58,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 69 transitions, 328 flow [2022-12-06 00:09:58,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 69 transitions, 320 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 00:09:58,474 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 114 flow [2022-12-06 00:09:58,474 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=5, PETRI_FLOW=114, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2022-12-06 00:09:58,475 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2022-12-06 00:09:58,475 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:58,475 INFO L89 Accepts]: Start accepts. Operand has 39 places, 34 transitions, 114 flow [2022-12-06 00:09:58,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:58,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:58,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 114 flow [2022-12-06 00:09:58,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 114 flow [2022-12-06 00:09:58,482 INFO L130 PetriNetUnfolder]: 22/65 cut-off events. [2022-12-06 00:09:58,483 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:09:58,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 65 events. 22/65 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 164 event pairs, 4 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 103. Up to 17 conditions per place. [2022-12-06 00:09:58,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 34 transitions, 114 flow [2022-12-06 00:09:58,484 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 00:09:58,739 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:58,740 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 265 [2022-12-06 00:09:58,740 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 110 flow [2022-12-06 00:09:58,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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 00:09:58,740 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:58,741 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] [2022-12-06 00:09:58,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:09:58,741 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 1 more)] === [2022-12-06 00:09:58,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:58,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1117791104, now seen corresponding path program 1 times [2022-12-06 00:09:58,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:58,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355513507] [2022-12-06 00:09:58,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:58,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:58,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:58,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355513507] [2022-12-06 00:09:58,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355513507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:58,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:58,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:58,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302768227] [2022-12-06 00:09:58,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:58,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:58,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:58,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:58,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:58,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 00:09:58,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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 00:09:58,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:58,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 00:09:58,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:58,966 INFO L130 PetriNetUnfolder]: 835/1241 cut-off events. [2022-12-06 00:09:58,966 INFO L131 PetriNetUnfolder]: For 523/523 co-relation queries the response was YES. [2022-12-06 00:09:58,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3367 conditions, 1241 events. 835/1241 cut-off events. For 523/523 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4512 event pairs, 586 based on Foata normal form. 32/1034 useless extension candidates. Maximal degree in co-relation 3350. Up to 691 conditions per place. [2022-12-06 00:09:58,970 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 31 selfloop transitions, 2 changer transitions 22/56 dead transitions. [2022-12-06 00:09:58,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 56 transitions, 295 flow [2022-12-06 00:09:58,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 00:09:58,971 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4596774193548387 [2022-12-06 00:09:58,971 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 110 flow. Second operand 4 states and 57 transitions. [2022-12-06 00:09:58,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 56 transitions, 295 flow [2022-12-06 00:09:58,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 56 transitions, 267 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 00:09:58,973 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 108 flow [2022-12-06 00:09:58,973 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=4, PETRI_FLOW=108, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2022-12-06 00:09:58,973 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-06 00:09:58,974 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:58,974 INFO L89 Accepts]: Start accepts. Operand has 37 places, 34 transitions, 108 flow [2022-12-06 00:09:58,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:58,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:58,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 34 transitions, 108 flow [2022-12-06 00:09:58,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 108 flow [2022-12-06 00:09:58,980 INFO L130 PetriNetUnfolder]: 22/65 cut-off events. [2022-12-06 00:09:58,980 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:09:58,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 65 events. 22/65 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 166 event pairs, 4 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 104. Up to 17 conditions per place. [2022-12-06 00:09:58,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 34 transitions, 108 flow [2022-12-06 00:09:59,007 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 00:09:59,239 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:59,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-06 00:09:59,240 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 104 flow [2022-12-06 00:09:59,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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 00:09:59,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:59,240 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] [2022-12-06 00:09:59,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:09:59,241 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 1 more)] === [2022-12-06 00:09:59,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:59,241 INFO L85 PathProgramCache]: Analyzing trace with hash -272387452, now seen corresponding path program 1 times [2022-12-06 00:09:59,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:59,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398732759] [2022-12-06 00:09:59,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:59,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:59,339 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 00:09:59,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:59,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398732759] [2022-12-06 00:09:59,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398732759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:59,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:59,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:09:59,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863238110] [2022-12-06 00:09:59,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:59,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:09:59,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:59,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:09:59,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:09:59,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 00:09:59,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:59,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:59,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 00:09:59,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:59,473 INFO L130 PetriNetUnfolder]: 839/1273 cut-off events. [2022-12-06 00:09:59,473 INFO L131 PetriNetUnfolder]: For 354/354 co-relation queries the response was YES. [2022-12-06 00:09:59,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3323 conditions, 1273 events. 839/1273 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4833 event pairs, 317 based on Foata normal form. 1/1006 useless extension candidates. Maximal degree in co-relation 3303. Up to 645 conditions per place. [2022-12-06 00:09:59,478 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 46 selfloop transitions, 2 changer transitions 6/55 dead transitions. [2022-12-06 00:09:59,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 283 flow [2022-12-06 00:09:59,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:09:59,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:09:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 00:09:59,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2022-12-06 00:09:59,479 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 104 flow. Second operand 3 states and 54 transitions. [2022-12-06 00:09:59,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 283 flow [2022-12-06 00:09:59,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 55 transitions, 267 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:59,481 INFO L231 Difference]: Finished difference. Result has 35 places, 34 transitions, 104 flow [2022-12-06 00:09:59,481 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=104, PETRI_PLACES=35, PETRI_TRANSITIONS=34} [2022-12-06 00:09:59,482 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2022-12-06 00:09:59,482 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:59,482 INFO L89 Accepts]: Start accepts. Operand has 35 places, 34 transitions, 104 flow [2022-12-06 00:09:59,482 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:59,482 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:59,483 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 34 transitions, 104 flow [2022-12-06 00:09:59,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 34 transitions, 104 flow [2022-12-06 00:09:59,490 INFO L130 PetriNetUnfolder]: 24/85 cut-off events. [2022-12-06 00:09:59,490 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:09:59,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 85 events. 24/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 283 event pairs, 8 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 100. Up to 23 conditions per place. [2022-12-06 00:09:59,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 34 transitions, 104 flow [2022-12-06 00:09:59,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-06 00:09:59,495 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:09:59,496 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 00:09:59,496 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 34 transitions, 104 flow [2022-12-06 00:09:59,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:59,496 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:59,496 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] [2022-12-06 00:09:59,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:09:59,497 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 1 more)] === [2022-12-06 00:09:59,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:59,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1843002909, now seen corresponding path program 1 times [2022-12-06 00:09:59,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:59,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033093625] [2022-12-06 00:09:59,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:59,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:59,834 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 00:09:59,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:59,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033093625] [2022-12-06 00:09:59,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033093625] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:09:59,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919401907] [2022-12-06 00:09:59,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:59,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:09:59,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:09:59,867 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 00:09:59,895 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 00:09:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:59,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:09:59,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:00,031 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 00:10:00,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:10:00,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919401907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:00,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:10:00,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2022-12-06 00:10:00,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503466623] [2022-12-06 00:10:00,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:00,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:10:00,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:00,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:10:00,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:10:00,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:10:00,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 34 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:00,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:00,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:10:00,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:00,213 INFO L130 PetriNetUnfolder]: 687/1042 cut-off events. [2022-12-06 00:10:00,213 INFO L131 PetriNetUnfolder]: For 197/197 co-relation queries the response was YES. [2022-12-06 00:10:00,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2691 conditions, 1042 events. 687/1042 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3679 event pairs, 219 based on Foata normal form. 24/869 useless extension candidates. Maximal degree in co-relation 1085. Up to 913 conditions per place. [2022-12-06 00:10:00,217 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 41 selfloop transitions, 2 changer transitions 1/44 dead transitions. [2022-12-06 00:10:00,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 218 flow [2022-12-06 00:10:00,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:10:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:10:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 00:10:00,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46236559139784944 [2022-12-06 00:10:00,219 INFO L175 Difference]: Start difference. First operand has 35 places, 34 transitions, 104 flow. Second operand 3 states and 43 transitions. [2022-12-06 00:10:00,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 218 flow [2022-12-06 00:10:00,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:10:00,220 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 112 flow [2022-12-06 00:10:00,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2022-12-06 00:10:00,223 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-06 00:10:00,223 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:00,223 INFO L89 Accepts]: Start accepts. Operand has 37 places, 34 transitions, 112 flow [2022-12-06 00:10:00,224 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:00,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:00,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 34 transitions, 112 flow [2022-12-06 00:10:00,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 112 flow [2022-12-06 00:10:00,233 INFO L130 PetriNetUnfolder]: 38/87 cut-off events. [2022-12-06 00:10:00,233 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 00:10:00,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 87 events. 38/87 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 204 event pairs, 4 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 148. Up to 49 conditions per place. [2022-12-06 00:10:00,235 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 34 transitions, 112 flow [2022-12-06 00:10:00,235 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 00:10:00,236 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:00,237 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 00:10:00,237 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 112 flow [2022-12-06 00:10:00,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:00,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:00,237 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] [2022-12-06 00:10:00,243 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 00:10:00,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 00:10:00,443 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 1 more)] === [2022-12-06 00:10:00,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:00,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1446430485, now seen corresponding path program 2 times [2022-12-06 00:10:00,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:00,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521247698] [2022-12-06 00:10:00,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:00,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:00,846 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 00:10:00,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:00,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521247698] [2022-12-06 00:10:00,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521247698] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:00,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151699706] [2022-12-06 00:10:00,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:10:00,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:00,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:00,873 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 00:10:00,885 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 00:10:01,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:10:01,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:10:01,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 00:10:01,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:01,107 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 152 treesize of output 144 [2022-12-06 00:10:01,148 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 00:10:01,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:10:01,297 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 182 treesize of output 174 [2022-12-06 00:10:01,375 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 00:10:01,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151699706] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:10:01,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:10:01,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 00:10:01,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302983254] [2022-12-06 00:10:01,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:10:01,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 00:10:01,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:01,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 00:10:01,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-06 00:10:01,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:10:01,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 112 flow. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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 00:10:01,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:01,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:10:01,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:01,784 INFO L130 PetriNetUnfolder]: 1305/1940 cut-off events. [2022-12-06 00:10:01,784 INFO L131 PetriNetUnfolder]: For 750/750 co-relation queries the response was YES. [2022-12-06 00:10:01,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5331 conditions, 1940 events. 1305/1940 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7729 event pairs, 102 based on Foata normal form. 89/1787 useless extension candidates. Maximal degree in co-relation 2230. Up to 473 conditions per place. [2022-12-06 00:10:01,790 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 60 selfloop transitions, 6 changer transitions 97/163 dead transitions. [2022-12-06 00:10:01,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 163 transitions, 821 flow [2022-12-06 00:10:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:10:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:10:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 154 transitions. [2022-12-06 00:10:01,793 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38213399503722084 [2022-12-06 00:10:01,793 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 112 flow. Second operand 13 states and 154 transitions. [2022-12-06 00:10:01,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 163 transitions, 821 flow [2022-12-06 00:10:01,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 163 transitions, 813 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 00:10:01,796 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 149 flow [2022-12-06 00:10:01,796 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=149, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2022-12-06 00:10:01,796 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2022-12-06 00:10:01,796 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:01,797 INFO L89 Accepts]: Start accepts. Operand has 53 places, 37 transitions, 149 flow [2022-12-06 00:10:01,798 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:01,798 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:01,798 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 37 transitions, 149 flow [2022-12-06 00:10:01,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 149 flow [2022-12-06 00:10:01,809 INFO L130 PetriNetUnfolder]: 40/91 cut-off events. [2022-12-06 00:10:01,809 INFO L131 PetriNetUnfolder]: For 36/38 co-relation queries the response was YES. [2022-12-06 00:10:01,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 91 events. 40/91 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 197 event pairs, 4 based on Foata normal form. 2/66 useless extension candidates. Maximal degree in co-relation 196. Up to 49 conditions per place. [2022-12-06 00:10:01,810 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 149 flow [2022-12-06 00:10:01,810 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-06 00:10:03,309 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:03,310 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1514 [2022-12-06 00:10:03,310 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 145 flow [2022-12-06 00:10:03,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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 00:10:03,310 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:03,310 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 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] [2022-12-06 00:10:03,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 00:10:03,511 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 00:10:03,512 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 1 more)] === [2022-12-06 00:10:03,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:03,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1673873069, now seen corresponding path program 1 times [2022-12-06 00:10:03,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:03,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152723071] [2022-12-06 00:10:03,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:03,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:10:03,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:03,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152723071] [2022-12-06 00:10:03,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152723071] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:03,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839572417] [2022-12-06 00:10:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:03,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:03,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:03,900 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 00:10:03,902 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 00:10:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:04,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 00:10:04,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:04,283 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 152 treesize of output 144 [2022-12-06 00:10:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:10:04,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:10:04,657 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 182 treesize of output 174 [2022-12-06 00:10:04,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:10:04,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839572417] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:10:04,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:10:04,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-06 00:10:04,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870960185] [2022-12-06 00:10:04,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:10:04,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 00:10:04,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:04,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 00:10:04,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-12-06 00:10:04,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:10:04,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 145 flow. Second operand has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 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 00:10:04,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:04,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:10:04,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:07,032 INFO L130 PetriNetUnfolder]: 5359/7745 cut-off events. [2022-12-06 00:10:07,032 INFO L131 PetriNetUnfolder]: For 10037/10037 co-relation queries the response was YES. [2022-12-06 00:10:07,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24283 conditions, 7745 events. 5359/7745 cut-off events. For 10037/10037 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 38334 event pairs, 303 based on Foata normal form. 300/6774 useless extension candidates. Maximal degree in co-relation 24264. Up to 2531 conditions per place. [2022-12-06 00:10:07,075 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 426 selfloop transitions, 73 changer transitions 74/573 dead transitions. [2022-12-06 00:10:07,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 573 transitions, 3279 flow [2022-12-06 00:10:07,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-06 00:10:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-06 00:10:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 519 transitions. [2022-12-06 00:10:07,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4083398898505114 [2022-12-06 00:10:07,078 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 145 flow. Second operand 41 states and 519 transitions. [2022-12-06 00:10:07,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 573 transitions, 3279 flow [2022-12-06 00:10:07,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 573 transitions, 3171 flow, removed 51 selfloop flow, removed 7 redundant places. [2022-12-06 00:10:07,156 INFO L231 Difference]: Finished difference. Result has 110 places, 103 transitions, 852 flow [2022-12-06 00:10:07,157 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=852, PETRI_PLACES=110, PETRI_TRANSITIONS=103} [2022-12-06 00:10:07,157 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 75 predicate places. [2022-12-06 00:10:07,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:07,157 INFO L89 Accepts]: Start accepts. Operand has 110 places, 103 transitions, 852 flow [2022-12-06 00:10:07,160 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:07,160 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:07,160 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 103 transitions, 852 flow [2022-12-06 00:10:07,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 103 transitions, 852 flow [2022-12-06 00:10:07,276 INFO L130 PetriNetUnfolder]: 357/901 cut-off events. [2022-12-06 00:10:07,276 INFO L131 PetriNetUnfolder]: For 19538/19897 co-relation queries the response was YES. [2022-12-06 00:10:07,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4056 conditions, 901 events. 357/901 cut-off events. For 19538/19897 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5786 event pairs, 60 based on Foata normal form. 13/684 useless extension candidates. Maximal degree in co-relation 4001. Up to 341 conditions per place. [2022-12-06 00:10:07,293 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 103 transitions, 852 flow [2022-12-06 00:10:07,293 INFO L188 LiptonReduction]: Number of co-enabled transitions 1208 [2022-12-06 00:10:11,758 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse13 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= v_~q1_back~0_Out_28 v_~q1_back~0_In_11)) (.cse2 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_5| |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|)) (.cse4 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_5| 256) 0)) (.cse3 (not .cse13)) (.cse5 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_3| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_8|)) (.cse7 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_4| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18|)) (.cse8 (= v_~q3_front~0_Out_20 v_~q3_front~0_In_10)) (.cse9 (= v_~r~0_In_7 v_~r~0_Out_20)) (.cse10 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_3| |v_thread1Thread1of1ForFork1_~l~0#1_Out_10|)) (.cse11 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_5| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|)) (.cse12 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_3| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_8|))) (or (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|) (= (select (select |v_#memory_int_In_37| v_~q3~0.base_In_10) (+ (* v_~q3_front~0_In_10 4) v_~q3~0.offset_In_10)) |v_thread1Thread1of1ForFork1_~l~0#1_Out_10|) .cse0 (= (ite (and (<= 0 v_~q3_front~0_In_10) (< v_~q3_front~0_In_10 v_~n3~0_In_9)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|) .cse1 (= (+ v_~q3_front~0_In_10 1) v_~q3_front~0_Out_20) (= (+ v_~r~0_In_7 |v_thread1Thread1of1ForFork1_~l~0#1_Out_10|) v_~r~0_Out_20) .cse2 (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| 0)) .cse3 (not .cse4) .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse11 .cse4 .cse3 .cse12 .cse5) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) .cse8 .cse9 (= v_~q1_back~0_Out_28 (+ 1 v_~q1_back~0_In_11)) .cse10 .cse11 .cse13 .cse12)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_3|, ~n3~0=v_~n3~0_In_9, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_3|, ~q3~0.offset=v_~q3~0.offset_In_10, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_3|, ~q3_front~0=v_~q3_front~0_In_10, ~q1_back~0=v_~q1_back~0_In_11, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_5|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_37|, ~q3~0.base=v_~q3~0.base_In_10, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_7, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_4|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_6|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_8|, ~n3~0=v_~n3~0_In_9, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_8|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_10|, ~q3~0.offset=v_~q3~0.offset_In_10, ~q3_front~0=v_~q3_front~0_Out_20, ~q1_back~0=v_~q1_back~0_Out_28, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, #memory_int=|v_#memory_int_In_37|, ~q3~0.base=v_~q3~0.base_In_10, ~r~0=v_~r~0_Out_20, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1082] L149-4-->L150-3: Formula: (and (= |v_#pthreadsForks_53| |v_ULTIMATE.start_main_#t~pre33#1_23|) (= (store |v_#memory_int_194| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_194| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre33#1_23|)) |v_#memory_int_193|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_194|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_17|, #pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_193|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_9|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_main_#t~pre33#1] [2022-12-06 00:10:12,069 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse13 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= v_~q1_back~0_Out_28 v_~q1_back~0_In_11)) (.cse2 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_5| |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|)) (.cse4 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_5| 256) 0)) (.cse3 (not .cse13)) (.cse5 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_3| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_8|)) (.cse7 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_4| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18|)) (.cse8 (= v_~q3_front~0_Out_20 v_~q3_front~0_In_10)) (.cse9 (= v_~r~0_In_7 v_~r~0_Out_20)) (.cse10 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_3| |v_thread1Thread1of1ForFork1_~l~0#1_Out_10|)) (.cse11 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_5| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|)) (.cse12 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_3| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_8|))) (or (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|) (= (select (select |v_#memory_int_In_37| v_~q3~0.base_In_10) (+ (* v_~q3_front~0_In_10 4) v_~q3~0.offset_In_10)) |v_thread1Thread1of1ForFork1_~l~0#1_Out_10|) .cse0 (= (ite (and (<= 0 v_~q3_front~0_In_10) (< v_~q3_front~0_In_10 v_~n3~0_In_9)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|) .cse1 (= (+ v_~q3_front~0_In_10 1) v_~q3_front~0_Out_20) (= (+ v_~r~0_In_7 |v_thread1Thread1of1ForFork1_~l~0#1_Out_10|) v_~r~0_Out_20) .cse2 (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| 0)) .cse3 (not .cse4) .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse11 .cse4 .cse3 .cse12 .cse5) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) .cse8 .cse9 (= v_~q1_back~0_Out_28 (+ 1 v_~q1_back~0_In_11)) .cse10 .cse11 .cse13 .cse12)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_3|, ~n3~0=v_~n3~0_In_9, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_3|, ~q3~0.offset=v_~q3~0.offset_In_10, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_3|, ~q3_front~0=v_~q3_front~0_In_10, ~q1_back~0=v_~q1_back~0_In_11, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_5|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_37|, ~q3~0.base=v_~q3~0.base_In_10, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_7, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_4|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_6|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_8|, ~n3~0=v_~n3~0_In_9, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_8|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_10|, ~q3~0.offset=v_~q3~0.offset_In_10, ~q3_front~0=v_~q3_front~0_Out_20, ~q1_back~0=v_~q1_back~0_Out_28, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, #memory_int=|v_#memory_int_In_37|, ~q3~0.base=v_~q3~0.base_In_10, ~r~0=v_~r~0_Out_20, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [896] L82-2-->L87: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (and (< v_~q1_front~0_41 v_~q1_back~0_58) (< v_~q1_front~0_41 v_~n1~0_17) (<= 0 v_~q1_front~0_41)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select (select |v_#memory_int_93| v_~q1~0.base_24) (+ v_~q1~0.offset_24 (* 4 v_~q1_front~0_41))) |v_thread2Thread1of1ForFork2_~j~0#1_19|) (= (+ v_~q1_front~0_41 1) v_~q1_front~0_40) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|)) InVars {~q1~0.offset=v_~q1~0.offset_24, ~q1_front~0=v_~q1_front~0_41, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|} OutVars{thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_5|, ~q1~0.offset=v_~q1~0.offset_24, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, ~q1_front~0=v_~q1_front~0_40, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~q1_front~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~0#1] [2022-12-06 00:10:12,481 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:10:12,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5326 [2022-12-06 00:10:12,483 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 103 transitions, 878 flow [2022-12-06 00:10:12,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 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 00:10:12,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:12,484 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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 00:10:12,491 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 00:10:12,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:12,691 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 1 more)] === [2022-12-06 00:10:12,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:12,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1181709745, now seen corresponding path program 1 times [2022-12-06 00:10:12,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:12,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648153832] [2022-12-06 00:10:12,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:12,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 00:10:13,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:13,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648153832] [2022-12-06 00:10:13,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648153832] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:13,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917264270] [2022-12-06 00:10:13,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:13,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:13,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:13,196 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 00:10:13,231 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 00:10:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:13,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 00:10:13,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:13,702 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:10:13,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 209 treesize of output 238 [2022-12-06 00:10:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:10:13,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:10:20,473 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:10:20,479 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:10:20,479 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 26 treesize of output 9 [2022-12-06 00:10:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:10:20,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917264270] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:10:20,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:10:20,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 7] total 19 [2022-12-06 00:10:20,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206270115] [2022-12-06 00:10:20,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:10:20,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 00:10:20,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:20,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 00:10:20,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2022-12-06 00:10:20,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:10:20,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 103 transitions, 878 flow. Second operand has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 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 00:10:20,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:20,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:10:20,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:33,585 WARN L233 SmtUtils]: Spent 12.44s on a formula simplification. DAG size of input: 66 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:10:49,956 WARN L233 SmtUtils]: Spent 16.15s on a formula simplification. DAG size of input: 69 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:11:06,172 WARN L233 SmtUtils]: Spent 16.15s on a formula simplification. DAG size of input: 65 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:11:22,534 WARN L233 SmtUtils]: Spent 16.14s on a formula simplification. DAG size of input: 68 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:11:39,443 WARN L233 SmtUtils]: Spent 16.18s on a formula simplification. DAG size of input: 68 DAG size of output: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:11:56,241 WARN L233 SmtUtils]: Spent 16.20s on a formula simplification. DAG size of input: 67 DAG size of output: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:11:56,745 INFO L130 PetriNetUnfolder]: 11061/15649 cut-off events. [2022-12-06 00:11:56,745 INFO L131 PetriNetUnfolder]: For 233479/233479 co-relation queries the response was YES. [2022-12-06 00:11:56,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72593 conditions, 15649 events. 11061/15649 cut-off events. For 233479/233479 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 84956 event pairs, 834 based on Foata normal form. 8/12544 useless extension candidates. Maximal degree in co-relation 72553. Up to 6213 conditions per place. [2022-12-06 00:11:56,801 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 0 selfloop transitions, 0 changer transitions 571/571 dead transitions. [2022-12-06 00:11:56,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 571 transitions, 6300 flow [2022-12-06 00:11:56,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 00:11:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 00:11:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 355 transitions. [2022-12-06 00:11:56,804 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3271889400921659 [2022-12-06 00:11:56,804 INFO L175 Difference]: Start difference. First operand has 107 places, 103 transitions, 878 flow. Second operand 31 states and 355 transitions. [2022-12-06 00:11:56,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 571 transitions, 6300 flow [2022-12-06 00:11:57,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 571 transitions, 5815 flow, removed 232 selfloop flow, removed 5 redundant places. [2022-12-06 00:11:57,188 INFO L231 Difference]: Finished difference. Result has 131 places, 0 transitions, 0 flow [2022-12-06 00:11:57,188 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=0, PETRI_PLACES=131, PETRI_TRANSITIONS=0} [2022-12-06 00:11:57,189 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 96 predicate places. [2022-12-06 00:11:57,189 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:57,189 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 0 transitions, 0 flow [2022-12-06 00:11:57,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 00:11:57,189 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 00:11:57,189 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:11:57,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 00:11:57,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 00:11:57,190 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:11:57,190 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:11:57,190 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-06 00:11:57,190 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 00:11:57,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 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 00:11:57,192 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 00:11:57,192 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 00:11:57,192 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 00:11:57,192 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 00:11:57,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 00:11:57,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:11:57,396 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:57,399 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 00:11:57,399 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 00:11:57,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 12:11:57 BasicIcfg [2022-12-06 00:11:57,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 00:11:57,401 INFO L158 Benchmark]: Toolchain (without parser) took 131275.19ms. Allocated memory was 226.5MB in the beginning and 685.8MB in the end (delta: 459.3MB). Free memory was 201.7MB in the beginning and 448.1MB in the end (delta: -246.4MB). Peak memory consumption was 212.9MB. Max. memory is 8.0GB. [2022-12-06 00:11:57,401 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 226.5MB. Free memory is still 202.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:11:57,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.05ms. Allocated memory is still 226.5MB. Free memory was 201.7MB in the beginning and 187.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 00:11:57,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.17ms. Allocated memory is still 226.5MB. Free memory was 187.0MB in the beginning and 184.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:11:57,401 INFO L158 Benchmark]: Boogie Preprocessor took 25.94ms. Allocated memory is still 226.5MB. Free memory was 184.4MB in the beginning and 182.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:11:57,401 INFO L158 Benchmark]: RCFGBuilder took 604.00ms. Allocated memory is still 226.5MB. Free memory was 182.3MB in the beginning and 141.9MB in the end (delta: 40.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2022-12-06 00:11:57,401 INFO L158 Benchmark]: TraceAbstraction took 130400.08ms. Allocated memory was 226.5MB in the beginning and 685.8MB in the end (delta: 459.3MB). Free memory was 141.4MB in the beginning and 448.1MB in the end (delta: -306.7MB). Peak memory consumption was 153.1MB. Max. memory is 8.0GB. [2022-12-06 00:11:57,402 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 226.5MB. Free memory is still 202.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.05ms. Allocated memory is still 226.5MB. Free memory was 201.7MB in the beginning and 187.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.17ms. Allocated memory is still 226.5MB. Free memory was 187.0MB in the beginning and 184.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.94ms. Allocated memory is still 226.5MB. Free memory was 184.4MB in the beginning and 182.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 604.00ms. Allocated memory is still 226.5MB. Free memory was 182.3MB in the beginning and 141.9MB in the end (delta: 40.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 130400.08ms. Allocated memory was 226.5MB in the beginning and 685.8MB in the end (delta: 459.3MB). Free memory was 141.4MB in the beginning and 448.1MB in the end (delta: -306.7MB). Peak memory consumption was 153.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.5s, 228 PlacesBefore, 35 PlacesAfterwards, 243 TransitionsBefore, 33 TransitionsAfterwards, 2820 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 151 TrivialYvCompositions, 42 ConcurrentYvCompositions, 15 ChoiceCompositions, 210 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 1968, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1666, independent: 1651, independent conditional: 0, independent unconditional: 1651, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1666, independent: 1643, independent conditional: 0, independent unconditional: 1643, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1998, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1666, unknown conditional: 0, unknown unconditional: 1666] , Statistics on independence cache: Total cache size (in pairs): 2751, Positive cache size: 2736, Positive conditional cache size: 0, Positive unconditional cache size: 2736, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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, 32 PlacesBefore, 32 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 24, independent conditional: 24, 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: 33, independent: 24, independent conditional: 2, independent unconditional: 22, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 24, independent conditional: 2, independent unconditional: 22, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 24, independent conditional: 2, independent unconditional: 22, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 16, independent conditional: 2, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 22, unknown conditional: 2, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 6, Negative conditional cache size: 0, 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: 1.4s, 35 PlacesBefore, 34 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 6, Negative conditional cache size: 0, 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.3s, 37 PlacesBefore, 36 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 6, Negative conditional cache size: 0, 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.3s, 36 PlacesBefore, 35 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 6, Negative conditional cache size: 0, 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, 35 PlacesBefore, 35 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 7, Negative conditional cache size: 1, 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, 37 PlacesBefore, 37 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 7, Negative conditional cache size: 1, 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: 1.5s, 46 PlacesBefore, 45 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 7, Negative conditional cache size: 1, 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: 5.2s, 107 PlacesBefore, 107 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 1208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 232, independent: 188, independent conditional: 188, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 232, independent: 188, independent conditional: 158, independent unconditional: 30, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 242, independent: 188, independent conditional: 158, independent unconditional: 30, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 242, independent: 188, independent conditional: 158, independent unconditional: 30, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 27, independent conditional: 25, independent unconditional: 2, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 130, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 130, dependent conditional: 130, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 242, independent: 161, independent conditional: 133, independent unconditional: 28, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 39, unknown conditional: 37, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 43, Positive conditional cache size: 27, Positive unconditional cache size: 16, Negative cache size: 19, Negative conditional cache size: 13, 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, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 43, Positive conditional cache size: 27, Positive unconditional cache size: 16, Negative cache size: 19, Negative conditional cache size: 13, 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 - PositiveResult [Line: 156]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 277 locations, 4 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: 130.3s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 100.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2108 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2108 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2713 IncrementalHoareTripleChecker+Invalid, 2902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 0 mSDtfsCounter, 2713 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 172 SyntacticMatches, 4 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1524 ImplicationChecksByTransitivity, 101.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=878occurred in iteration=8, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 399 ConstructedInterpolants, 2 QuantifiedInterpolants, 2744 SizeOfPredicates, 118 NumberOfNonLiveVariables, 1555 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 6/35 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 00:11:57,626 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-06 00:11:57,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...