/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-commit-1.wvr-bad.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:08:27,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:08:27,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:08:27,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:08:27,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:08:27,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:08:27,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:08:27,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:08:27,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:08:27,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:08:27,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:08:27,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:08:27,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:08:27,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:08:27,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:08:27,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:08:27,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:08:27,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:08:27,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:08:27,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:08:27,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:08:27,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:08:27,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:08:27,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:08:27,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:08:27,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:08:27,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:08:27,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:08:27,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:08:27,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:08:27,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:08:27,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:08:27,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:08:27,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:08:27,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:08:27,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:08:27,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:08:27,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:08:27,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:08:27,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:08:27,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:08:27,390 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:08:27,405 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:08:27,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:08:27,407 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:08:27,407 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:08:27,407 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:08:27,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:08:27,407 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:08:27,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:08:27,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:08:27,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:08:27,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:08:27,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:08:27,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:08:27,408 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:08:27,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:08:27,408 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:08:27,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:08:27,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:08:27,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:08:27,409 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:08:27,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:08:27,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:08:27,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:08:27,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:08:27,410 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:08:27,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:08:27,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:08:27,410 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:08:27,410 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:08:27,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:08:27,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:08:27,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:08:27,666 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:08:27,666 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:08:27,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2022-12-06 00:08:28,694 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:08:28,904 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:08:28,905 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2022-12-06 00:08:28,933 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f2bf751/d73da727b1c24f6bb7c7dbb07e9dc4dc/FLAG051c39454 [2022-12-06 00:08:28,946 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f2bf751/d73da727b1c24f6bb7c7dbb07e9dc4dc [2022-12-06 00:08:28,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:08:28,948 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:08:28,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:08:28,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:08:28,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:08:28,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:08:28" (1/1) ... [2022-12-06 00:08:28,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e5fb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:28, skipping insertion in model container [2022-12-06 00:08:28,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:08:28" (1/1) ... [2022-12-06 00:08:28,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:08:28,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:08:29,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:29,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:29,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:29,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:29,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:29,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:29,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:29,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:29,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:29,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:29,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:29,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:29,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:29,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:29,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:29,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:29,146 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-commit-1.wvr-bad.c[5161,5174] [2022-12-06 00:08:29,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:08:29,166 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:08:29,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:29,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:29,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:29,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:29,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:29,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:29,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:29,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:29,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:29,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:29,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:29,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:29,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:29,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:29,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:08:29,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:08:29,204 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-commit-1.wvr-bad.c[5161,5174] [2022-12-06 00:08:29,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:08:29,222 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:08:29,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:29 WrapperNode [2022-12-06 00:08:29,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:08:29,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:08:29,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:08:29,223 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:08:29,237 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:08:29" (1/1) ... [2022-12-06 00:08:29,253 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:08:29" (1/1) ... [2022-12-06 00:08:29,279 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 336 [2022-12-06 00:08:29,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:08:29,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:08:29,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:08:29,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:08:29,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:29" (1/1) ... [2022-12-06 00:08:29,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:29" (1/1) ... [2022-12-06 00:08:29,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:29" (1/1) ... [2022-12-06 00:08:29,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:29" (1/1) ... [2022-12-06 00:08:29,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:29" (1/1) ... [2022-12-06 00:08:29,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:29" (1/1) ... [2022-12-06 00:08:29,304 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:29" (1/1) ... [2022-12-06 00:08:29,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:29" (1/1) ... [2022-12-06 00:08:29,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:08:29,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:08:29,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:08:29,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:08:29,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:29" (1/1) ... [2022-12-06 00:08:29,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:08:29,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:08:29,330 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:08:29,352 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:08:29,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:08:29,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:08:29,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:08:29,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:08:29,374 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:08:29,374 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:08:29,374 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:08:29,374 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:08:29,374 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:08:29,374 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:08:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:08:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:08:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:08:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:08:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:08:29,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:08:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:08:29,376 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:08:29,445 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:08:29,446 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:08:29,741 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:08:29,910 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:08:29,911 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 00:08:29,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:08:29 BoogieIcfgContainer [2022-12-06 00:08:29,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:08:29,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:08:29,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:08:29,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:08:29,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:08:28" (1/3) ... [2022-12-06 00:08:29,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d141e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:08:29, skipping insertion in model container [2022-12-06 00:08:29,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:08:29" (2/3) ... [2022-12-06 00:08:29,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d141e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:08:29, skipping insertion in model container [2022-12-06 00:08:29,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:08:29" (3/3) ... [2022-12-06 00:08:29,918 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2022-12-06 00:08:29,929 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:08:29,929 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:08:29,930 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:08:30,035 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 00:08:30,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 253 transitions, 530 flow [2022-12-06 00:08:30,209 INFO L130 PetriNetUnfolder]: 27/250 cut-off events. [2022-12-06 00:08:30,209 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:08:30,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 27/250 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 176 event pairs, 0 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 211. Up to 6 conditions per place. [2022-12-06 00:08:30,214 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 253 transitions, 530 flow [2022-12-06 00:08:30,219 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 240 transitions, 498 flow [2022-12-06 00:08:30,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:30,231 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 240 transitions, 498 flow [2022-12-06 00:08:30,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 240 transitions, 498 flow [2022-12-06 00:08:30,271 INFO L130 PetriNetUnfolder]: 27/240 cut-off events. [2022-12-06 00:08:30,271 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:08:30,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 240 events. 27/240 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 176 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 211. Up to 6 conditions per place. [2022-12-06 00:08:30,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 240 transitions, 498 flow [2022-12-06 00:08:30,275 INFO L188 LiptonReduction]: Number of co-enabled transitions 2442 [2022-12-06 00:08:39,538 INFO L203 LiptonReduction]: Total number of compositions: 210 [2022-12-06 00:08:39,565 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:08:39,571 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;@50b74237, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:08:39,573 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 00:08:39,583 INFO L130 PetriNetUnfolder]: 6/24 cut-off events. [2022-12-06 00:08:39,583 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:08:39,583 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:39,583 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:39,584 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:08:39,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:39,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1929606784, now seen corresponding path program 1 times [2022-12-06 00:08:39,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:39,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957368677] [2022-12-06 00:08:39,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:39,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:40,087 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:08:40,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:40,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957368677] [2022-12-06 00:08:40,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957368677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:40,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:40,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:08:40,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287451939] [2022-12-06 00:08:40,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:40,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:08:40,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:40,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:08:40,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:08:40,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 00:08:40,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 68 flow. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:40,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:40,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 00:08:40,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:40,250 INFO L130 PetriNetUnfolder]: 164/251 cut-off events. [2022-12-06 00:08:40,251 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-06 00:08:40,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 251 events. 164/251 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 607 event pairs, 37 based on Foata normal form. 1/161 useless extension candidates. Maximal degree in co-relation 376. Up to 167 conditions per place. [2022-12-06 00:08:40,254 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 36 selfloop transitions, 4 changer transitions 1/41 dead transitions. [2022-12-06 00:08:40,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 41 transitions, 197 flow [2022-12-06 00:08:40,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:08:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:08:40,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-06 00:08:40,264 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-06 00:08:40,265 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 68 flow. Second operand 3 states and 42 transitions. [2022-12-06 00:08:40,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 41 transitions, 197 flow [2022-12-06 00:08:40,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 41 transitions, 175 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 00:08:40,271 INFO L231 Difference]: Finished difference. Result has 26 places, 28 transitions, 82 flow [2022-12-06 00:08:40,277 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=26, PETRI_TRANSITIONS=28} [2022-12-06 00:08:40,280 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -3 predicate places. [2022-12-06 00:08:40,280 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:40,280 INFO L89 Accepts]: Start accepts. Operand has 26 places, 28 transitions, 82 flow [2022-12-06 00:08:40,282 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:40,282 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:40,282 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 28 transitions, 82 flow [2022-12-06 00:08:40,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 28 transitions, 82 flow [2022-12-06 00:08:40,295 INFO L130 PetriNetUnfolder]: 14/44 cut-off events. [2022-12-06 00:08:40,295 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:08:40,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 44 events. 14/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 33. Up to 14 conditions per place. [2022-12-06 00:08:40,297 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 28 transitions, 82 flow [2022-12-06 00:08:40,297 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 00:08:40,298 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:40,300 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 00:08:40,300 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 28 transitions, 82 flow [2022-12-06 00:08:40,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:40,301 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:40,301 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:40,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:08:40,303 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:08:40,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:40,304 INFO L85 PathProgramCache]: Analyzing trace with hash 495866599, now seen corresponding path program 1 times [2022-12-06 00:08:40,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:40,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906264833] [2022-12-06 00:08:40,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:40,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:40,535 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:08:40,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:40,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906264833] [2022-12-06 00:08:40,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906264833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:40,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:40,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:08:40,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407949943] [2022-12-06 00:08:40,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:40,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:40,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:40,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:40,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:40,537 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 00:08:40,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 28 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:40,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:40,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 00:08:40,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:40,653 INFO L130 PetriNetUnfolder]: 299/473 cut-off events. [2022-12-06 00:08:40,653 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-06 00:08:40,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 473 events. 299/473 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1380 event pairs, 174 based on Foata normal form. 28/495 useless extension candidates. Maximal degree in co-relation 350. Up to 252 conditions per place. [2022-12-06 00:08:40,655 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 50 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2022-12-06 00:08:40,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 53 transitions, 256 flow [2022-12-06 00:08:40,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 00:08:40,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49 [2022-12-06 00:08:40,657 INFO L175 Difference]: Start difference. First operand has 26 places, 28 transitions, 82 flow. Second operand 4 states and 49 transitions. [2022-12-06 00:08:40,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 53 transitions, 256 flow [2022-12-06 00:08:40,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 53 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:08:40,658 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 100 flow [2022-12-06 00:08:40,658 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=30, PETRI_TRANSITIONS=30} [2022-12-06 00:08:40,659 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2022-12-06 00:08:40,659 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:40,659 INFO L89 Accepts]: Start accepts. Operand has 30 places, 30 transitions, 100 flow [2022-12-06 00:08:40,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:40,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:40,660 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 30 transitions, 100 flow [2022-12-06 00:08:40,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 30 transitions, 100 flow [2022-12-06 00:08:40,668 INFO L130 PetriNetUnfolder]: 21/79 cut-off events. [2022-12-06 00:08:40,669 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:08:40,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 79 events. 21/79 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 199 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 65. Up to 21 conditions per place. [2022-12-06 00:08:40,669 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 30 transitions, 100 flow [2022-12-06 00:08:40,669 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 00:08:44,461 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:44,462 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3803 [2022-12-06 00:08:44,462 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 106 flow [2022-12-06 00:08:44,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:44,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:44,462 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:44,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:08:44,462 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:08:44,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:44,463 INFO L85 PathProgramCache]: Analyzing trace with hash 241586444, now seen corresponding path program 1 times [2022-12-06 00:08:44,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:44,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4870856] [2022-12-06 00:08:44,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:44,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:44,731 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:08:44,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:44,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4870856] [2022-12-06 00:08:44,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4870856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:44,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:44,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:08:44,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342538118] [2022-12-06 00:08:44,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:44,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:08:44,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:44,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:08:44,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:08:44,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 00:08:44,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 30 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:44,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:44,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 00:08:44,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:44,820 INFO L130 PetriNetUnfolder]: 263/429 cut-off events. [2022-12-06 00:08:44,820 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 00:08:44,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 429 events. 263/429 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1378 event pairs, 74 based on Foata normal form. 28/451 useless extension candidates. Maximal degree in co-relation 570. Up to 261 conditions per place. [2022-12-06 00:08:44,822 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 34 selfloop transitions, 4 changer transitions 2/40 dead transitions. [2022-12-06 00:08:44,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 208 flow [2022-12-06 00:08:44,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:08:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:08:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 00:08:44,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2022-12-06 00:08:44,824 INFO L175 Difference]: Start difference. First operand has 30 places, 30 transitions, 106 flow. Second operand 3 states and 41 transitions. [2022-12-06 00:08:44,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 208 flow [2022-12-06 00:08:44,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 200 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 00:08:44,827 INFO L231 Difference]: Finished difference. Result has 31 places, 28 transitions, 96 flow [2022-12-06 00:08:44,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=31, PETRI_TRANSITIONS=28} [2022-12-06 00:08:44,828 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2022-12-06 00:08:44,828 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:44,828 INFO L89 Accepts]: Start accepts. Operand has 31 places, 28 transitions, 96 flow [2022-12-06 00:08:44,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:44,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:44,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 28 transitions, 96 flow [2022-12-06 00:08:44,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 96 flow [2022-12-06 00:08:44,836 INFO L130 PetriNetUnfolder]: 14/63 cut-off events. [2022-12-06 00:08:44,837 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 00:08:44,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 63 events. 14/63 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 128 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 50. Up to 14 conditions per place. [2022-12-06 00:08:44,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 28 transitions, 96 flow [2022-12-06 00:08:44,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 00:08:44,841 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:44,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 00:08:44,842 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 28 transitions, 96 flow [2022-12-06 00:08:44,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:44,843 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:44,843 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:44,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:08:44,843 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:08:44,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash 21755367, now seen corresponding path program 1 times [2022-12-06 00:08:44,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:44,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613017623] [2022-12-06 00:08:44,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:44,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:44,980 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:08:44,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:44,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613017623] [2022-12-06 00:08:44,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613017623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:44,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:44,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:08:44,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562882616] [2022-12-06 00:08:44,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:44,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:44,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:44,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:44,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:44,982 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 00:08:44,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:44,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:44,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 00:08:44,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:45,089 INFO L130 PetriNetUnfolder]: 261/440 cut-off events. [2022-12-06 00:08:45,090 INFO L131 PetriNetUnfolder]: For 274/274 co-relation queries the response was YES. [2022-12-06 00:08:45,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 440 events. 261/440 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1365 event pairs, 114 based on Foata normal form. 44/479 useless extension candidates. Maximal degree in co-relation 892. Up to 252 conditions per place. [2022-12-06 00:08:45,091 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 48 selfloop transitions, 3 changer transitions 1/52 dead transitions. [2022-12-06 00:08:45,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 52 transitions, 268 flow [2022-12-06 00:08:45,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 00:08:45,092 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 00:08:45,092 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 96 flow. Second operand 4 states and 52 transitions. [2022-12-06 00:08:45,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 52 transitions, 268 flow [2022-12-06 00:08:45,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 52 transitions, 252 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:45,093 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 96 flow [2022-12-06 00:08:45,094 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2022-12-06 00:08:45,094 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2022-12-06 00:08:45,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:45,094 INFO L89 Accepts]: Start accepts. Operand has 32 places, 28 transitions, 96 flow [2022-12-06 00:08:45,095 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:45,095 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:45,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 28 transitions, 96 flow [2022-12-06 00:08:45,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 96 flow [2022-12-06 00:08:45,102 INFO L130 PetriNetUnfolder]: 9/45 cut-off events. [2022-12-06 00:08:45,102 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 00:08:45,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 45 events. 9/45 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 49. Up to 13 conditions per place. [2022-12-06 00:08:45,102 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 28 transitions, 96 flow [2022-12-06 00:08:45,102 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 00:08:45,103 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:45,104 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 00:08:45,104 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 28 transitions, 96 flow [2022-12-06 00:08:45,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:45,104 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:45,104 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:45,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:08:45,104 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:08:45,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:45,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1267645155, now seen corresponding path program 1 times [2022-12-06 00:08:45,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:45,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599490854] [2022-12-06 00:08:45,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:45,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:45,233 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:08:45,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:45,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599490854] [2022-12-06 00:08:45,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599490854] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:08:45,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714371239] [2022-12-06 00:08:45,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:45,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:08:45,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:08:45,237 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:08:45,297 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:08:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:45,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 00:08:45,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:08:45,409 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:08:45,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:08:45,515 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:08:45,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714371239] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:08:45,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:08:45,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2022-12-06 00:08:45,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310242360] [2022-12-06 00:08:45,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:08:45,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:08:45,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:45,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:08:45,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:08:45,517 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 00:08:45,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 96 flow. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:08:45,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:45,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 00:08:45,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:45,625 INFO L130 PetriNetUnfolder]: 270/434 cut-off events. [2022-12-06 00:08:45,626 INFO L131 PetriNetUnfolder]: For 228/228 co-relation queries the response was YES. [2022-12-06 00:08:45,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 434 events. 270/434 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1354 event pairs, 53 based on Foata normal form. 1/432 useless extension candidates. Maximal degree in co-relation 542. Up to 281 conditions per place. [2022-12-06 00:08:45,627 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 41 selfloop transitions, 4 changer transitions 3/48 dead transitions. [2022-12-06 00:08:45,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 48 transitions, 246 flow [2022-12-06 00:08:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 00:08:45,629 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47 [2022-12-06 00:08:45,629 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 96 flow. Second operand 4 states and 47 transitions. [2022-12-06 00:08:45,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 48 transitions, 246 flow [2022-12-06 00:08:45,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 48 transitions, 242 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 00:08:45,632 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 121 flow [2022-12-06 00:08:45,632 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2022-12-06 00:08:45,633 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2022-12-06 00:08:45,633 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:45,633 INFO L89 Accepts]: Start accepts. Operand has 33 places, 30 transitions, 121 flow [2022-12-06 00:08:45,634 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:45,634 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:45,634 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 30 transitions, 121 flow [2022-12-06 00:08:45,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 121 flow [2022-12-06 00:08:45,642 INFO L130 PetriNetUnfolder]: 10/49 cut-off events. [2022-12-06 00:08:45,642 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 00:08:45,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 49 events. 10/49 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 47. Up to 15 conditions per place. [2022-12-06 00:08:45,642 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 30 transitions, 121 flow [2022-12-06 00:08:45,642 INFO L188 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-06 00:08:45,644 WARN L322 ript$VariableManager]: TermVariable LBE552 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:45,644 WARN L322 ript$VariableManager]: TermVariable LBE230 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:45,644 WARN L322 ript$VariableManager]: TermVariable LBE250 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:45,644 WARN L322 ript$VariableManager]: TermVariable LBE617 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:45,644 WARN L322 ript$VariableManager]: TermVariable LBE604 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:45,644 WARN L322 ript$VariableManager]: TermVariable LBE218 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:46,452 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:46,453 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 820 [2022-12-06 00:08:46,453 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 122 flow [2022-12-06 00:08:46,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:08:46,453 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:46,453 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:46,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 00:08:46,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:08:46,654 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:08:46,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:46,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1139043018, now seen corresponding path program 1 times [2022-12-06 00:08:46,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:46,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144058248] [2022-12-06 00:08:46,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:46,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:46,940 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:08:46,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:46,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144058248] [2022-12-06 00:08:46,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144058248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:46,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:46,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:08:46,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358417908] [2022-12-06 00:08:46,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:46,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:46,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:46,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:46,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:46,942 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 00:08:46,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:46,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:46,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 00:08:46,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:47,057 INFO L130 PetriNetUnfolder]: 323/532 cut-off events. [2022-12-06 00:08:47,057 INFO L131 PetriNetUnfolder]: For 411/411 co-relation queries the response was YES. [2022-12-06 00:08:47,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 532 events. 323/532 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1813 event pairs, 158 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 817. Up to 449 conditions per place. [2022-12-06 00:08:47,059 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 40 selfloop transitions, 4 changer transitions 7/51 dead transitions. [2022-12-06 00:08:47,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 277 flow [2022-12-06 00:08:47,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 00:08:47,062 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-06 00:08:47,062 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 122 flow. Second operand 4 states and 48 transitions. [2022-12-06 00:08:47,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 277 flow [2022-12-06 00:08:47,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 51 transitions, 266 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 00:08:47,064 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 143 flow [2022-12-06 00:08:47,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2022-12-06 00:08:47,066 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2022-12-06 00:08:47,066 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:47,066 INFO L89 Accepts]: Start accepts. Operand has 36 places, 33 transitions, 143 flow [2022-12-06 00:08:47,067 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:47,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:47,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 33 transitions, 143 flow [2022-12-06 00:08:47,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 33 transitions, 143 flow [2022-12-06 00:08:47,075 INFO L130 PetriNetUnfolder]: 13/70 cut-off events. [2022-12-06 00:08:47,075 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 00:08:47,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 70 events. 13/70 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 160 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 78. Up to 15 conditions per place. [2022-12-06 00:08:47,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 33 transitions, 143 flow [2022-12-06 00:08:47,076 INFO L188 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-06 00:08:50,727 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:50,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3663 [2022-12-06 00:08:50,729 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 153 flow [2022-12-06 00:08:50,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:50,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:50,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:50,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:08:50,730 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:08:50,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:50,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1666267141, now seen corresponding path program 1 times [2022-12-06 00:08:50,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:50,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579861825] [2022-12-06 00:08:50,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:50,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:51,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:08:51,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:51,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579861825] [2022-12-06 00:08:51,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579861825] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:08:51,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324197366] [2022-12-06 00:08:51,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:51,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:08:51,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:08:51,371 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:08:51,373 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:08:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:51,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 00:08:51,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:08:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:08:51,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:08:52,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:08:52,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 379 treesize of output 491 [2022-12-06 00:08:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:08:54,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324197366] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:08:54,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:08:54,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 00:08:54,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992224794] [2022-12-06 00:08:54,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:08:54,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:08:54,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:54,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:08:54,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:08:54,427 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 00:08:54,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 153 flow. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:54,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:54,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 00:08:54,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:54,910 INFO L130 PetriNetUnfolder]: 537/862 cut-off events. [2022-12-06 00:08:54,910 INFO L131 PetriNetUnfolder]: For 680/680 co-relation queries the response was YES. [2022-12-06 00:08:54,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2352 conditions, 862 events. 537/862 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3317 event pairs, 96 based on Foata normal form. 3/859 useless extension candidates. Maximal degree in co-relation 1167. Up to 367 conditions per place. [2022-12-06 00:08:54,914 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 73 selfloop transitions, 17 changer transitions 25/115 dead transitions. [2022-12-06 00:08:54,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 115 transitions, 613 flow [2022-12-06 00:08:54,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:08:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:08:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2022-12-06 00:08:54,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2022-12-06 00:08:54,916 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 153 flow. Second operand 10 states and 116 transitions. [2022-12-06 00:08:54,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 115 transitions, 613 flow [2022-12-06 00:08:54,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 115 transitions, 604 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 00:08:54,919 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 256 flow [2022-12-06 00:08:54,920 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=256, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2022-12-06 00:08:54,920 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2022-12-06 00:08:54,920 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:54,920 INFO L89 Accepts]: Start accepts. Operand has 47 places, 42 transitions, 256 flow [2022-12-06 00:08:54,922 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:54,922 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:54,922 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 42 transitions, 256 flow [2022-12-06 00:08:54,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 256 flow [2022-12-06 00:08:54,942 INFO L130 PetriNetUnfolder]: 19/99 cut-off events. [2022-12-06 00:08:54,942 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-06 00:08:54,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 99 events. 19/99 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 321 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 166. Up to 24 conditions per place. [2022-12-06 00:08:54,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 256 flow [2022-12-06 00:08:54,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 00:08:54,944 WARN L322 ript$VariableManager]: TermVariable LBE577 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:54,945 WARN L322 ript$VariableManager]: TermVariable LBE533 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:54,945 WARN L322 ript$VariableManager]: TermVariable LBE587 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:54,945 WARN L322 ript$VariableManager]: TermVariable LBE542 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:54,945 WARN L322 ript$VariableManager]: TermVariable LBE111 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:54,945 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:54,945 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:54,945 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:54,945 WARN L322 ript$VariableManager]: TermVariable LBE99 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:54,945 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:54,945 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:54,945 WARN L322 ript$VariableManager]: TermVariable LBE590 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:56,398 WARN L322 ript$VariableManager]: TermVariable LBE577 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:56,398 WARN L322 ript$VariableManager]: TermVariable LBE533 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:56,398 WARN L322 ript$VariableManager]: TermVariable LBE587 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:56,398 WARN L322 ript$VariableManager]: TermVariable LBE542 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:56,398 WARN L322 ript$VariableManager]: TermVariable LBE111 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:56,398 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:56,398 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:56,398 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:56,398 WARN L322 ript$VariableManager]: TermVariable LBE99 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:56,398 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:56,398 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:56,398 WARN L322 ript$VariableManager]: TermVariable LBE590 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:57,756 WARN L322 ript$VariableManager]: TermVariable LBE577 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:57,757 WARN L322 ript$VariableManager]: TermVariable LBE533 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:57,757 WARN L322 ript$VariableManager]: TermVariable LBE587 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:57,757 WARN L322 ript$VariableManager]: TermVariable LBE542 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:57,757 WARN L322 ript$VariableManager]: TermVariable LBE111 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:57,757 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:57,757 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:57,757 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:57,757 WARN L322 ript$VariableManager]: TermVariable LBE99 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:57,757 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:57,757 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:57,757 WARN L322 ript$VariableManager]: TermVariable LBE590 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:59,088 WARN L322 ript$VariableManager]: TermVariable LBE577 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:59,088 WARN L322 ript$VariableManager]: TermVariable LBE533 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:59,088 WARN L322 ript$VariableManager]: TermVariable LBE587 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:59,088 WARN L322 ript$VariableManager]: TermVariable LBE542 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:59,089 WARN L322 ript$VariableManager]: TermVariable LBE111 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:59,089 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:59,089 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:59,089 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:59,089 WARN L322 ript$VariableManager]: TermVariable LBE99 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:59,089 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:59,089 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:08:59,089 WARN L322 ript$VariableManager]: TermVariable LBE590 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:09:01,844 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:09:01,844 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6924 [2022-12-06 00:09:01,844 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 273 flow [2022-12-06 00:09:01,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:01,845 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:01,845 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:01,859 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:09:02,045 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:09:02,046 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:09:02,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:02,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1520627378, now seen corresponding path program 1 times [2022-12-06 00:09:02,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:02,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633123306] [2022-12-06 00:09:02,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:02,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:02,229 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:09:02,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:02,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633123306] [2022-12-06 00:09:02,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633123306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:02,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:02,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:09:02,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411419493] [2022-12-06 00:09:02,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:02,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:02,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:02,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:02,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:02,231 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 00:09:02,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:02,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:02,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 00:09:02,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:02,375 INFO L130 PetriNetUnfolder]: 475/769 cut-off events. [2022-12-06 00:09:02,376 INFO L131 PetriNetUnfolder]: For 1348/1348 co-relation queries the response was YES. [2022-12-06 00:09:02,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2428 conditions, 769 events. 475/769 cut-off events. For 1348/1348 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2903 event pairs, 160 based on Foata normal form. 14/771 useless extension candidates. Maximal degree in co-relation 2024. Up to 602 conditions per place. [2022-12-06 00:09:02,379 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 38 selfloop transitions, 4 changer transitions 7/49 dead transitions. [2022-12-06 00:09:02,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 374 flow [2022-12-06 00:09:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:09:02,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:09:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 00:09:02,380 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 00:09:02,380 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 273 flow. Second operand 3 states and 40 transitions. [2022-12-06 00:09:02,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 374 flow [2022-12-06 00:09:02,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 312 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-12-06 00:09:02,383 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 201 flow [2022-12-06 00:09:02,383 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2022-12-06 00:09:02,384 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2022-12-06 00:09:02,384 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:02,384 INFO L89 Accepts]: Start accepts. Operand has 41 places, 40 transitions, 201 flow [2022-12-06 00:09:02,385 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:02,385 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:02,385 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 40 transitions, 201 flow [2022-12-06 00:09:02,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 40 transitions, 201 flow [2022-12-06 00:09:02,398 INFO L130 PetriNetUnfolder]: 17/93 cut-off events. [2022-12-06 00:09:02,398 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-12-06 00:09:02,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 93 events. 17/93 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 307 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 142. Up to 14 conditions per place. [2022-12-06 00:09:02,399 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 40 transitions, 201 flow [2022-12-06 00:09:02,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 00:09:02,400 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:09:02,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 00:09:02,401 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 201 flow [2022-12-06 00:09:02,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:02,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:02,401 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:02,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:09:02,401 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:09:02,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:02,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2132231823, now seen corresponding path program 1 times [2022-12-06 00:09:02,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:02,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115844756] [2022-12-06 00:09:02,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:02,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:03,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:03,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115844756] [2022-12-06 00:09:03,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115844756] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:09:03,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506355300] [2022-12-06 00:09:03,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:03,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:09:03,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:09:03,017 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:09:03,019 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:09:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:03,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 00:09:03,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:09:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:09:03,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:09:03,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506355300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:03,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:09:03,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-12-06 00:09:03,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642123833] [2022-12-06 00:09:03,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:03,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:09:03,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:03,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:09:03,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:09:03,208 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 00:09:03,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:03,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:03,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 00:09:03,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:03,407 INFO L130 PetriNetUnfolder]: 647/1087 cut-off events. [2022-12-06 00:09:03,407 INFO L131 PetriNetUnfolder]: For 1012/1012 co-relation queries the response was YES. [2022-12-06 00:09:03,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3015 conditions, 1087 events. 647/1087 cut-off events. For 1012/1012 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4649 event pairs, 324 based on Foata normal form. 24/1101 useless extension candidates. Maximal degree in co-relation 2716. Up to 480 conditions per place. [2022-12-06 00:09:03,411 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 44 selfloop transitions, 15 changer transitions 12/71 dead transitions. [2022-12-06 00:09:03,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 440 flow [2022-12-06 00:09:03,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:09:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:09:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-06 00:09:03,412 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2022-12-06 00:09:03,412 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 201 flow. Second operand 6 states and 63 transitions. [2022-12-06 00:09:03,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 440 flow [2022-12-06 00:09:03,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:09:03,416 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 266 flow [2022-12-06 00:09:03,416 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2022-12-06 00:09:03,417 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2022-12-06 00:09:03,417 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:03,417 INFO L89 Accepts]: Start accepts. Operand has 46 places, 46 transitions, 266 flow [2022-12-06 00:09:03,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:03,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:03,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 46 transitions, 266 flow [2022-12-06 00:09:03,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 46 transitions, 266 flow [2022-12-06 00:09:03,434 INFO L130 PetriNetUnfolder]: 21/137 cut-off events. [2022-12-06 00:09:03,434 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-06 00:09:03,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 137 events. 21/137 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 589 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 235. Up to 14 conditions per place. [2022-12-06 00:09:03,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 46 transitions, 266 flow [2022-12-06 00:09:03,436 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 00:09:03,436 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:09:03,437 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 00:09:03,437 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 266 flow [2022-12-06 00:09:03,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:03,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:03,437 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] [2022-12-06 00:09:03,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 00:09:03,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:09:03,660 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:03,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:03,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1442573577, now seen corresponding path program 1 times [2022-12-06 00:09:03,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:03,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491068829] [2022-12-06 00:09:03,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:03,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:09:04,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:04,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491068829] [2022-12-06 00:09:04,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491068829] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:09:04,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179827489] [2022-12-06 00:09:04,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:04,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:09:04,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:09:04,244 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:09:04,246 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:09:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:04,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 00:09:04,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:09:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:09:04,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:09:06,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:09:06,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 435 treesize of output 639 [2022-12-06 00:09:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:09:09,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179827489] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:09:09,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:09:09,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-06 00:09:09,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647719163] [2022-12-06 00:09:09,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:09:09,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:09:09,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:09,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:09:09,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:09:09,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 00:09:09,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 266 flow. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 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:09,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:09,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 00:09:09,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:09,878 INFO L130 PetriNetUnfolder]: 1168/1986 cut-off events. [2022-12-06 00:09:09,878 INFO L131 PetriNetUnfolder]: For 1741/1741 co-relation queries the response was YES. [2022-12-06 00:09:09,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5504 conditions, 1986 events. 1168/1986 cut-off events. For 1741/1741 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10349 event pairs, 330 based on Foata normal form. 16/1998 useless extension candidates. Maximal degree in co-relation 5125. Up to 337 conditions per place. [2022-12-06 00:09:09,885 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 97 selfloop transitions, 34 changer transitions 46/177 dead transitions. [2022-12-06 00:09:09,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 177 transitions, 1087 flow [2022-12-06 00:09:09,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:09:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:09:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 157 transitions. [2022-12-06 00:09:09,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41644562334217505 [2022-12-06 00:09:09,886 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 266 flow. Second operand 13 states and 157 transitions. [2022-12-06 00:09:09,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 177 transitions, 1087 flow [2022-12-06 00:09:09,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 177 transitions, 1065 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 00:09:09,894 INFO L231 Difference]: Finished difference. Result has 59 places, 63 transitions, 489 flow [2022-12-06 00:09:09,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=489, PETRI_PLACES=59, PETRI_TRANSITIONS=63} [2022-12-06 00:09:09,894 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 30 predicate places. [2022-12-06 00:09:09,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:09,894 INFO L89 Accepts]: Start accepts. Operand has 59 places, 63 transitions, 489 flow [2022-12-06 00:09:09,895 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:09,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:09,895 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 63 transitions, 489 flow [2022-12-06 00:09:09,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 63 transitions, 489 flow [2022-12-06 00:09:09,917 INFO L130 PetriNetUnfolder]: 32/240 cut-off events. [2022-12-06 00:09:09,917 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-12-06 00:09:09,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 240 events. 32/240 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1398 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 455. Up to 25 conditions per place. [2022-12-06 00:09:09,919 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 63 transitions, 489 flow [2022-12-06 00:09:09,919 INFO L188 LiptonReduction]: Number of co-enabled transitions 348 [2022-12-06 00:09:16,609 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:09:16,610 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6716 [2022-12-06 00:09:16,610 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 501 flow [2022-12-06 00:09:16,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 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:16,610 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:16,610 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:16,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 00:09:16,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:09:16,810 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:16,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:16,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1295621344, now seen corresponding path program 1 times [2022-12-06 00:09:16,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:16,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477766672] [2022-12-06 00:09:16,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:16,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:17,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:17,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477766672] [2022-12-06 00:09:17,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477766672] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:09:17,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390351515] [2022-12-06 00:09:17,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:17,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:09:17,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:09:17,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:09:17,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 00:09:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:17,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:09:17,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:09:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:17,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:09:18,270 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:09:18,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 557 treesize of output 648 [2022-12-06 00:09:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:19,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390351515] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:09:19,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:09:19,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 00:09:19,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101104604] [2022-12-06 00:09:19,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:09:19,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:09:19,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:19,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:09:19,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:09:19,508 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 00:09:19,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 501 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:19,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:19,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 00:09:19,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:21,304 INFO L130 PetriNetUnfolder]: 1235/2142 cut-off events. [2022-12-06 00:09:21,305 INFO L131 PetriNetUnfolder]: For 3467/3467 co-relation queries the response was YES. [2022-12-06 00:09:21,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6234 conditions, 2142 events. 1235/2142 cut-off events. For 3467/3467 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11550 event pairs, 316 based on Foata normal form. 98/2235 useless extension candidates. Maximal degree in co-relation 5600. Up to 392 conditions per place. [2022-12-06 00:09:21,333 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 80 selfloop transitions, 30 changer transitions 32/142 dead transitions. [2022-12-06 00:09:21,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 142 transitions, 1018 flow [2022-12-06 00:09:21,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:09:21,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:09:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2022-12-06 00:09:21,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3465909090909091 [2022-12-06 00:09:21,334 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 501 flow. Second operand 11 states and 122 transitions. [2022-12-06 00:09:21,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 142 transitions, 1018 flow [2022-12-06 00:09:21,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 142 transitions, 991 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 00:09:21,362 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 559 flow [2022-12-06 00:09:21,362 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=559, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2022-12-06 00:09:21,375 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 42 predicate places. [2022-12-06 00:09:21,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:21,375 INFO L89 Accepts]: Start accepts. Operand has 71 places, 63 transitions, 559 flow [2022-12-06 00:09:21,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:21,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:21,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 63 transitions, 559 flow [2022-12-06 00:09:21,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 63 transitions, 559 flow [2022-12-06 00:09:21,458 INFO L130 PetriNetUnfolder]: 30/261 cut-off events. [2022-12-06 00:09:21,458 INFO L131 PetriNetUnfolder]: For 277/277 co-relation queries the response was YES. [2022-12-06 00:09:21,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 261 events. 30/261 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1612 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 517. Up to 27 conditions per place. [2022-12-06 00:09:21,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 63 transitions, 559 flow [2022-12-06 00:09:21,472 INFO L188 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-06 00:09:39,814 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:09:39,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18447 [2022-12-06 00:09:39,822 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 585 flow [2022-12-06 00:09:39,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:39,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:39,822 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:39,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 00:09:40,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 00:09:40,027 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:40,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:40,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1434548131, now seen corresponding path program 1 times [2022-12-06 00:09:40,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:40,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354171920] [2022-12-06 00:09:40,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:40,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:09:40,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:40,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354171920] [2022-12-06 00:09:40,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354171920] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:09:40,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43419798] [2022-12-06 00:09:40,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:40,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:09:40,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:09:40,647 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:09:40,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 00:09:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:40,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 00:09:40,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:09:40,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 00:09:40,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:09:40,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43419798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:40,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:09:40,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2022-12-06 00:09:40,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137056753] [2022-12-06 00:09:40,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:40,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:09:40,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:40,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:09:40,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:09:40,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:09:40,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 585 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:40,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:40,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:09:40,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:41,600 INFO L130 PetriNetUnfolder]: 1261/2195 cut-off events. [2022-12-06 00:09:41,600 INFO L131 PetriNetUnfolder]: For 4415/4415 co-relation queries the response was YES. [2022-12-06 00:09:41,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6684 conditions, 2195 events. 1261/2195 cut-off events. For 4415/4415 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11904 event pairs, 1044 based on Foata normal form. 12/2202 useless extension candidates. Maximal degree in co-relation 5929. Up to 1977 conditions per place. [2022-12-06 00:09:41,640 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 54 selfloop transitions, 5 changer transitions 19/78 dead transitions. [2022-12-06 00:09:41,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 78 transitions, 783 flow [2022-12-06 00:09:41,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:09:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:09:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 00:09:41,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 00:09:41,660 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 585 flow. Second operand 3 states and 51 transitions. [2022-12-06 00:09:41,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 78 transitions, 783 flow [2022-12-06 00:09:41,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 721 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-06 00:09:41,701 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 498 flow [2022-12-06 00:09:41,701 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2022-12-06 00:09:41,712 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 38 predicate places. [2022-12-06 00:09:41,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:41,712 INFO L89 Accepts]: Start accepts. Operand has 67 places, 59 transitions, 498 flow [2022-12-06 00:09:41,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:41,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:41,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 59 transitions, 498 flow [2022-12-06 00:09:41,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 59 transitions, 498 flow [2022-12-06 00:09:41,782 INFO L130 PetriNetUnfolder]: 29/236 cut-off events. [2022-12-06 00:09:41,782 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2022-12-06 00:09:41,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 236 events. 29/236 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1387 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 502. Up to 26 conditions per place. [2022-12-06 00:09:41,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 59 transitions, 498 flow [2022-12-06 00:09:41,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-06 00:09:41,784 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:09:41,784 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-06 00:09:41,784 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 498 flow [2022-12-06 00:09:41,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:41,785 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:41,785 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:41,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 00:09:41,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:09:41,991 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:41,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:41,992 INFO L85 PathProgramCache]: Analyzing trace with hash 888802008, now seen corresponding path program 1 times [2022-12-06 00:09:41,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:41,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152703136] [2022-12-06 00:09:41,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:41,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:42,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:42,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152703136] [2022-12-06 00:09:42,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152703136] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:09:42,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480960372] [2022-12-06 00:09:42,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:42,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:09:42,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:09:42,552 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:09:42,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 00:09:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:42,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:09:42,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:09:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:09:43,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:09:43,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:09:43,960 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 589 treesize of output 624 [2022-12-06 00:09:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:09:44,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480960372] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:09:44,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:09:44,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-12-06 00:09:44,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141136536] [2022-12-06 00:09:44,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:09:44,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:09:44,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:44,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:09:44,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:09:44,788 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:09:44,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 498 flow. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 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:44,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:44,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:09:44,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:45,305 INFO L130 PetriNetUnfolder]: 1102/1934 cut-off events. [2022-12-06 00:09:45,305 INFO L131 PetriNetUnfolder]: For 3831/3831 co-relation queries the response was YES. [2022-12-06 00:09:45,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5614 conditions, 1934 events. 1102/1934 cut-off events. For 3831/3831 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10244 event pairs, 491 based on Foata normal form. 48/1977 useless extension candidates. Maximal degree in co-relation 5573. Up to 605 conditions per place. [2022-12-06 00:09:45,312 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 52 selfloop transitions, 11 changer transitions 37/100 dead transitions. [2022-12-06 00:09:45,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 100 transitions, 764 flow [2022-12-06 00:09:45,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:09:45,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:09:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 00:09:45,312 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2022-12-06 00:09:45,313 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 498 flow. Second operand 6 states and 81 transitions. [2022-12-06 00:09:45,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 100 transitions, 764 flow [2022-12-06 00:09:45,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 727 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-12-06 00:09:45,319 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 335 flow [2022-12-06 00:09:45,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2022-12-06 00:09:45,320 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 34 predicate places. [2022-12-06 00:09:45,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:45,320 INFO L89 Accepts]: Start accepts. Operand has 63 places, 47 transitions, 335 flow [2022-12-06 00:09:45,321 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:45,321 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:45,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 47 transitions, 335 flow [2022-12-06 00:09:45,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 47 transitions, 335 flow [2022-12-06 00:09:45,338 INFO L130 PetriNetUnfolder]: 22/147 cut-off events. [2022-12-06 00:09:45,338 INFO L131 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2022-12-06 00:09:45,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 147 events. 22/147 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 643 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 298. Up to 23 conditions per place. [2022-12-06 00:09:45,339 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 47 transitions, 335 flow [2022-12-06 00:09:45,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-06 00:09:52,475 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:52,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7156 [2022-12-06 00:09:52,476 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 336 flow [2022-12-06 00:09:52,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 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:52,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:52,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:52,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 00:09:52,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:09:52,679 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:52,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:52,680 INFO L85 PathProgramCache]: Analyzing trace with hash -366559004, now seen corresponding path program 1 times [2022-12-06 00:09:52,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:52,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22019244] [2022-12-06 00:09:52,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:52,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:54,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:54,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:54,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22019244] [2022-12-06 00:09:54,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22019244] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:09:54,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529144662] [2022-12-06 00:09:54,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:54,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:09:54,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:09:54,735 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:09:54,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 00:09:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:54,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 00:09:54,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:09:54,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-12-06 00:09:54,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:09:54,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-12-06 00:09:54,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2022-12-06 00:09:55,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:09:55,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:09:55,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:09:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:09:55,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:10:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:10:06,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529144662] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:10:06,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:10:06,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2022-12-06 00:10:06,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267581321] [2022-12-06 00:10:06,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:10:06,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 00:10:06,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:06,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 00:10:06,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=229, Unknown=7, NotChecked=0, Total=306 [2022-12-06 00:10:06,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 00:10:06,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 336 flow. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:06,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:06,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 00:10:06,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:06,227 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse52 (* c_~node_back~0 4)) (.cse51 (* c_~node_front~0 4))) (let ((.cse2 (= c_~node_state~0 0)) (.cse58 (+ .cse51 c_~node~0.offset)) (.cse60 (select |c_#memory_int| c_~node~0.base)) (.cse16 (+ .cse52 c_~node~0.offset))) (let ((.cse1 (= c_~node_state~0 1)) (.cse54 (= c_~manager_state~0 1)) (.cse53 (= c_~manager_state~0 0)) (.cse28 (<= c_~node_size~0 c_~node_front~0)) (.cse30 (<= c_~node_back~0 c_~node_front~0)) (.cse56 (= 2 c_~manager_state~0)) (.cse55 (= 3 c_~manager_state~0)) (.cse32 (select .cse60 .cse16)) (.cse29 (select .cse60 .cse58)) (.cse26 (not .cse2)) (.cse27 (< c_~node_front~0 0)) (.cse49 (<= (+ c_~node_back~0 1) c_~node_front~0))) (let ((.cse3 (not (= (mod (* c_~safe~0 255) 256) 0))) (.cse7 (select |c_#memory_int| c_~client~0.base)) (.cse17 (or .cse26 .cse27 .cse49 (forall ((v_ArrVal_705 (Array Int Int))) (let ((.cse59 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~node~0.base))) (= (select .cse59 .cse58) (select .cse59 .cse16)))))) (.cse25 (or .cse26 .cse27 .cse49 (= .cse32 .cse29))) (.cse5 (select |c_#memory_int| c_~manager~0.base)) (.cse34 (or .cse26 .cse27 .cse49 (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int))) (let ((.cse57 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~node~0.base))) (= (select .cse57 .cse58) (select .cse57 .cse16)))))) (.cse0 (or .cse54 .cse53 (and (or .cse27 .cse28 .cse30) .cse2) .cse56 .cse55)) (.cse9 (not .cse56)) (.cse20 (not .cse55)) (.cse4 (or .cse26 .cse27 .cse28 .cse30)) (.cse8 (not .cse1)) (.cse21 (or .cse1 .cse2)) (.cse23 (not .cse54)) (.cse14 (not (< c_~node_back~0 c_~node_size~0))) (.cse18 (not .cse53)) (.cse19 (not (<= 0 c_~node_back~0)))) (and .cse0 (or .cse1 .cse2 .cse3) (or (and .cse4 (or (forall ((~manager_back~0 Int) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (let ((.cse6 (select .cse7 (+ (* v_~client_back~0_170 4) ~client~0.offset)))) (or (= (select .cse5 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))) .cse6) (not (<= 1 v_~manager_front~0_185)) (not (= (select .cse5 (+ ~manager~0.offset (* ~manager_back~0 4))) .cse6)) (not (< v_~manager_front~0_185 (+ ~manager_back~0 1))) (not (<= 0 v_~client_back~0_170))))) .cse8) (or .cse1 (forall ((v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (= (select .cse5 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))) (select .cse7 (+ (* v_~client_back~0_170 4) ~client~0.offset))) (not (<= 1 v_~manager_front~0_185)) (not (<= 0 v_~client_back~0_170)))) .cse2)) .cse9) (or (and .cse4 (or (forall ((~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (let ((.cse10 (select (select .cse12 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset))) (.cse11 (select .cse12 c_~manager~0.base))) (or (not (<= 1 v_~manager_front~0_185)) (= .cse10 (select .cse11 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4)))) (not (= .cse10 (select .cse11 (+ ~manager~0.offset (* ~manager_back~0 4))))) (not (< v_~manager_front~0_185 (+ ~manager_back~0 1))) (not (<= 0 v_~client_back~0_170)))))) .cse8) (or .cse1 (forall ((v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse13 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset)) (select (select .cse13 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))) (not (<= 0 v_~client_back~0_170)))) .cse2)) .cse9) (or .cse14 (and (or (forall ((v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse15 c_~node~0.base) .cse16) (select (select .cse15 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))) (not (<= 1 v_~manager_front~0_185)))) .cse2) .cse17) .cse18 .cse19) (or (not (< c_~manager_back~0 c_~manager_size~0)) (not (= (select .cse5 (+ c_~manager~0.offset (* c_~manager_back~0 4))) c_~ok~0)) (not (<= 0 c_~manager_back~0)) .cse3 .cse8) (or .cse20 (and .cse4 .cse21 (or (forall ((~manager_back~0 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (< ~manager_back~0 1) (not (= (select .cse5 (+ ~manager~0.offset (* ~manager_back~0 4))) (select .cse7 (+ (* v_~client_back~0_170 4) (- 4) ~client~0.offset)))) (not (<= 1 v_~client_back~0_170)))) .cse8))) (or .cse14 (and .cse17 (or (forall ((~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (<= ~manager_back~0 v_~manager_front~0_185) (< v_~manager_front~0_185 0) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~manager~0.base))) (= (select .cse22 (+ ~manager~0.offset (* v_~manager_front~0_185 4))) (select .cse22 (+ ~manager~0.offset (* ~manager_back~0 4))))))) .cse8) .cse21) .cse23 .cse19) (or .cse20 (and .cse4 .cse21 (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse24 c_~client~0.base) (+ (* v_~client_back~0_170 4) (- 4) ~client~0.offset)) (select (select .cse24 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4)))))) (< ~manager_back~0 1) (not (<= 1 v_~client_back~0_170)))) .cse8))) (or .cse14 .cse23 (and .cse25 .cse21 (or (forall ((~manager_back~0 Int) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (= (select .cse5 (+ ~manager~0.offset (* ~manager_back~0 4))) (select .cse5 (+ ~manager~0.offset (* v_~manager_front~0_185 4)))) (<= ~manager_back~0 v_~manager_front~0_185) (< v_~manager_front~0_185 0))) .cse8)) .cse19) (or .cse26 .cse27 .cse28 (= c_~update~0 .cse29) .cse30) (or .cse20 (and .cse4 (or (forall ((~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (< ~manager_back~0 1) (not (<= 1 v_~client_back~0_170)) (not (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse31 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) (select (select .cse31 c_~client~0.base) (+ (* v_~client_back~0_170 4) (- 4) ~client~0.offset))))))) .cse8) .cse21)) (or .cse14 .cse18 (and .cse25 (or .cse2 (forall ((v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (= .cse32 (select .cse5 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4)))))))) .cse19) (= c_~safe~0 1) (or .cse14 .cse23 (and (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (<= ~manager_back~0 v_~manager_front~0_185) (< v_~manager_front~0_185 0) (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~manager~0.base))) (= (select .cse33 (+ ~manager~0.offset (* ~manager_back~0 4))) (select .cse33 (+ ~manager~0.offset (* v_~manager_front~0_185 4))))))) .cse8) .cse21 .cse34) .cse19) (or (and .cse4 (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (let ((.cse35 (select (select .cse37 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset))) (.cse36 (select .cse37 c_~manager~0.base))) (or (not (= .cse35 (select .cse36 (+ ~manager~0.offset (* ~manager_back~0 4))))) (not (<= 1 v_~manager_front~0_185)) (= .cse35 (select .cse36 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4)))) (not (< v_~manager_front~0_185 (+ ~manager_back~0 1))) (not (<= 0 v_~client_back~0_170)))))) .cse8) (or .cse1 (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse38 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset)) (select (select .cse38 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))) (not (<= 0 v_~client_back~0_170)))) .cse2)) .cse9) (or (and (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse39 c_~node~0.base) .cse16) (select (select .cse39 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))))) .cse2) .cse34) .cse14 .cse18 .cse19) (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse48 (+ .cse52 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse46 (or .cse26 .cse27 .cse49 (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int))) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (select .cse50 (+ .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse50 .cse48))))))) (and .cse0 (or (and .cse4 (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (let ((.cse40 (select (select .cse42 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset))) (.cse41 (select .cse42 c_~manager~0.base))) (or (not (<= 1 v_~manager_front~0_185)) (not (= .cse40 (select .cse41 (+ ~manager~0.offset (* ~manager_back~0 4))))) (= .cse40 (select .cse41 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4)))) (not (< v_~manager_front~0_185 (+ ~manager_back~0 1))) (not (<= 0 v_~client_back~0_170)))))) .cse8) (or .cse1 (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse43 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse43 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset)) (select (select .cse43 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))) (not (<= 0 v_~client_back~0_170)))) .cse2)) .cse9) (or .cse20 (and .cse4 (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse44 c_~client~0.base) (+ (* v_~client_back~0_170 4) (- 4) ~client~0.offset)) (select (select .cse44 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4)))))) (< ~manager_back~0 1) (not (<= 1 v_~client_back~0_170)))) .cse8) .cse21)) (or .cse14 (and (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (<= ~manager_back~0 v_~manager_front~0_185) (< v_~manager_front~0_185 0) (let ((.cse45 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~manager~0.base))) (= (select .cse45 (+ ~manager~0.offset (* v_~manager_front~0_185 4))) (select .cse45 (+ ~manager~0.offset (* ~manager_back~0 4))))))) .cse8) .cse21 .cse46) .cse23 .cse19) (or .cse14 .cse18 (and (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse47 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))) (select (select .cse47 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse48))))) .cse2) .cse46) .cse19)))))))))) is different from false [2022-12-06 00:10:23,454 WARN L233 SmtUtils]: Spent 16.45s on a formula simplification. DAG size of input: 266 DAG size of output: 251 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:10:26,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:10:28,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:10:30,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:10:33,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:10:33,398 INFO L130 PetriNetUnfolder]: 1857/3152 cut-off events. [2022-12-06 00:10:33,398 INFO L131 PetriNetUnfolder]: For 5505/5505 co-relation queries the response was YES. [2022-12-06 00:10:33,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9627 conditions, 3152 events. 1857/3152 cut-off events. For 5505/5505 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 18017 event pairs, 666 based on Foata normal form. 6/3145 useless extension candidates. Maximal degree in co-relation 9555. Up to 1294 conditions per place. [2022-12-06 00:10:33,409 INFO L137 encePairwiseOnDemand]: 11/32 looper letters, 134 selfloop transitions, 53 changer transitions 59/246 dead transitions. [2022-12-06 00:10:33,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 246 transitions, 1619 flow [2022-12-06 00:10:33,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 00:10:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 00:10:33,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 228 transitions. [2022-12-06 00:10:33,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.285 [2022-12-06 00:10:33,410 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 336 flow. Second operand 25 states and 228 transitions. [2022-12-06 00:10:33,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 246 transitions, 1619 flow [2022-12-06 00:10:33,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 246 transitions, 1515 flow, removed 24 selfloop flow, removed 8 redundant places. [2022-12-06 00:10:33,420 INFO L231 Difference]: Finished difference. Result has 85 places, 94 transitions, 859 flow [2022-12-06 00:10:33,420 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=859, PETRI_PLACES=85, PETRI_TRANSITIONS=94} [2022-12-06 00:10:33,420 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 56 predicate places. [2022-12-06 00:10:33,421 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:33,421 INFO L89 Accepts]: Start accepts. Operand has 85 places, 94 transitions, 859 flow [2022-12-06 00:10:33,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:33,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:33,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 94 transitions, 859 flow [2022-12-06 00:10:33,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 94 transitions, 859 flow [2022-12-06 00:10:33,467 INFO L130 PetriNetUnfolder]: 48/364 cut-off events. [2022-12-06 00:10:33,467 INFO L131 PetriNetUnfolder]: For 386/386 co-relation queries the response was YES. [2022-12-06 00:10:33,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 364 events. 48/364 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2525 event pairs, 0 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 832. Up to 56 conditions per place. [2022-12-06 00:10:33,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 94 transitions, 859 flow [2022-12-06 00:10:33,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 522 [2022-12-06 00:10:56,954 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:10:56,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23534 [2022-12-06 00:10:56,955 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 94 transitions, 895 flow [2022-12-06 00:10:56,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:56,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:56,955 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:56,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 00:10:57,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 00:10:57,156 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:57,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:57,156 INFO L85 PathProgramCache]: Analyzing trace with hash -731742440, now seen corresponding path program 1 times [2022-12-06 00:10:57,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:57,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489997561] [2022-12-06 00:10:57,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:57,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:57,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:10:57,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:57,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489997561] [2022-12-06 00:10:57,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489997561] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:57,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531736455] [2022-12-06 00:10:57,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:57,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:57,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:57,549 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:10:57,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 00:10:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:57,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 00:10:57,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:10:57,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:10:58,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:10:58,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 301 [2022-12-06 00:10:58,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:10:58,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531736455] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:10:58,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:10:58,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-06 00:10:58,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977952004] [2022-12-06 00:10:58,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:10:58,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:10:58,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:58,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:10:58,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:10:58,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:10:58,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 94 transitions, 895 flow. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 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:58,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:58,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:10:58,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:59,017 INFO L130 PetriNetUnfolder]: 2336/4021 cut-off events. [2022-12-06 00:10:59,018 INFO L131 PetriNetUnfolder]: For 9965/9965 co-relation queries the response was YES. [2022-12-06 00:10:59,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13043 conditions, 4021 events. 2336/4021 cut-off events. For 9965/9965 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 24419 event pairs, 463 based on Foata normal form. 168/4174 useless extension candidates. Maximal degree in co-relation 12154. Up to 728 conditions per place. [2022-12-06 00:10:59,031 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 135 selfloop transitions, 49 changer transitions 29/213 dead transitions. [2022-12-06 00:10:59,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 213 transitions, 1808 flow [2022-12-06 00:10:59,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:10:59,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:10:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2022-12-06 00:10:59,033 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3504273504273504 [2022-12-06 00:10:59,033 INFO L175 Difference]: Start difference. First operand has 84 places, 94 transitions, 895 flow. Second operand 12 states and 164 transitions. [2022-12-06 00:10:59,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 213 transitions, 1808 flow [2022-12-06 00:10:59,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 213 transitions, 1732 flow, removed 26 selfloop flow, removed 1 redundant places. [2022-12-06 00:10:59,051 INFO L231 Difference]: Finished difference. Result has 100 places, 97 transitions, 1033 flow [2022-12-06 00:10:59,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1033, PETRI_PLACES=100, PETRI_TRANSITIONS=97} [2022-12-06 00:10:59,051 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:59,052 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:59,052 INFO L89 Accepts]: Start accepts. Operand has 100 places, 97 transitions, 1033 flow [2022-12-06 00:10:59,052 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:59,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:59,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 97 transitions, 1033 flow [2022-12-06 00:10:59,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 97 transitions, 1033 flow [2022-12-06 00:10:59,098 INFO L130 PetriNetUnfolder]: 52/461 cut-off events. [2022-12-06 00:10:59,098 INFO L131 PetriNetUnfolder]: For 807/807 co-relation queries the response was YES. [2022-12-06 00:10:59,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 461 events. 52/461 cut-off events. For 807/807 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3549 event pairs, 1 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 1229. Up to 77 conditions per place. [2022-12-06 00:10:59,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 97 transitions, 1033 flow [2022-12-06 00:10:59,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 534 [2022-12-06 00:10:59,101 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:59,101 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 00:10:59,101 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 1033 flow [2022-12-06 00:10:59,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 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:59,102 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:59,102 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:59,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 00:10:59,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 00:10:59,308 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:59,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash 862727906, now seen corresponding path program 1 times [2022-12-06 00:10:59,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:59,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711380532] [2022-12-06 00:10:59,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:59,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:10:59,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:59,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711380532] [2022-12-06 00:10:59,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711380532] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:59,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347443367] [2022-12-06 00:10:59,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:59,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:59,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:59,988 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:11:00,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 00:11:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:00,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 00:11:00,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:11:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:11:00,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:11:01,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:11:01,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 446 treesize of output 625 [2022-12-06 00:11:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:11:05,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347443367] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:11:05,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:11:05,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-06 00:11:05,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439448568] [2022-12-06 00:11:05,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:11:05,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:11:05,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:05,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:11:05,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:11:05,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 00:11:05,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 97 transitions, 1033 flow. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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:05,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:05,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 00:11:05,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:07,076 INFO L130 PetriNetUnfolder]: 2783/4811 cut-off events. [2022-12-06 00:11:07,077 INFO L131 PetriNetUnfolder]: For 14652/14652 co-relation queries the response was YES. [2022-12-06 00:11:07,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16638 conditions, 4811 events. 2783/4811 cut-off events. For 14652/14652 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 30338 event pairs, 707 based on Foata normal form. 6/4799 useless extension candidates. Maximal degree in co-relation 16603. Up to 1849 conditions per place. [2022-12-06 00:11:07,096 INFO L137 encePairwiseOnDemand]: 20/36 looper letters, 96 selfloop transitions, 55 changer transitions 32/183 dead transitions. [2022-12-06 00:11:07,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 183 transitions, 1823 flow [2022-12-06 00:11:07,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:11:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:11:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-12-06 00:11:07,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33641975308641975 [2022-12-06 00:11:07,098 INFO L175 Difference]: Start difference. First operand has 97 places, 97 transitions, 1033 flow. Second operand 9 states and 109 transitions. [2022-12-06 00:11:07,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 183 transitions, 1823 flow [2022-12-06 00:11:07,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 183 transitions, 1760 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-06 00:11:07,156 INFO L231 Difference]: Finished difference. Result has 103 places, 112 transitions, 1331 flow [2022-12-06 00:11:07,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1331, PETRI_PLACES=103, PETRI_TRANSITIONS=112} [2022-12-06 00:11:07,157 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 74 predicate places. [2022-12-06 00:11:07,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:07,157 INFO L89 Accepts]: Start accepts. Operand has 103 places, 112 transitions, 1331 flow [2022-12-06 00:11:07,158 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:07,158 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:07,158 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 112 transitions, 1331 flow [2022-12-06 00:11:07,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 112 transitions, 1331 flow [2022-12-06 00:11:07,260 INFO L130 PetriNetUnfolder]: 62/567 cut-off events. [2022-12-06 00:11:07,260 INFO L131 PetriNetUnfolder]: For 1165/1165 co-relation queries the response was YES. [2022-12-06 00:11:07,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1553 conditions, 567 events. 62/567 cut-off events. For 1165/1165 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4706 event pairs, 0 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 1372. Up to 76 conditions per place. [2022-12-06 00:11:07,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 112 transitions, 1331 flow [2022-12-06 00:11:07,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 672 [2022-12-06 00:11:07,264 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:11:07,271 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-06 00:11:07,271 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 112 transitions, 1331 flow [2022-12-06 00:11:07,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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:07,271 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:07,271 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:07,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 00:11:07,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 00:11:07,479 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:07,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:07,480 INFO L85 PathProgramCache]: Analyzing trace with hash -121457454, now seen corresponding path program 1 times [2022-12-06 00:11:07,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:07,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261782868] [2022-12-06 00:11:07,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:07,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:08,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:11:08,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:08,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261782868] [2022-12-06 00:11:08,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261782868] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:11:08,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928614926] [2022-12-06 00:11:08,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:08,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:11:08,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:11:08,187 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:11:08,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 00:11:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:08,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 00:11:08,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:11:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:11:08,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:11:12,569 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:11:12,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 807 treesize of output 1909 [2022-12-06 00:13:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:13:25,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928614926] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:13:25,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:13:25,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2022-12-06 00:13:25,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222007241] [2022-12-06 00:13:25,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:13:25,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 00:13:25,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:25,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 00:13:25,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-12-06 00:13:25,617 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 00:13:25,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 112 transitions, 1331 flow. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 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:13:25,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:25,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 00:13:25,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:29,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:13:30,536 INFO L130 PetriNetUnfolder]: 2890/5067 cut-off events. [2022-12-06 00:13:30,537 INFO L131 PetriNetUnfolder]: For 17465/17465 co-relation queries the response was YES. [2022-12-06 00:13:30,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17443 conditions, 5067 events. 2890/5067 cut-off events. For 17465/17465 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 33024 event pairs, 651 based on Foata normal form. 114/5160 useless extension candidates. Maximal degree in co-relation 16324. Up to 1036 conditions per place. [2022-12-06 00:13:30,554 INFO L137 encePairwiseOnDemand]: 17/36 looper letters, 92 selfloop transitions, 62 changer transitions 87/241 dead transitions. [2022-12-06 00:13:30,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 241 transitions, 2206 flow [2022-12-06 00:13:30,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 00:13:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 00:13:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 179 transitions. [2022-12-06 00:13:30,573 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29248366013071897 [2022-12-06 00:13:30,573 INFO L175 Difference]: Start difference. First operand has 103 places, 112 transitions, 1331 flow. Second operand 17 states and 179 transitions. [2022-12-06 00:13:30,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 241 transitions, 2206 flow [2022-12-06 00:13:30,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 241 transitions, 2159 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:30,640 INFO L231 Difference]: Finished difference. Result has 121 places, 106 transitions, 1319 flow [2022-12-06 00:13:30,640 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1319, PETRI_PLACES=121, PETRI_TRANSITIONS=106} [2022-12-06 00:13:30,640 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 92 predicate places. [2022-12-06 00:13:30,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:30,640 INFO L89 Accepts]: Start accepts. Operand has 121 places, 106 transitions, 1319 flow [2022-12-06 00:13:30,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:30,641 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:30,641 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 106 transitions, 1319 flow [2022-12-06 00:13:30,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 106 transitions, 1319 flow [2022-12-06 00:13:30,688 INFO L130 PetriNetUnfolder]: 53/503 cut-off events. [2022-12-06 00:13:30,688 INFO L131 PetriNetUnfolder]: For 1203/1203 co-relation queries the response was YES. [2022-12-06 00:13:30,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 503 events. 53/503 cut-off events. For 1203/1203 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4018 event pairs, 0 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 1338. Up to 63 conditions per place. [2022-12-06 00:13:30,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 106 transitions, 1319 flow [2022-12-06 00:13:30,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 588 [2022-12-06 00:13:34,391 WARN L322 ript$VariableManager]: TermVariable LBE578 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:34,392 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:34,392 WARN L322 ript$VariableManager]: TermVariable LBE606 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:34,392 WARN L322 ript$VariableManager]: TermVariable LBE182 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:34,392 WARN L322 ript$VariableManager]: TermVariable LBE170 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:34,392 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:35,298 WARN L322 ript$VariableManager]: TermVariable LBE578 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:35,298 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:35,298 WARN L322 ript$VariableManager]: TermVariable LBE606 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:35,298 WARN L322 ript$VariableManager]: TermVariable LBE182 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:35,298 WARN L322 ript$VariableManager]: TermVariable LBE170 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:35,299 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:36,181 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:13:36,182 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5542 [2022-12-06 00:13:36,182 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 1325 flow [2022-12-06 00:13:36,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 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:13:36,182 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:36,182 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:36,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-06 00:13:36,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 00:13:36,383 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:36,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:36,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1980893660, now seen corresponding path program 1 times [2022-12-06 00:13:36,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:36,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406807076] [2022-12-06 00:13:36,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:36,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:37,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:13:37,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:37,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406807076] [2022-12-06 00:13:37,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406807076] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:13:37,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412483450] [2022-12-06 00:13:37,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:37,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:13:37,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:13:37,799 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:13:37,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 00:13:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:37,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 00:13:37,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:13:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:13:38,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:13:39,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:13:39,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 434 treesize of output 636 [2022-12-06 00:13:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:13:41,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412483450] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:13:41,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:13:41,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 00:13:41,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731013046] [2022-12-06 00:13:41,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:13:41,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:13:41,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:41,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:13:41,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:13:41,522 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 00:13:41,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 1325 flow. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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:13:41,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:41,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 00:13:41,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:42,369 INFO L130 PetriNetUnfolder]: 2106/3763 cut-off events. [2022-12-06 00:13:42,369 INFO L131 PetriNetUnfolder]: For 14972/14972 co-relation queries the response was YES. [2022-12-06 00:13:42,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13316 conditions, 3763 events. 2106/3763 cut-off events. For 14972/14972 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 23596 event pairs, 521 based on Foata normal form. 48/3795 useless extension candidates. Maximal degree in co-relation 12433. Up to 746 conditions per place. [2022-12-06 00:13:42,410 INFO L137 encePairwiseOnDemand]: 22/37 looper letters, 86 selfloop transitions, 44 changer transitions 38/168 dead transitions. [2022-12-06 00:13:42,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 168 transitions, 1726 flow [2022-12-06 00:13:42,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:13:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:13:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2022-12-06 00:13:42,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2022-12-06 00:13:42,411 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 1325 flow. Second operand 9 states and 117 transitions. [2022-12-06 00:13:42,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 168 transitions, 1726 flow [2022-12-06 00:13:42,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 168 transitions, 1577 flow, removed 37 selfloop flow, removed 12 redundant places. [2022-12-06 00:13:42,507 INFO L231 Difference]: Finished difference. Result has 108 places, 91 transitions, 1117 flow [2022-12-06 00:13:42,523 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1117, PETRI_PLACES=108, PETRI_TRANSITIONS=91} [2022-12-06 00:13:42,524 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2022-12-06 00:13:42,524 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:42,524 INFO L89 Accepts]: Start accepts. Operand has 108 places, 91 transitions, 1117 flow [2022-12-06 00:13:42,524 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:42,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:42,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 91 transitions, 1117 flow [2022-12-06 00:13:42,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 91 transitions, 1117 flow [2022-12-06 00:13:42,570 INFO L130 PetriNetUnfolder]: 39/461 cut-off events. [2022-12-06 00:13:42,571 INFO L131 PetriNetUnfolder]: For 879/879 co-relation queries the response was YES. [2022-12-06 00:13:42,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 461 events. 39/461 cut-off events. For 879/879 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3641 event pairs, 0 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 1045. Up to 54 conditions per place. [2022-12-06 00:13:42,573 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 91 transitions, 1117 flow [2022-12-06 00:13:42,573 INFO L188 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-06 00:13:42,597 WARN L322 ript$VariableManager]: TermVariable LBE577 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:42,597 WARN L322 ript$VariableManager]: TermVariable LBE533 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:42,597 WARN L322 ript$VariableManager]: TermVariable LBE111 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:42,597 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:42,597 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:42,597 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:42,597 WARN L322 ript$VariableManager]: TermVariable LBE587 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:42,597 WARN L322 ript$VariableManager]: TermVariable LBE542 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:42,597 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:42,597 WARN L322 ript$VariableManager]: TermVariable LBE99 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:42,597 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:42,597 WARN L322 ript$VariableManager]: TermVariable LBE590 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:42,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 00:13:42,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 00:13:42,804 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_~safe~0_141 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 00:13:42,807 INFO L158 Benchmark]: Toolchain (without parser) took 313858.43ms. Allocated memory was 199.2MB in the beginning and 876.6MB in the end (delta: 677.4MB). Free memory was 175.7MB in the beginning and 363.8MB in the end (delta: -188.1MB). Peak memory consumption was 491.0MB. Max. memory is 8.0GB. [2022-12-06 00:13:42,807 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:13:42,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.53ms. Allocated memory is still 199.2MB. Free memory was 175.6MB in the beginning and 160.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 00:13:42,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.89ms. Allocated memory is still 199.2MB. Free memory was 160.5MB in the beginning and 158.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:13:42,807 INFO L158 Benchmark]: Boogie Preprocessor took 27.80ms. Allocated memory is still 199.2MB. Free memory was 158.0MB in the beginning and 155.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:13:42,807 INFO L158 Benchmark]: RCFGBuilder took 604.86ms. Allocated memory is still 199.2MB. Free memory was 155.7MB in the beginning and 155.0MB in the end (delta: 618.4kB). Peak memory consumption was 30.0MB. Max. memory is 8.0GB. [2022-12-06 00:13:42,808 INFO L158 Benchmark]: TraceAbstraction took 312892.71ms. Allocated memory was 199.2MB in the beginning and 876.6MB in the end (delta: 677.4MB). Free memory was 154.0MB in the beginning and 363.8MB in the end (delta: -209.8MB). Peak memory consumption was 468.4MB. Max. memory is 8.0GB. [2022-12-06 00:13:42,808 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 272.53ms. Allocated memory is still 199.2MB. Free memory was 175.6MB in the beginning and 160.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.89ms. Allocated memory is still 199.2MB. Free memory was 160.5MB in the beginning and 158.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.80ms. Allocated memory is still 199.2MB. Free memory was 158.0MB in the beginning and 155.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 604.86ms. Allocated memory is still 199.2MB. Free memory was 155.7MB in the beginning and 155.0MB in the end (delta: 618.4kB). Peak memory consumption was 30.0MB. Max. memory is 8.0GB. * TraceAbstraction took 312892.71ms. Allocated memory was 199.2MB in the beginning and 876.6MB in the end (delta: 677.4MB). Free memory was 154.0MB in the beginning and 363.8MB in the end (delta: -209.8MB). Peak memory consumption was 468.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3s, 223 PlacesBefore, 29 PlacesAfterwards, 240 TransitionsBefore, 25 TransitionsAfterwards, 2442 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 154 TrivialYvCompositions, 40 ConcurrentYvCompositions, 16 ChoiceCompositions, 210 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1539, independent: 1539, independent conditional: 1539, 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: 1539, independent: 1539, independent conditional: 0, independent unconditional: 1539, 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: 1539, independent: 1539, independent conditional: 0, independent unconditional: 1539, 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: 1539, independent: 1539, independent conditional: 0, independent unconditional: 1539, 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: 1164, independent: 1164, independent conditional: 0, independent unconditional: 1164, 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: 1164, independent: 1164, independent conditional: 0, independent unconditional: 1164, 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: 1539, independent: 375, independent conditional: 0, independent unconditional: 375, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1164, unknown conditional: 0, unknown unconditional: 1164] , Statistics on independence cache: Total cache size (in pairs): 2182, Positive cache size: 2182, Positive conditional cache size: 0, Positive unconditional cache size: 2182, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 26 PlacesBefore, 26 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 120 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 3.8s, 30 PlacesBefore, 30 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 30 PlacesBefore, 30 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 102 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 31 PlacesBefore, 31 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 96 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.8s, 33 PlacesBefore, 33 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 14, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 3.7s, 36 PlacesBefore, 36 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 14, Positive cache size: 14, Positive conditional cache size: 14, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 6.9s, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 12, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 41 PlacesBefore, 41 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 206 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): 47, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 46 PlacesBefore, 46 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 218 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): 47, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 6.7s, 59 PlacesBefore, 59 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 47, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 18.3s, 69 PlacesBefore, 69 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 47, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 65 PlacesBefore, 65 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 306 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): 47, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 7.1s, 58 PlacesBefore, 57 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 47, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 23.5s, 84 PlacesBefore, 84 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 47, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 97 PlacesBefore, 97 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 534 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): 47, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 103 PlacesBefore, 103 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 672 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): 47, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.5s, 113 PlacesBefore, 112 PlacesAfterwards, 106 TransitionsBefore, 105 TransitionsAfterwards, 588 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 62, Positive conditional cache size: 62, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_~safe~0_141 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_~safe~0_141 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 00:13:42,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...