/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 10:38:26,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 10:38:26,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 10:38:26,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 10:38:26,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 10:38:26,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 10:38:26,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 10:38:26,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 10:38:26,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 10:38:26,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 10:38:26,323 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 10:38:26,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 10:38:26,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 10:38:26,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 10:38:26,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 10:38:26,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 10:38:26,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 10:38:26,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 10:38:26,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 10:38:26,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 10:38:26,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 10:38:26,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 10:38:26,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 10:38:26,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 10:38:26,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 10:38:26,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 10:38:26,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 10:38:26,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 10:38:26,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 10:38:26,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 10:38:26,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 10:38:26,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 10:38:26,351 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 10:38:26,352 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 10:38:26,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 10:38:26,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 10:38:26,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 10:38:26,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 10:38:26,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 10:38:26,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 10:38:26,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 10:38:26,357 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 10:38:26,382 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 10:38:26,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 10:38:26,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 10:38:26,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 10:38:26,384 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 10:38:26,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 10:38:26,385 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 10:38:26,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 10:38:26,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 10:38:26,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 10:38:26,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 10:38:26,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 10:38:26,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 10:38:26,386 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 10:38:26,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 10:38:26,386 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 10:38:26,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 10:38:26,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 10:38:26,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 10:38:26,386 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 10:38:26,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 10:38:26,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:38:26,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 10:38:26,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 10:38:26,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 10:38:26,387 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 10:38:26,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 10:38:26,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 10:38:26,387 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 10:38:26,388 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-13 10:38:26,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 10:38:26,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 10:38:26,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 10:38:26,693 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 10:38:26,695 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 10:38:26,696 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c [2022-12-13 10:38:27,744 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 10:38:27,927 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 10:38:27,928 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c [2022-12-13 10:38:27,932 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03ad24c9/b074da996e7d45b8bd0e0ce7e868c042/FLAGe0e760c43 [2022-12-13 10:38:27,944 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03ad24c9/b074da996e7d45b8bd0e0ce7e868c042 [2022-12-13 10:38:27,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 10:38:27,948 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 10:38:27,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 10:38:27,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 10:38:27,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 10:38:27,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:38:27" (1/1) ... [2022-12-13 10:38:27,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@145e29a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:38:27, skipping insertion in model container [2022-12-13 10:38:27,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:38:27" (1/1) ... [2022-12-13 10:38:27,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 10:38:27,982 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 10:38:28,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,131 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-commit-2.wvr.c[5846,5859] [2022-12-13 10:38:28,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:38:28,159 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 10:38:28,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:38:28,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:38:28,199 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-commit-2.wvr.c[5846,5859] [2022-12-13 10:38:28,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:38:28,220 INFO L208 MainTranslator]: Completed translation [2022-12-13 10:38:28,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:38:28 WrapperNode [2022-12-13 10:38:28,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 10:38:28,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 10:38:28,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 10:38:28,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 10:38:28,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:38:28" (1/1) ... [2022-12-13 10:38:28,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:38:28" (1/1) ... [2022-12-13 10:38:28,286 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 456 [2022-12-13 10:38:28,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 10:38:28,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 10:38:28,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 10:38:28,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 10:38:28,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:38:28" (1/1) ... [2022-12-13 10:38:28,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:38:28" (1/1) ... [2022-12-13 10:38:28,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:38:28" (1/1) ... [2022-12-13 10:38:28,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:38:28" (1/1) ... [2022-12-13 10:38:28,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:38:28" (1/1) ... [2022-12-13 10:38:28,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:38:28" (1/1) ... [2022-12-13 10:38:28,325 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:38:28" (1/1) ... [2022-12-13 10:38:28,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:38:28" (1/1) ... [2022-12-13 10:38:28,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 10:38:28,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 10:38:28,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 10:38:28,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 10:38:28,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:38:28" (1/1) ... [2022-12-13 10:38:28,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:38:28,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:38:28,358 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-13 10:38:28,378 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-13 10:38:28,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 10:38:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 10:38:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 10:38:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 10:38:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 10:38:28,394 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 10:38:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 10:38:28,394 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 10:38:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 10:38:28,394 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 10:38:28,395 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 10:38:28,395 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 10:38:28,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 10:38:28,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 10:38:28,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 10:38:28,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 10:38:28,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 10:38:28,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 10:38:28,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 10:38:28,398 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 10:38:28,541 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 10:38:28,543 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 10:38:29,067 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 10:38:29,269 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 10:38:29,269 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-13 10:38:29,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:38:29 BoogieIcfgContainer [2022-12-13 10:38:29,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 10:38:29,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 10:38:29,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 10:38:29,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 10:38:29,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:38:27" (1/3) ... [2022-12-13 10:38:29,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405e91db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:38:29, skipping insertion in model container [2022-12-13 10:38:29,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:38:28" (2/3) ... [2022-12-13 10:38:29,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405e91db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:38:29, skipping insertion in model container [2022-12-13 10:38:29,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:38:29" (3/3) ... [2022-12-13 10:38:29,278 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-2.wvr.c [2022-12-13 10:38:29,290 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 10:38:29,291 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 10:38:29,291 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 10:38:29,365 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 10:38:29,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 303 transitions, 638 flow [2022-12-13 10:38:29,519 INFO L130 PetriNetUnfolder]: 25/299 cut-off events. [2022-12-13 10:38:29,519 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 10:38:29,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 299 events. 25/299 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 261. Up to 2 conditions per place. [2022-12-13 10:38:29,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 291 places, 303 transitions, 638 flow [2022-12-13 10:38:29,533 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 287 transitions, 598 flow [2022-12-13 10:38:29,534 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:38:29,547 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 287 transitions, 598 flow [2022-12-13 10:38:29,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 287 transitions, 598 flow [2022-12-13 10:38:29,611 INFO L130 PetriNetUnfolder]: 25/287 cut-off events. [2022-12-13 10:38:29,612 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 10:38:29,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 287 events. 25/287 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 179 event pairs, 0 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 261. Up to 2 conditions per place. [2022-12-13 10:38:29,617 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 275 places, 287 transitions, 598 flow [2022-12-13 10:38:29,617 INFO L226 LiptonReduction]: Number of co-enabled transitions 2544 [2022-12-13 10:38:39,969 INFO L241 LiptonReduction]: Total number of compositions: 246 [2022-12-13 10:38:39,980 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 10:38:39,984 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;@1c6bd477, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 10:38:39,985 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 10:38:39,996 INFO L130 PetriNetUnfolder]: 8/40 cut-off events. [2022-12-13 10:38:39,996 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 10:38:39,997 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:38:39,997 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:38:39,997 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:38:40,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:38:40,001 INFO L85 PathProgramCache]: Analyzing trace with hash 13481392, now seen corresponding path program 1 times [2022-12-13 10:38:40,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:38:40,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565397763] [2022-12-13 10:38:40,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:38:40,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:38:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:38:40,473 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-13 10:38:40,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:38:40,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565397763] [2022-12-13 10:38:40,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565397763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:38:40,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:38:40,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 10:38:40,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678987877] [2022-12-13 10:38:40,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:38:40,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:38:40,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:38:40,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:38:40,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:38:40,506 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 10:38:40,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 106 flow. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:38:40,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:38:40,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 10:38:40,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:38:40,935 INFO L130 PetriNetUnfolder]: 2346/3110 cut-off events. [2022-12-13 10:38:40,935 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2022-12-13 10:38:40,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6500 conditions, 3110 events. 2346/3110 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11907 event pairs, 381 based on Foata normal form. 1/2317 useless extension candidates. Maximal degree in co-relation 5552. Up to 2810 conditions per place. [2022-12-13 10:38:40,956 INFO L137 encePairwiseOnDemand]: 35/41 looper letters, 58 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2022-12-13 10:38:40,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 301 flow [2022-12-13 10:38:40,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:38:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:38:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 10:38:40,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5284552845528455 [2022-12-13 10:38:40,970 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 106 flow. Second operand 3 states and 65 transitions. [2022-12-13 10:38:40,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 64 transitions, 301 flow [2022-12-13 10:38:40,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 64 transitions, 271 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-13 10:38:40,978 INFO L231 Difference]: Finished difference. Result has 41 places, 45 transitions, 123 flow [2022-12-13 10:38:40,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=41, PETRI_TRANSITIONS=45} [2022-12-13 10:38:40,984 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2022-12-13 10:38:40,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:38:40,985 INFO L89 Accepts]: Start accepts. Operand has 41 places, 45 transitions, 123 flow [2022-12-13 10:38:40,988 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:38:40,988 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:38:40,989 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 45 transitions, 123 flow [2022-12-13 10:38:40,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 45 transitions, 123 flow [2022-12-13 10:38:41,014 INFO L130 PetriNetUnfolder]: 58/130 cut-off events. [2022-12-13 10:38:41,014 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:38:41,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 130 events. 58/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 6 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 154. Up to 60 conditions per place. [2022-12-13 10:38:41,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 45 transitions, 123 flow [2022-12-13 10:38:41,018 INFO L226 LiptonReduction]: Number of co-enabled transitions 478 [2022-12-13 10:38:41,087 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:38:41,089 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 10:38:41,089 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 45 transitions, 123 flow [2022-12-13 10:38:41,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:38:41,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:38:41,090 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:38:41,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 10:38:41,091 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:38:41,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:38:41,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1846233153, now seen corresponding path program 1 times [2022-12-13 10:38:41,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:38:41,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884413559] [2022-12-13 10:38:41,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:38:41,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:38:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:38:41,284 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-13 10:38:41,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:38:41,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884413559] [2022-12-13 10:38:41,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884413559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:38:41,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:38:41,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:38:41,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105481866] [2022-12-13 10:38:41,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:38:41,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:38:41,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:38:41,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:38:41,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:38:41,290 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 10:38:41,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 45 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:38:41,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:38:41,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 10:38:41,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:38:41,803 INFO L130 PetriNetUnfolder]: 2945/4072 cut-off events. [2022-12-13 10:38:41,804 INFO L131 PetriNetUnfolder]: For 969/969 co-relation queries the response was YES. [2022-12-13 10:38:41,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9618 conditions, 4072 events. 2945/4072 cut-off events. For 969/969 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16331 event pairs, 2098 based on Foata normal form. 332/4211 useless extension candidates. Maximal degree in co-relation 3795. Up to 3111 conditions per place. [2022-12-13 10:38:41,816 INFO L137 encePairwiseOnDemand]: 29/41 looper letters, 44 selfloop transitions, 2 changer transitions 59/105 dead transitions. [2022-12-13 10:38:41,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 105 transitions, 489 flow [2022-12-13 10:38:41,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:38:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:38:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-13 10:38:41,819 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2022-12-13 10:38:41,819 INFO L175 Difference]: Start difference. First operand has 41 places, 45 transitions, 123 flow. Second operand 5 states and 105 transitions. [2022-12-13 10:38:41,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 105 transitions, 489 flow [2022-12-13 10:38:41,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 105 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 10:38:41,822 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 160 flow [2022-12-13 10:38:41,822 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2022-12-13 10:38:41,822 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 1 predicate places. [2022-12-13 10:38:41,823 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:38:41,823 INFO L89 Accepts]: Start accepts. Operand has 47 places, 46 transitions, 160 flow [2022-12-13 10:38:41,825 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:38:41,825 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:38:41,825 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 46 transitions, 160 flow [2022-12-13 10:38:41,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 46 transitions, 160 flow [2022-12-13 10:38:41,835 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1383] L141-->L135: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_221| v_~manager~0.base_89) (+ (* v_~manager_back~0_141 4) v_~manager~0.offset_89)) v_~update~0_73) 1 0)) (= v_~manager_back~0_140 (+ v_~manager_back~0_141 1)) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet29#1_22| 256) 0)) (not (= (ite (and (<= 0 v_~manager_back~0_141) (< v_~manager_back~0_141 v_~manager_size~0_66)) 1 0) 0)) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, #memory_int=|v_#memory_int_221|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_66, thread4Thread1of1ForFork2_#t~nondet29#1=|v_thread4Thread1of1ForFork2_#t~nondet29#1_22|, ~update~0=v_~update~0_73} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~manager~0.offset=v_~manager~0.offset_89, thread4Thread1of1ForFork2_#t~post31#1=|v_thread4Thread1of1ForFork2_#t~post31#1_5|, ~manager~0.base=v_~manager~0.base_89, thread4Thread1of1ForFork2_#t~mem30#1=|v_thread4Thread1of1ForFork2_#t~mem30#1_5|, #memory_int=|v_#memory_int_221|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, ~manager_back~0=v_~manager_back~0_140, ~manager_size~0=v_~manager_size~0_66, ~update~0=v_~update~0_73} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post31#1, thread4Thread1of1ForFork2_#t~mem30#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, thread4Thread1of1ForFork2_#t~nondet29#1][35], [260#L105true, Black: 302#(<= ~manager_size~0 0), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 304#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 0)), 299#true, 162#L123true, 104#L135true, Black: 296#(= ~safe~0 1), 151#L57true, 87#L179-4true]) [2022-12-13 10:38:41,835 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-13 10:38:41,835 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 10:38:41,835 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 10:38:41,835 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 10:38:41,836 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1383] L141-->L135: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_221| v_~manager~0.base_89) (+ (* v_~manager_back~0_141 4) v_~manager~0.offset_89)) v_~update~0_73) 1 0)) (= v_~manager_back~0_140 (+ v_~manager_back~0_141 1)) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet29#1_22| 256) 0)) (not (= (ite (and (<= 0 v_~manager_back~0_141) (< v_~manager_back~0_141 v_~manager_size~0_66)) 1 0) 0)) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, #memory_int=|v_#memory_int_221|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_66, thread4Thread1of1ForFork2_#t~nondet29#1=|v_thread4Thread1of1ForFork2_#t~nondet29#1_22|, ~update~0=v_~update~0_73} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~manager~0.offset=v_~manager~0.offset_89, thread4Thread1of1ForFork2_#t~post31#1=|v_thread4Thread1of1ForFork2_#t~post31#1_5|, ~manager~0.base=v_~manager~0.base_89, thread4Thread1of1ForFork2_#t~mem30#1=|v_thread4Thread1of1ForFork2_#t~mem30#1_5|, #memory_int=|v_#memory_int_221|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, ~manager_back~0=v_~manager_back~0_140, ~manager_size~0=v_~manager_size~0_66, ~update~0=v_~update~0_73} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post31#1, thread4Thread1of1ForFork2_#t~mem30#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, thread4Thread1of1ForFork2_#t~nondet29#1][35], [260#L105true, Black: 302#(<= ~manager_size~0 0), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 304#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 0)), 299#true, 162#L123true, 104#L135true, Black: 296#(= ~safe~0 1), 275#L87true, 87#L179-4true]) [2022-12-13 10:38:41,836 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-13 10:38:41,836 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 10:38:41,836 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 10:38:41,837 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 10:38:41,843 INFO L130 PetriNetUnfolder]: 93/187 cut-off events. [2022-12-13 10:38:41,844 INFO L131 PetriNetUnfolder]: For 101/139 co-relation queries the response was YES. [2022-12-13 10:38:41,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 187 events. 93/187 cut-off events. For 101/139 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 548 event pairs, 11 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 407. Up to 76 conditions per place. [2022-12-13 10:38:41,846 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 46 transitions, 160 flow [2022-12-13 10:38:41,846 INFO L226 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-13 10:38:43,511 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:38:43,512 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1689 [2022-12-13 10:38:43,512 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 156 flow [2022-12-13 10:38:43,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:38:43,512 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:38:43,513 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:38:43,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 10:38:43,513 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:38:43,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:38:43,513 INFO L85 PathProgramCache]: Analyzing trace with hash 928199408, now seen corresponding path program 1 times [2022-12-13 10:38:43,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:38:43,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000649283] [2022-12-13 10:38:43,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:38:43,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:38:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:38:43,688 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-13 10:38:43,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:38:43,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000649283] [2022-12-13 10:38:43,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000649283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:38:43,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:38:43,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:38:43,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721931047] [2022-12-13 10:38:43,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:38:43,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:38:43,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:38:43,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:38:43,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:38:43,690 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 10:38:43,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:38:43,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:38:43,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 10:38:43,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:38:44,053 INFO L130 PetriNetUnfolder]: 2852/3828 cut-off events. [2022-12-13 10:38:44,054 INFO L131 PetriNetUnfolder]: For 3048/3048 co-relation queries the response was YES. [2022-12-13 10:38:44,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10438 conditions, 3828 events. 2852/3828 cut-off events. For 3048/3048 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14649 event pairs, 765 based on Foata normal form. 140/3967 useless extension candidates. Maximal degree in co-relation 10426. Up to 2698 conditions per place. [2022-12-13 10:38:44,070 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 67 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2022-12-13 10:38:44,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 69 transitions, 367 flow [2022-12-13 10:38:44,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:38:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:38:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 10:38:44,071 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5447154471544715 [2022-12-13 10:38:44,071 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 156 flow. Second operand 3 states and 67 transitions. [2022-12-13 10:38:44,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 69 transitions, 367 flow [2022-12-13 10:38:44,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 69 transitions, 349 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 10:38:44,074 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 146 flow [2022-12-13 10:38:44,074 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2022-12-13 10:38:44,075 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2022-12-13 10:38:44,075 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:38:44,075 INFO L89 Accepts]: Start accepts. Operand has 45 places, 45 transitions, 146 flow [2022-12-13 10:38:44,076 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:38:44,076 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:38:44,076 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 45 transitions, 146 flow [2022-12-13 10:38:44,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 45 transitions, 146 flow [2022-12-13 10:38:44,092 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1383] L141-->L135: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_221| v_~manager~0.base_89) (+ (* v_~manager_back~0_141 4) v_~manager~0.offset_89)) v_~update~0_73) 1 0)) (= v_~manager_back~0_140 (+ v_~manager_back~0_141 1)) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet29#1_22| 256) 0)) (not (= (ite (and (<= 0 v_~manager_back~0_141) (< v_~manager_back~0_141 v_~manager_size~0_66)) 1 0) 0)) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, #memory_int=|v_#memory_int_221|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_66, thread4Thread1of1ForFork2_#t~nondet29#1=|v_thread4Thread1of1ForFork2_#t~nondet29#1_22|, ~update~0=v_~update~0_73} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~manager~0.offset=v_~manager~0.offset_89, thread4Thread1of1ForFork2_#t~post31#1=|v_thread4Thread1of1ForFork2_#t~post31#1_5|, ~manager~0.base=v_~manager~0.base_89, thread4Thread1of1ForFork2_#t~mem30#1=|v_thread4Thread1of1ForFork2_#t~mem30#1_5|, #memory_int=|v_#memory_int_221|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, ~manager_back~0=v_~manager_back~0_140, ~manager_size~0=v_~manager_size~0_66, ~update~0=v_~update~0_73} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post31#1, thread4Thread1of1ForFork2_#t~mem30#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, thread4Thread1of1ForFork2_#t~nondet29#1][32], [260#L105true, Black: 302#(<= ~manager_size~0 0), Black: 304#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 0)), 162#L123true, 104#L135true, 309#true, Black: 311#(= ~node1_front~0 ~node1_back~0), Black: 296#(= ~safe~0 1), 151#L57true, 87#L179-4true]) [2022-12-13 10:38:44,092 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 10:38:44,092 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 10:38:44,092 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 10:38:44,092 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 10:38:44,096 INFO L130 PetriNetUnfolder]: 97/215 cut-off events. [2022-12-13 10:38:44,097 INFO L131 PetriNetUnfolder]: For 126/154 co-relation queries the response was YES. [2022-12-13 10:38:44,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 215 events. 97/215 cut-off events. For 126/154 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 805 event pairs, 29 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 412. Up to 83 conditions per place. [2022-12-13 10:38:44,099 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 45 transitions, 146 flow [2022-12-13 10:38:44,099 INFO L226 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-13 10:38:44,104 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:38:44,104 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 10:38:44,105 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 146 flow [2022-12-13 10:38:44,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:38:44,105 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:38:44,105 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:38:44,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 10:38:44,105 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:38:44,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:38:44,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1651102280, now seen corresponding path program 1 times [2022-12-13 10:38:44,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:38:44,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538377228] [2022-12-13 10:38:44,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:38:44,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:38:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:38:44,215 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-13 10:38:44,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:38:44,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538377228] [2022-12-13 10:38:44,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538377228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:38:44,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:38:44,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:38:44,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202307595] [2022-12-13 10:38:44,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:38:44,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:38:44,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:38:44,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:38:44,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:38:44,217 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 10:38:44,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:38:44,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:38:44,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 10:38:44,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:38:44,531 INFO L130 PetriNetUnfolder]: 2676/3626 cut-off events. [2022-12-13 10:38:44,531 INFO L131 PetriNetUnfolder]: For 2976/2976 co-relation queries the response was YES. [2022-12-13 10:38:44,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10112 conditions, 3626 events. 2676/3626 cut-off events. For 2976/2976 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13787 event pairs, 689 based on Foata normal form. 132/3754 useless extension candidates. Maximal degree in co-relation 8028. Up to 2700 conditions per place. [2022-12-13 10:38:44,547 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 67 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2022-12-13 10:38:44,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 69 transitions, 359 flow [2022-12-13 10:38:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:38:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:38:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-13 10:38:44,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5528455284552846 [2022-12-13 10:38:44,548 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 146 flow. Second operand 3 states and 68 transitions. [2022-12-13 10:38:44,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 69 transitions, 359 flow [2022-12-13 10:38:44,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 341 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 10:38:44,551 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 142 flow [2022-12-13 10:38:44,551 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2022-12-13 10:38:44,552 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2022-12-13 10:38:44,552 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:38:44,552 INFO L89 Accepts]: Start accepts. Operand has 46 places, 45 transitions, 142 flow [2022-12-13 10:38:44,553 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:38:44,553 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:38:44,553 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 45 transitions, 142 flow [2022-12-13 10:38:44,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 142 flow [2022-12-13 10:38:44,566 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1383] L141-->L135: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_221| v_~manager~0.base_89) (+ (* v_~manager_back~0_141 4) v_~manager~0.offset_89)) v_~update~0_73) 1 0)) (= v_~manager_back~0_140 (+ v_~manager_back~0_141 1)) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet29#1_22| 256) 0)) (not (= (ite (and (<= 0 v_~manager_back~0_141) (< v_~manager_back~0_141 v_~manager_size~0_66)) 1 0) 0)) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, #memory_int=|v_#memory_int_221|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_66, thread4Thread1of1ForFork2_#t~nondet29#1=|v_thread4Thread1of1ForFork2_#t~nondet29#1_22|, ~update~0=v_~update~0_73} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~manager~0.offset=v_~manager~0.offset_89, thread4Thread1of1ForFork2_#t~post31#1=|v_thread4Thread1of1ForFork2_#t~post31#1_5|, ~manager~0.base=v_~manager~0.base_89, thread4Thread1of1ForFork2_#t~mem30#1=|v_thread4Thread1of1ForFork2_#t~mem30#1_5|, #memory_int=|v_#memory_int_221|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, ~manager_back~0=v_~manager_back~0_140, ~manager_size~0=v_~manager_size~0_66, ~update~0=v_~update~0_73} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post31#1, thread4Thread1of1ForFork2_#t~mem30#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, thread4Thread1of1ForFork2_#t~nondet29#1][29], [260#L105true, Black: 304#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 0)), 162#L123true, 314#true, 104#L135true, Black: 311#(= ~node1_front~0 ~node1_back~0), Black: 296#(= ~safe~0 1), 151#L57true, 87#L179-4true, Black: 316#(= ~node2_back~0 ~node2_front~0)]) [2022-12-13 10:38:44,566 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 10:38:44,566 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 10:38:44,566 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 10:38:44,566 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 10:38:44,573 INFO L130 PetriNetUnfolder]: 100/229 cut-off events. [2022-12-13 10:38:44,573 INFO L131 PetriNetUnfolder]: For 72/73 co-relation queries the response was YES. [2022-12-13 10:38:44,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 229 events. 100/229 cut-off events. For 72/73 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 866 event pairs, 33 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 397. Up to 86 conditions per place. [2022-12-13 10:38:44,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 45 transitions, 142 flow [2022-12-13 10:38:44,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-13 10:38:44,630 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:38:44,631 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-13 10:38:44,631 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 142 flow [2022-12-13 10:38:44,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:38:44,632 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:38:44,632 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:38:44,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 10:38:44,632 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:38:44,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:38:44,632 INFO L85 PathProgramCache]: Analyzing trace with hash 775251523, now seen corresponding path program 1 times [2022-12-13 10:38:44,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:38:44,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990993074] [2022-12-13 10:38:44,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:38:44,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:38:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:38:44,741 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-13 10:38:44,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:38:44,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990993074] [2022-12-13 10:38:44,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990993074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:38:44,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:38:44,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:38:44,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373578649] [2022-12-13 10:38:44,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:38:44,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:38:44,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:38:44,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:38:44,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:38:44,743 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 10:38:44,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:38:44,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:38:44,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 10:38:44,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:38:45,109 INFO L130 PetriNetUnfolder]: 3151/4249 cut-off events. [2022-12-13 10:38:45,110 INFO L131 PetriNetUnfolder]: For 2500/2500 co-relation queries the response was YES. [2022-12-13 10:38:45,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11305 conditions, 4249 events. 3151/4249 cut-off events. For 2500/2500 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 15861 event pairs, 896 based on Foata normal form. 104/4349 useless extension candidates. Maximal degree in co-relation 9537. Up to 2724 conditions per place. [2022-12-13 10:38:45,129 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 60 selfloop transitions, 2 changer transitions 8/70 dead transitions. [2022-12-13 10:38:45,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 351 flow [2022-12-13 10:38:45,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:38:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:38:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-13 10:38:45,130 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5772357723577236 [2022-12-13 10:38:45,130 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 142 flow. Second operand 3 states and 71 transitions. [2022-12-13 10:38:45,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 351 flow [2022-12-13 10:38:45,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 70 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 10:38:45,133 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 148 flow [2022-12-13 10:38:45,133 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2022-12-13 10:38:45,134 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2022-12-13 10:38:45,134 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:38:45,134 INFO L89 Accepts]: Start accepts. Operand has 48 places, 45 transitions, 148 flow [2022-12-13 10:38:45,135 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:38:45,135 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:38:45,135 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 45 transitions, 148 flow [2022-12-13 10:38:45,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 45 transitions, 148 flow [2022-12-13 10:38:45,148 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1383] L141-->L135: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_221| v_~manager~0.base_89) (+ (* v_~manager_back~0_141 4) v_~manager~0.offset_89)) v_~update~0_73) 1 0)) (= v_~manager_back~0_140 (+ v_~manager_back~0_141 1)) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet29#1_22| 256) 0)) (not (= (ite (and (<= 0 v_~manager_back~0_141) (< v_~manager_back~0_141 v_~manager_size~0_66)) 1 0) 0)) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, #memory_int=|v_#memory_int_221|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_66, thread4Thread1of1ForFork2_#t~nondet29#1=|v_thread4Thread1of1ForFork2_#t~nondet29#1_22|, ~update~0=v_~update~0_73} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~manager~0.offset=v_~manager~0.offset_89, thread4Thread1of1ForFork2_#t~post31#1=|v_thread4Thread1of1ForFork2_#t~post31#1_5|, ~manager~0.base=v_~manager~0.base_89, thread4Thread1of1ForFork2_#t~mem30#1=|v_thread4Thread1of1ForFork2_#t~mem30#1_5|, #memory_int=|v_#memory_int_221|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, ~manager_back~0=v_~manager_back~0_140, ~manager_size~0=v_~manager_size~0_66, ~update~0=v_~update~0_73} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post31#1, thread4Thread1of1ForFork2_#t~mem30#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, thread4Thread1of1ForFork2_#t~nondet29#1][29], [260#L105true, Black: 322#(<= ~client_back~0 ~client_front~0), Black: 304#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 0)), 162#L123true, 104#L135true, Black: 311#(= ~node1_front~0 ~node1_back~0), Black: 296#(= ~safe~0 1), 320#true, 151#L57true, Black: 316#(= ~node2_back~0 ~node2_front~0), 87#L179-4true]) [2022-12-13 10:38:45,148 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 10:38:45,148 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 10:38:45,148 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 10:38:45,148 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 10:38:45,167 INFO L130 PetriNetUnfolder]: 120/259 cut-off events. [2022-12-13 10:38:45,167 INFO L131 PetriNetUnfolder]: For 96/97 co-relation queries the response was YES. [2022-12-13 10:38:45,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 259 events. 120/259 cut-off events. For 96/97 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 985 event pairs, 43 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 485. Up to 98 conditions per place. [2022-12-13 10:38:45,169 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 45 transitions, 148 flow [2022-12-13 10:38:45,169 INFO L226 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-13 10:38:45,192 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:38:45,192 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 10:38:45,192 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 148 flow [2022-12-13 10:38:45,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:38:45,193 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:38:45,193 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:38:45,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 10:38:45,193 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:38:45,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:38:45,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1810557708, now seen corresponding path program 1 times [2022-12-13 10:38:45,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:38:45,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493606573] [2022-12-13 10:38:45,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:38:45,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:38:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:38:45,305 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-13 10:38:45,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:38:45,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493606573] [2022-12-13 10:38:45,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493606573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:38:45,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:38:45,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:38:45,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124158850] [2022-12-13 10:38:45,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:38:45,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:38:45,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:38:45,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:38:45,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:38:45,306 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 10:38:45,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 10:38:45,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:38:45,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 10:38:45,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:38:45,963 INFO L130 PetriNetUnfolder]: 5282/7293 cut-off events. [2022-12-13 10:38:45,963 INFO L131 PetriNetUnfolder]: For 4580/4580 co-relation queries the response was YES. [2022-12-13 10:38:45,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19429 conditions, 7293 events. 5282/7293 cut-off events. For 4580/4580 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 31603 event pairs, 4147 based on Foata normal form. 160/7444 useless extension candidates. Maximal degree in co-relation 11685. Up to 4248 conditions per place. [2022-12-13 10:38:45,986 INFO L137 encePairwiseOnDemand]: 33/41 looper letters, 43 selfloop transitions, 3 changer transitions 67/113 dead transitions. [2022-12-13 10:38:45,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 113 transitions, 570 flow [2022-12-13 10:38:45,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:38:45,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:38:45,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-13 10:38:45,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5414634146341464 [2022-12-13 10:38:45,989 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 148 flow. Second operand 5 states and 111 transitions. [2022-12-13 10:38:45,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 113 transitions, 570 flow [2022-12-13 10:38:45,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 113 transitions, 568 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 10:38:45,994 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 172 flow [2022-12-13 10:38:45,994 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2022-12-13 10:38:45,996 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2022-12-13 10:38:45,996 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:38:45,996 INFO L89 Accepts]: Start accepts. Operand has 54 places, 46 transitions, 172 flow [2022-12-13 10:38:45,997 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:38:45,997 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:38:45,997 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 46 transitions, 172 flow [2022-12-13 10:38:45,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 46 transitions, 172 flow [2022-12-13 10:38:46,010 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1383] L141-->L135: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_221| v_~manager~0.base_89) (+ (* v_~manager_back~0_141 4) v_~manager~0.offset_89)) v_~update~0_73) 1 0)) (= v_~manager_back~0_140 (+ v_~manager_back~0_141 1)) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet29#1_22| 256) 0)) (not (= (ite (and (<= 0 v_~manager_back~0_141) (< v_~manager_back~0_141 v_~manager_size~0_66)) 1 0) 0)) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, #memory_int=|v_#memory_int_221|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_66, thread4Thread1of1ForFork2_#t~nondet29#1=|v_thread4Thread1of1ForFork2_#t~nondet29#1_22|, ~update~0=v_~update~0_73} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~manager~0.offset=v_~manager~0.offset_89, thread4Thread1of1ForFork2_#t~post31#1=|v_thread4Thread1of1ForFork2_#t~post31#1_5|, ~manager~0.base=v_~manager~0.base_89, thread4Thread1of1ForFork2_#t~mem30#1=|v_thread4Thread1of1ForFork2_#t~mem30#1_5|, #memory_int=|v_#memory_int_221|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, ~manager_back~0=v_~manager_back~0_140, ~manager_size~0=v_~manager_size~0_66, ~update~0=v_~update~0_73} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post31#1, thread4Thread1of1ForFork2_#t~mem30#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, thread4Thread1of1ForFork2_#t~nondet29#1][28], [Black: 322#(<= ~client_back~0 ~client_front~0), 162#L123true, 104#L135true, Black: 296#(= ~safe~0 1), Black: 326#(and (<= ~client_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 329#(and (<= ~client_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~client_size~0 0)), 151#L57true, Black: 327#(<= ~client_size~0 0), 87#L179-4true, 260#L105true, Black: 304#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 0)), 324#true, Black: 311#(= ~node1_front~0 ~node1_back~0), Black: 316#(= ~node2_back~0 ~node2_front~0)]) [2022-12-13 10:38:46,010 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 10:38:46,010 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 10:38:46,010 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 10:38:46,010 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 10:38:46,021 INFO L130 PetriNetUnfolder]: 120/260 cut-off events. [2022-12-13 10:38:46,021 INFO L131 PetriNetUnfolder]: For 102/103 co-relation queries the response was YES. [2022-12-13 10:38:46,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 260 events. 120/260 cut-off events. For 102/103 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 978 event pairs, 43 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 540. Up to 98 conditions per place. [2022-12-13 10:38:46,023 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 46 transitions, 172 flow [2022-12-13 10:38:46,023 INFO L226 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-13 10:38:46,364 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:38:46,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 369 [2022-12-13 10:38:46,365 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 168 flow [2022-12-13 10:38:46,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 10:38:46,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:38:46,366 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:38:46,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 10:38:46,366 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:38:46,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:38:46,366 INFO L85 PathProgramCache]: Analyzing trace with hash 826560604, now seen corresponding path program 1 times [2022-12-13 10:38:46,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:38:46,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572504250] [2022-12-13 10:38:46,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:38:46,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:38:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:38:46,509 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-13 10:38:46,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:38:46,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572504250] [2022-12-13 10:38:46,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572504250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:38:46,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:38:46,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:38:46,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73383278] [2022-12-13 10:38:46,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:38:46,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:38:46,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:38:46,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:38:46,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:38:46,511 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 10:38:46,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 10:38:46,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:38:46,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 10:38:46,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:38:46,988 INFO L130 PetriNetUnfolder]: 3650/5067 cut-off events. [2022-12-13 10:38:46,988 INFO L131 PetriNetUnfolder]: For 3586/3586 co-relation queries the response was YES. [2022-12-13 10:38:46,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13647 conditions, 5067 events. 3650/5067 cut-off events. For 3586/3586 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 20468 event pairs, 2853 based on Foata normal form. 76/5142 useless extension candidates. Maximal degree in co-relation 13622. Up to 4246 conditions per place. [2022-12-13 10:38:47,006 INFO L137 encePairwiseOnDemand]: 35/41 looper letters, 43 selfloop transitions, 3 changer transitions 47/93 dead transitions. [2022-12-13 10:38:47,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 93 transitions, 486 flow [2022-12-13 10:38:47,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:38:47,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:38:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 10:38:47,008 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44390243902439025 [2022-12-13 10:38:47,008 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 168 flow. Second operand 5 states and 91 transitions. [2022-12-13 10:38:47,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 93 transitions, 486 flow [2022-12-13 10:38:47,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 93 transitions, 456 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-13 10:38:47,012 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 168 flow [2022-12-13 10:38:47,012 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2022-12-13 10:38:47,013 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2022-12-13 10:38:47,013 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:38:47,013 INFO L89 Accepts]: Start accepts. Operand has 54 places, 46 transitions, 168 flow [2022-12-13 10:38:47,016 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:38:47,016 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:38:47,016 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 46 transitions, 168 flow [2022-12-13 10:38:47,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 46 transitions, 168 flow [2022-12-13 10:38:47,032 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1383] L141-->L135: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_221| v_~manager~0.base_89) (+ (* v_~manager_back~0_141 4) v_~manager~0.offset_89)) v_~update~0_73) 1 0)) (= v_~manager_back~0_140 (+ v_~manager_back~0_141 1)) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet29#1_22| 256) 0)) (not (= (ite (and (<= 0 v_~manager_back~0_141) (< v_~manager_back~0_141 v_~manager_size~0_66)) 1 0) 0)) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, #memory_int=|v_#memory_int_221|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_66, thread4Thread1of1ForFork2_#t~nondet29#1=|v_thread4Thread1of1ForFork2_#t~nondet29#1_22|, ~update~0=v_~update~0_73} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~manager~0.offset=v_~manager~0.offset_89, thread4Thread1of1ForFork2_#t~post31#1=|v_thread4Thread1of1ForFork2_#t~post31#1_5|, ~manager~0.base=v_~manager~0.base_89, thread4Thread1of1ForFork2_#t~mem30#1=|v_thread4Thread1of1ForFork2_#t~mem30#1_5|, #memory_int=|v_#memory_int_221|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, ~manager_back~0=v_~manager_back~0_140, ~manager_size~0=v_~manager_size~0_66, ~update~0=v_~update~0_73} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post31#1, thread4Thread1of1ForFork2_#t~mem30#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, thread4Thread1of1ForFork2_#t~nondet29#1][26], [Black: 322#(<= ~client_back~0 ~client_front~0), 162#L123true, 104#L135true, Black: 296#(= ~safe~0 1), 151#L57true, 87#L179-4true, 260#L105true, Black: 338#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~node1_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~node1_size~0 0)), Black: 304#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 0)), Black: 336#(<= ~node1_size~0 0), Black: 335#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~node1_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 311#(= ~node1_front~0 ~node1_back~0), Black: 316#(= ~node2_back~0 ~node2_front~0), 333#true]) [2022-12-13 10:38:47,033 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 10:38:47,033 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 10:38:47,033 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 10:38:47,033 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 10:38:47,048 INFO L130 PetriNetUnfolder]: 120/260 cut-off events. [2022-12-13 10:38:47,048 INFO L131 PetriNetUnfolder]: For 103/104 co-relation queries the response was YES. [2022-12-13 10:38:47,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 260 events. 120/260 cut-off events. For 103/104 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 978 event pairs, 43 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 536. Up to 98 conditions per place. [2022-12-13 10:38:47,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 46 transitions, 168 flow [2022-12-13 10:38:47,052 INFO L226 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-13 10:38:47,396 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:38:47,396 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 383 [2022-12-13 10:38:47,396 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 164 flow [2022-12-13 10:38:47,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 10:38:47,397 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:38:47,397 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:38:47,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 10:38:47,397 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:38:47,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:38:47,397 INFO L85 PathProgramCache]: Analyzing trace with hash 690203490, now seen corresponding path program 1 times [2022-12-13 10:38:47,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:38:47,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55848509] [2022-12-13 10:38:47,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:38:47,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:38:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:38:47,546 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-13 10:38:47,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:38:47,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55848509] [2022-12-13 10:38:47,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55848509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:38:47,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:38:47,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:38:47,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268919745] [2022-12-13 10:38:47,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:38:47,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:38:47,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:38:47,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:38:47,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:38:47,547 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 10:38:47,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 10:38:47,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:38:47,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 10:38:47,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:38:47,958 INFO L130 PetriNetUnfolder]: 3522/4835 cut-off events. [2022-12-13 10:38:47,958 INFO L131 PetriNetUnfolder]: For 3543/3543 co-relation queries the response was YES. [2022-12-13 10:38:47,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13148 conditions, 4835 events. 3522/4835 cut-off events. For 3543/3543 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 18933 event pairs, 2708 based on Foata normal form. 56/4889 useless extension candidates. Maximal degree in co-relation 13119. Up to 4244 conditions per place. [2022-12-13 10:38:47,976 INFO L137 encePairwiseOnDemand]: 36/41 looper letters, 43 selfloop transitions, 3 changer transitions 25/71 dead transitions. [2022-12-13 10:38:47,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 71 transitions, 386 flow [2022-12-13 10:38:47,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:38:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:38:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-13 10:38:47,977 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33170731707317075 [2022-12-13 10:38:47,977 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 164 flow. Second operand 5 states and 68 transitions. [2022-12-13 10:38:47,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 71 transitions, 386 flow [2022-12-13 10:38:47,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 362 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 10:38:47,981 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 162 flow [2022-12-13 10:38:47,981 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2022-12-13 10:38:47,982 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2022-12-13 10:38:47,983 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:38:47,983 INFO L89 Accepts]: Start accepts. Operand has 53 places, 46 transitions, 162 flow [2022-12-13 10:38:47,984 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:38:47,984 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:38:47,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 46 transitions, 162 flow [2022-12-13 10:38:47,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 162 flow [2022-12-13 10:38:47,996 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1383] L141-->L135: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_221| v_~manager~0.base_89) (+ (* v_~manager_back~0_141 4) v_~manager~0.offset_89)) v_~update~0_73) 1 0)) (= v_~manager_back~0_140 (+ v_~manager_back~0_141 1)) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet29#1_22| 256) 0)) (not (= (ite (and (<= 0 v_~manager_back~0_141) (< v_~manager_back~0_141 v_~manager_size~0_66)) 1 0) 0)) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, #memory_int=|v_#memory_int_221|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_66, thread4Thread1of1ForFork2_#t~nondet29#1=|v_thread4Thread1of1ForFork2_#t~nondet29#1_22|, ~update~0=v_~update~0_73} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~manager~0.offset=v_~manager~0.offset_89, thread4Thread1of1ForFork2_#t~post31#1=|v_thread4Thread1of1ForFork2_#t~post31#1_5|, ~manager~0.base=v_~manager~0.base_89, thread4Thread1of1ForFork2_#t~mem30#1=|v_thread4Thread1of1ForFork2_#t~mem30#1_5|, #memory_int=|v_#memory_int_221|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, ~manager_back~0=v_~manager_back~0_140, ~manager_size~0=v_~manager_size~0_66, ~update~0=v_~update~0_73} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post31#1, thread4Thread1of1ForFork2_#t~mem30#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, thread4Thread1of1ForFork2_#t~nondet29#1][27], [Black: 322#(<= ~client_back~0 ~client_front~0), 162#L123true, 104#L135true, Black: 296#(= ~safe~0 1), 151#L57true, 87#L179-4true, 260#L105true, Black: 304#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 0)), Black: 311#(= ~node1_front~0 ~node1_back~0), Black: 347#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~node2_size~0 0) (<= ~node2_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 316#(= ~node2_back~0 ~node2_front~0), Black: 344#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~node2_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 342#true]) [2022-12-13 10:38:47,996 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 10:38:47,997 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 10:38:47,997 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 10:38:47,997 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 10:38:48,006 INFO L130 PetriNetUnfolder]: 120/260 cut-off events. [2022-12-13 10:38:48,007 INFO L131 PetriNetUnfolder]: For 99/100 co-relation queries the response was YES. [2022-12-13 10:38:48,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 260 events. 120/260 cut-off events. For 99/100 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 992 event pairs, 43 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 531. Up to 98 conditions per place. [2022-12-13 10:38:48,009 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 162 flow [2022-12-13 10:38:48,009 INFO L226 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-13 10:38:48,339 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:38:48,339 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 356 [2022-12-13 10:38:48,339 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 158 flow [2022-12-13 10:38:48,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 10:38:48,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:38:48,340 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:38:48,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 10:38:48,340 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:38:48,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:38:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash -583479235, now seen corresponding path program 1 times [2022-12-13 10:38:48,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:38:48,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834355634] [2022-12-13 10:38:48,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:38:48,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:38:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:38:48,527 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-13 10:38:48,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:38:48,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834355634] [2022-12-13 10:38:48,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834355634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:38:48,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:38:48,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:38:48,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637755547] [2022-12-13 10:38:48,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:38:48,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:38:48,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:38:48,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:38:48,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:38:48,529 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 10:38:48,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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-13 10:38:48,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:38:48,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 10:38:48,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:38:48,739 INFO L130 PetriNetUnfolder]: 1883/2539 cut-off events. [2022-12-13 10:38:48,739 INFO L131 PetriNetUnfolder]: For 1870/1870 co-relation queries the response was YES. [2022-12-13 10:38:48,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6937 conditions, 2539 events. 1883/2539 cut-off events. For 1870/1870 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8418 event pairs, 709 based on Foata normal form. 30/2566 useless extension candidates. Maximal degree in co-relation 6906. Up to 2325 conditions per place. [2022-12-13 10:38:48,749 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 47 selfloop transitions, 2 changer transitions 9/58 dead transitions. [2022-12-13 10:38:48,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 306 flow [2022-12-13 10:38:48,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:38:48,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:38:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-13 10:38:48,750 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2022-12-13 10:38:48,750 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 158 flow. Second operand 3 states and 55 transitions. [2022-12-13 10:38:48,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 306 flow [2022-12-13 10:38:48,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 294 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 10:38:48,753 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 160 flow [2022-12-13 10:38:48,753 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2022-12-13 10:38:48,754 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2022-12-13 10:38:48,754 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:38:48,754 INFO L89 Accepts]: Start accepts. Operand has 50 places, 46 transitions, 160 flow [2022-12-13 10:38:48,756 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:38:48,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:38:48,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 46 transitions, 160 flow [2022-12-13 10:38:48,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 46 transitions, 160 flow [2022-12-13 10:38:48,769 INFO L130 PetriNetUnfolder]: 65/151 cut-off events. [2022-12-13 10:38:48,769 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-12-13 10:38:48,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 151 events. 65/151 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 399 event pairs, 27 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 293. Up to 57 conditions per place. [2022-12-13 10:38:48,771 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 46 transitions, 160 flow [2022-12-13 10:38:48,771 INFO L226 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-13 10:38:50,032 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:38:50,033 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1279 [2022-12-13 10:38:50,033 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 158 flow [2022-12-13 10:38:50,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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-13 10:38:50,033 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:38:50,033 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:38:50,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 10:38:50,033 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:38:50,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:38:50,033 INFO L85 PathProgramCache]: Analyzing trace with hash -540429184, now seen corresponding path program 1 times [2022-12-13 10:38:50,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:38:50,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896951063] [2022-12-13 10:38:50,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:38:50,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:38:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:38:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:38:50,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:38:50,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896951063] [2022-12-13 10:38:50,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896951063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:38:50,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:38:50,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:38:50,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135224839] [2022-12-13 10:38:50,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:38:50,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:38:50,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:38:50,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:38:50,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:38:50,185 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 10:38:50,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-13 10:38:50,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:38:50,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 10:38:50,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:38:50,482 INFO L130 PetriNetUnfolder]: 2142/3049 cut-off events. [2022-12-13 10:38:50,482 INFO L131 PetriNetUnfolder]: For 1972/1972 co-relation queries the response was YES. [2022-12-13 10:38:50,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8338 conditions, 3049 events. 2142/3049 cut-off events. For 1972/1972 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 11671 event pairs, 1627 based on Foata normal form. 72/3110 useless extension candidates. Maximal degree in co-relation 3203. Up to 2234 conditions per place. [2022-12-13 10:38:50,494 INFO L137 encePairwiseOnDemand]: 31/41 looper letters, 44 selfloop transitions, 2 changer transitions 67/113 dead transitions. [2022-12-13 10:38:50,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 113 transitions, 590 flow [2022-12-13 10:38:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:38:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:38:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-12-13 10:38:50,495 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.551219512195122 [2022-12-13 10:38:50,495 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 158 flow. Second operand 5 states and 113 transitions. [2022-12-13 10:38:50,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 113 transitions, 590 flow [2022-12-13 10:38:50,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 113 transitions, 580 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 10:38:50,497 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 184 flow [2022-12-13 10:38:50,498 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2022-12-13 10:38:50,498 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2022-12-13 10:38:50,499 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:38:50,499 INFO L89 Accepts]: Start accepts. Operand has 55 places, 46 transitions, 184 flow [2022-12-13 10:38:50,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:38:50,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:38:50,499 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 46 transitions, 184 flow [2022-12-13 10:38:50,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 46 transitions, 184 flow [2022-12-13 10:38:50,517 INFO L130 PetriNetUnfolder]: 65/149 cut-off events. [2022-12-13 10:38:50,517 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-13 10:38:50,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 149 events. 65/149 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 402 event pairs, 27 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 328. Up to 57 conditions per place. [2022-12-13 10:38:50,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 46 transitions, 184 flow [2022-12-13 10:38:50,518 INFO L226 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-13 10:38:52,856 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:38:52,857 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2358 [2022-12-13 10:38:52,857 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 178 flow [2022-12-13 10:38:52,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-13 10:38:52,857 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:38:52,857 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:38:52,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 10:38:52,857 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:38:52,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:38:52,857 INFO L85 PathProgramCache]: Analyzing trace with hash -82120250, now seen corresponding path program 1 times [2022-12-13 10:38:52,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:38:52,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823543499] [2022-12-13 10:38:52,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:38:52,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:38:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:38:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:38:52,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:38:52,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823543499] [2022-12-13 10:38:52,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823543499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:38:52,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:38:52,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:38:52,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519768925] [2022-12-13 10:38:52,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:38:52,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:38:52,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:38:52,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:38:52,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:38:52,961 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 10:38:52,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-13 10:38:52,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:38:52,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 10:38:52,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:38:53,185 INFO L130 PetriNetUnfolder]: 1517/2089 cut-off events. [2022-12-13 10:38:53,185 INFO L131 PetriNetUnfolder]: For 2056/2056 co-relation queries the response was YES. [2022-12-13 10:38:53,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6024 conditions, 2089 events. 1517/2089 cut-off events. For 2056/2056 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6702 event pairs, 524 based on Foata normal form. 36/2124 useless extension candidates. Maximal degree in co-relation 6003. Up to 1615 conditions per place. [2022-12-13 10:38:53,193 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 53 selfloop transitions, 7 changer transitions 16/76 dead transitions. [2022-12-13 10:38:53,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 429 flow [2022-12-13 10:38:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:38:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:38:53,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-13 10:38:53,194 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48125 [2022-12-13 10:38:53,194 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 178 flow. Second operand 4 states and 77 transitions. [2022-12-13 10:38:53,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 429 flow [2022-12-13 10:38:53,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 76 transitions, 401 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 10:38:53,196 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 199 flow [2022-12-13 10:38:53,197 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2022-12-13 10:38:53,197 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2022-12-13 10:38:53,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:38:53,197 INFO L89 Accepts]: Start accepts. Operand has 52 places, 48 transitions, 199 flow [2022-12-13 10:38:53,198 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:38:53,198 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:38:53,198 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 48 transitions, 199 flow [2022-12-13 10:38:53,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 48 transitions, 199 flow [2022-12-13 10:38:53,214 INFO L130 PetriNetUnfolder]: 71/180 cut-off events. [2022-12-13 10:38:53,215 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-13 10:38:53,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 180 events. 71/180 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 531 event pairs, 26 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 367. Up to 64 conditions per place. [2022-12-13 10:38:53,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 48 transitions, 199 flow [2022-12-13 10:38:53,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-13 10:38:53,217 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:38:53,217 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 10:38:53,217 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 199 flow [2022-12-13 10:38:53,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-13 10:38:53,218 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:38:53,218 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:38:53,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 10:38:53,218 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:38:53,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:38:53,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1712362674, now seen corresponding path program 1 times [2022-12-13 10:38:53,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:38:53,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201976137] [2022-12-13 10:38:53,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:38:53,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:38:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:38:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:38:53,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:38:53,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201976137] [2022-12-13 10:38:53,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201976137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:38:53,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:38:53,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:38:53,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735743090] [2022-12-13 10:38:53,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:38:53,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:38:53,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:38:53,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:38:53,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:38:53,398 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 10:38:53,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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-13 10:38:53,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:38:53,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 10:38:53,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:38:53,716 INFO L130 PetriNetUnfolder]: 1799/2563 cut-off events. [2022-12-13 10:38:53,716 INFO L131 PetriNetUnfolder]: For 2541/2541 co-relation queries the response was YES. [2022-12-13 10:38:53,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7506 conditions, 2563 events. 1799/2563 cut-off events. For 2541/2541 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9329 event pairs, 1216 based on Foata normal form. 16/2571 useless extension candidates. Maximal degree in co-relation 2776. Up to 2090 conditions per place. [2022-12-13 10:38:53,724 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 47 selfloop transitions, 2 changer transitions 50/99 dead transitions. [2022-12-13 10:38:53,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 99 transitions, 558 flow [2022-12-13 10:38:53,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:38:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:38:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-13 10:38:53,725 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3875 [2022-12-13 10:38:53,725 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 199 flow. Second operand 6 states and 93 transitions. [2022-12-13 10:38:53,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 99 transitions, 558 flow [2022-12-13 10:38:53,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 99 transitions, 542 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-13 10:38:53,728 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 211 flow [2022-12-13 10:38:53,728 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2022-12-13 10:38:53,728 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2022-12-13 10:38:53,728 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:38:53,728 INFO L89 Accepts]: Start accepts. Operand has 61 places, 49 transitions, 211 flow [2022-12-13 10:38:53,729 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:38:53,729 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:38:53,729 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 49 transitions, 211 flow [2022-12-13 10:38:53,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 211 flow [2022-12-13 10:38:53,747 INFO L130 PetriNetUnfolder]: 71/181 cut-off events. [2022-12-13 10:38:53,747 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2022-12-13 10:38:53,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 181 events. 71/181 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 530 event pairs, 26 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 413. Up to 64 conditions per place. [2022-12-13 10:38:53,748 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 49 transitions, 211 flow [2022-12-13 10:38:53,748 INFO L226 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-13 10:38:55,765 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:38:55,765 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2037 [2022-12-13 10:38:55,766 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 207 flow [2022-12-13 10:38:55,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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-13 10:38:55,766 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:38:55,766 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:38:55,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 10:38:55,766 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:38:55,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:38:55,766 INFO L85 PathProgramCache]: Analyzing trace with hash -294946541, now seen corresponding path program 1 times [2022-12-13 10:38:55,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:38:55,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664472761] [2022-12-13 10:38:55,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:38:55,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:38:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:38:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:38:56,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:38:56,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664472761] [2022-12-13 10:38:56,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664472761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:38:56,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:38:56,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:38:56,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778190221] [2022-12-13 10:38:56,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:38:56,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:38:56,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:38:56,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:38:56,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:38:56,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 10:38:56,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-13 10:38:56,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:38:56,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 10:38:56,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:38:56,526 INFO L130 PetriNetUnfolder]: 3707/4987 cut-off events. [2022-12-13 10:38:56,526 INFO L131 PetriNetUnfolder]: For 5796/5796 co-relation queries the response was YES. [2022-12-13 10:38:56,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15154 conditions, 4987 events. 3707/4987 cut-off events. For 5796/5796 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 19005 event pairs, 1129 based on Foata normal form. 124/5107 useless extension candidates. Maximal degree in co-relation 15128. Up to 1931 conditions per place. [2022-12-13 10:38:56,544 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 92 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2022-12-13 10:38:56,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 97 transitions, 594 flow [2022-12-13 10:38:56,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:38:56,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:38:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 10:38:56,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.54375 [2022-12-13 10:38:56,545 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 207 flow. Second operand 4 states and 87 transitions. [2022-12-13 10:38:56,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 97 transitions, 594 flow [2022-12-13 10:38:56,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 97 transitions, 572 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-13 10:38:56,550 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 227 flow [2022-12-13 10:38:56,550 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2022-12-13 10:38:56,551 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2022-12-13 10:38:56,551 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:38:56,551 INFO L89 Accepts]: Start accepts. Operand has 57 places, 51 transitions, 227 flow [2022-12-13 10:38:56,553 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:38:56,553 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:38:56,553 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 51 transitions, 227 flow [2022-12-13 10:38:56,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 51 transitions, 227 flow [2022-12-13 10:38:56,585 INFO L130 PetriNetUnfolder]: 154/346 cut-off events. [2022-12-13 10:38:56,585 INFO L131 PetriNetUnfolder]: For 331/336 co-relation queries the response was YES. [2022-12-13 10:38:56,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 346 events. 154/346 cut-off events. For 331/336 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1387 event pairs, 72 based on Foata normal form. 1/306 useless extension candidates. Maximal degree in co-relation 806. Up to 135 conditions per place. [2022-12-13 10:38:56,588 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 51 transitions, 227 flow [2022-12-13 10:38:56,588 INFO L226 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-13 10:38:56,588 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:38:56,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 10:38:56,589 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 227 flow [2022-12-13 10:38:56,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-13 10:38:56,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:38:56,589 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:38:56,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 10:38:56,589 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:38:56,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:38:56,590 INFO L85 PathProgramCache]: Analyzing trace with hash -140204403, now seen corresponding path program 1 times [2022-12-13 10:38:56,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:38:56,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856406871] [2022-12-13 10:38:56,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:38:56,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:38:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:38:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:38:56,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:38:56,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856406871] [2022-12-13 10:38:56,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856406871] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:38:56,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389705543] [2022-12-13 10:38:56,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:38:56,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:38:56,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:38:56,914 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-13 10:38:56,915 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-13 10:38:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:38:57,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 10:38:57,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:38:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:38:57,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:38:57,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389705543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:38:57,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:38:57,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-13 10:38:57,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45950422] [2022-12-13 10:38:57,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:38:57,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:38:57,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:38:57,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:38:57,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:38:57,217 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 10:38:57,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-13 10:38:57,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:38:57,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 10:38:57,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:38:57,964 INFO L130 PetriNetUnfolder]: 5392/7617 cut-off events. [2022-12-13 10:38:57,964 INFO L131 PetriNetUnfolder]: For 11454/11454 co-relation queries the response was YES. [2022-12-13 10:38:57,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23779 conditions, 7617 events. 5392/7617 cut-off events. For 11454/11454 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 34522 event pairs, 3213 based on Foata normal form. 596/8204 useless extension candidates. Maximal degree in co-relation 11461. Up to 4986 conditions per place. [2022-12-13 10:38:57,987 INFO L137 encePairwiseOnDemand]: 30/40 looper letters, 49 selfloop transitions, 3 changer transitions 111/163 dead transitions. [2022-12-13 10:38:57,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 163 transitions, 1009 flow [2022-12-13 10:38:57,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:38:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:38:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2022-12-13 10:38:57,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-13 10:38:57,989 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 227 flow. Second operand 7 states and 144 transitions. [2022-12-13 10:38:57,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 163 transitions, 1009 flow [2022-12-13 10:38:57,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 163 transitions, 993 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-13 10:38:57,996 INFO L231 Difference]: Finished difference. Result has 68 places, 52 transitions, 257 flow [2022-12-13 10:38:57,996 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=257, PETRI_PLACES=68, PETRI_TRANSITIONS=52} [2022-12-13 10:38:57,997 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2022-12-13 10:38:57,997 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:38:57,997 INFO L89 Accepts]: Start accepts. Operand has 68 places, 52 transitions, 257 flow [2022-12-13 10:38:57,997 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:38:57,997 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:38:57,998 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 52 transitions, 257 flow [2022-12-13 10:38:57,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 52 transitions, 257 flow [2022-12-13 10:38:58,029 INFO L130 PetriNetUnfolder]: 156/342 cut-off events. [2022-12-13 10:38:58,029 INFO L131 PetriNetUnfolder]: For 489/511 co-relation queries the response was YES. [2022-12-13 10:38:58,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 342 events. 156/342 cut-off events. For 489/511 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1338 event pairs, 72 based on Foata normal form. 1/304 useless extension candidates. Maximal degree in co-relation 961. Up to 136 conditions per place. [2022-12-13 10:38:58,033 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 52 transitions, 257 flow [2022-12-13 10:38:58,033 INFO L226 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-13 10:38:58,460 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:38:58,461 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 464 [2022-12-13 10:38:58,461 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 253 flow [2022-12-13 10:38:58,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-13 10:38:58,461 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:38:58,461 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:38:58,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 10:38:58,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 10:38:58,662 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:38:58,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:38:58,662 INFO L85 PathProgramCache]: Analyzing trace with hash -192687260, now seen corresponding path program 1 times [2022-12-13 10:38:58,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:38:58,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755148684] [2022-12-13 10:38:58,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:38:58,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:38:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:39:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:39:03,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:39:03,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755148684] [2022-12-13 10:39:03,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755148684] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:39:03,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139635922] [2022-12-13 10:39:03,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:39:03,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:39:03,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:39:03,598 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-13 10:39:03,599 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-13 10:39:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:39:03,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 102 conjunts are in the unsatisfiable core [2022-12-13 10:39:03,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:39:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:39:05,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:39:27,700 WARN L233 SmtUtils]: Spent 20.10s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 10:40:10,116 WARN L233 SmtUtils]: Spent 42.25s on a formula simplification. DAG size of input: 62 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 10:40:32,328 WARN L233 SmtUtils]: Spent 22.10s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 10:41:16,627 WARN L233 SmtUtils]: Spent 44.19s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 10:42:31,974 WARN L233 SmtUtils]: Spent 1.25m on a formula simplification. DAG size of input: 89 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 10:44:07,059 WARN L233 SmtUtils]: Spent 1.58m on a formula simplification. DAG size of input: 103 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 10:46:26,191 WARN L233 SmtUtils]: Spent 2.28m on a formula simplification. DAG size of input: 113 DAG size of output: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 10:47:49,525 WARN L233 SmtUtils]: Spent 1.38m on a formula simplification. DAG size of input: 2619 DAG size of output: 2538 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-13 10:47:49,533 INFO L321 Elim1Store]: treesize reduction 405, result has 96.5 percent of original size [2022-12-13 10:47:49,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 37 select indices, 37 select index equivalence classes, 0 disjoint index pairs (out of 666 index pairs), introduced 37 new quantified variables, introduced 666 case distinctions, treesize of input 777 treesize of output 11241 Received shutdown request... [2022-12-13 10:52:33,243 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 10:52:33,244 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 10:52:33,245 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 10:52:33,246 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 10:52:33,250 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-13 10:52:33,445 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,SelfDestructingSolverStorable14 [2022-12-13 10:52:33,445 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 36 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 35ms.. [2022-12-13 10:52:33,447 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 10:52:33,447 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 10:52:33,447 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 10:52:33,447 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 10:52:33,447 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:52:33,449 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 10:52:33,449 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 10:52:33,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:52:33 BasicIcfg [2022-12-13 10:52:33,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 10:52:33,451 INFO L158 Benchmark]: Toolchain (without parser) took 845503.63ms. Allocated memory was 259.0MB in the beginning and 879.8MB in the end (delta: 620.8MB). Free memory was 234.9MB in the beginning and 435.7MB in the end (delta: -200.8MB). Peak memory consumption was 555.0MB. Max. memory is 8.0GB. [2022-12-13 10:52:33,451 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 259.0MB. Free memory is still 235.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 10:52:33,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.86ms. Allocated memory is still 259.0MB. Free memory was 234.6MB in the beginning and 218.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 10:52:33,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.13ms. Allocated memory is still 259.0MB. Free memory was 218.6MB in the beginning and 215.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 10:52:33,452 INFO L158 Benchmark]: Boogie Preprocessor took 42.27ms. Allocated memory is still 259.0MB. Free memory was 215.1MB in the beginning and 212.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 10:52:33,452 INFO L158 Benchmark]: RCFGBuilder took 942.28ms. Allocated memory is still 259.0MB. Free memory was 212.7MB in the beginning and 192.3MB in the end (delta: 20.4MB). Peak memory consumption was 32.9MB. Max. memory is 8.0GB. [2022-12-13 10:52:33,452 INFO L158 Benchmark]: TraceAbstraction took 844177.58ms. Allocated memory was 259.0MB in the beginning and 879.8MB in the end (delta: 620.8MB). Free memory was 191.3MB in the beginning and 435.7MB in the end (delta: -244.4MB). Peak memory consumption was 510.6MB. Max. memory is 8.0GB. [2022-12-13 10:52:33,453 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 259.0MB. Free memory is still 235.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 270.86ms. Allocated memory is still 259.0MB. Free memory was 234.6MB in the beginning and 218.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.13ms. Allocated memory is still 259.0MB. Free memory was 218.6MB in the beginning and 215.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.27ms. Allocated memory is still 259.0MB. Free memory was 215.1MB in the beginning and 212.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 942.28ms. Allocated memory is still 259.0MB. Free memory was 212.7MB in the beginning and 192.3MB in the end (delta: 20.4MB). Peak memory consumption was 32.9MB. Max. memory is 8.0GB. * TraceAbstraction took 844177.58ms. Allocated memory was 259.0MB in the beginning and 879.8MB in the end (delta: 620.8MB). Free memory was 191.3MB in the beginning and 435.7MB in the end (delta: -244.4MB). Peak memory consumption was 510.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.4s, 275 PlacesBefore, 46 PlacesAfterwards, 287 TransitionsBefore, 41 TransitionsAfterwards, 2544 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 192 TrivialYvCompositions, 37 ConcurrentYvCompositions, 17 ChoiceCompositions, 246 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1348, independent: 1300, independent conditional: 1300, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1270, independent: 1250, independent conditional: 0, independent unconditional: 1250, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1270, independent: 1250, independent conditional: 0, independent unconditional: 1250, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1270, independent: 1238, independent conditional: 0, independent unconditional: 1238, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 198, independent: 125, independent conditional: 0, independent unconditional: 125, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1348, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 1270, unknown conditional: 1270, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1303, Positive cache size: 1283, Positive conditional cache size: 1283, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 43, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 34, dependent conditional: 8, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 43, unknown conditional: 43, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 33, Positive conditional cache size: 33, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 45 PlacesBefore, 44 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 114, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 25, independent conditional: 1, independent unconditional: 24, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 25, independent conditional: 1, independent unconditional: 24, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 114, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 58, Positive conditional cache size: 58, Positive unconditional cache size: 0, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 60, Positive conditional cache size: 60, Positive unconditional cache size: 0, Negative cache size: 14, Negative conditional cache size: 14, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 46 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 21, independent conditional: 2, independent unconditional: 19, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 21, independent conditional: 2, independent unconditional: 19, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 81, Positive conditional cache size: 81, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 83, Positive conditional cache size: 83, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 53 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 20, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 83, Positive conditional cache size: 83, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 53 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 20, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 83, Positive conditional cache size: 83, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 52 PlacesBefore, 51 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 20, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 83, Positive conditional cache size: 83, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 50 PlacesBefore, 49 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 93, Positive conditional cache size: 93, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 53 PlacesBefore, 51 PlacesAfterwards, 46 TransitionsBefore, 44 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 103, Positive conditional cache size: 103, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 120, Positive cache size: 103, Positive conditional cache size: 103, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 58 PlacesBefore, 57 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 120, Positive cache size: 103, Positive conditional cache size: 103, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 120, Positive cache size: 103, Positive conditional cache size: 103, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 65 PlacesBefore, 64 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 120, Positive cache size: 103, Positive conditional cache size: 103, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 186]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 36 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 35ms.. - TimeoutResultAtElement [Line: 179]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 36 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 35ms.. - TimeoutResultAtElement [Line: 178]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 36 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 35ms.. - TimeoutResultAtElement [Line: 176]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 36 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 35ms.. - TimeoutResultAtElement [Line: 177]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 36 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 35ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 319 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 844.1s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 631 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 631 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1642 IncrementalHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 0 mSDtfsCounter, 1642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=257occurred in iteration=14, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 459 NumberOfCodeBlocks, 459 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 444 ConstructedInterpolants, 0 QuantifiedInterpolants, 1094 SizeOfPredicates, 5 NumberOfNonLiveVariables, 540 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 31/32 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown