/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 10:24:44,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 10:24:44,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 10:24:44,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 10:24:44,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 10:24:44,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 10:24:44,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 10:24:44,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 10:24:44,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 10:24:44,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 10:24:44,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 10:24:44,707 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 10:24:44,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 10:24:44,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 10:24:44,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 10:24:44,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 10:24:44,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 10:24:44,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 10:24:44,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 10:24:44,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 10:24:44,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 10:24:44,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 10:24:44,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 10:24:44,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 10:24:44,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 10:24:44,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 10:24:44,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 10:24:44,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 10:24:44,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 10:24:44,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 10:24:44,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 10:24:44,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 10:24:44,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 10:24:44,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 10:24:44,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 10:24:44,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 10:24:44,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 10:24:44,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 10:24:44,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 10:24:44,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 10:24:44,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 10:24:44,733 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-VariableLbe.epf [2023-01-28 10:24:44,754 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 10:24:44,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 10:24:44,755 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 10:24:44,755 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 10:24:44,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 10:24:44,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 10:24:44,756 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 10:24:44,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 10:24:44,756 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 10:24:44,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 10:24:44,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 10:24:44,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 10:24:44,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 10:24:44,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 10:24:44,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 10:24:44,757 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 10:24:44,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 10:24:44,758 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 10:24:44,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 10:24:44,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 10:24:44,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 10:24:44,758 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 10:24:44,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 10:24:44,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 10:24:44,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 10:24:44,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 10:24:44,758 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 10:24:44,759 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 10:24:44,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 10:24:44,759 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 10:24:44,759 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 10:24:44,759 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 10:24:44,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 10:24:44,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 10:24:44,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 10:24:44,953 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 10:24:44,954 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 10:24:44,955 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-01-28 10:24:45,877 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 10:24:45,997 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 10:24:45,998 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-01-28 10:24:46,005 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d511ab3b/c73f9f3d071444bb9e9c0243a5c0de4f/FLAG8c34ac537 [2023-01-28 10:24:46,014 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d511ab3b/c73f9f3d071444bb9e9c0243a5c0de4f [2023-01-28 10:24:46,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 10:24:46,016 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 10:24:46,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 10:24:46,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 10:24:46,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 10:24:46,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:24:46" (1/1) ... [2023-01-28 10:24:46,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ea009f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:46, skipping insertion in model container [2023-01-28 10:24:46,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:24:46" (1/1) ... [2023-01-28 10:24:46,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 10:24:46,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 10:24:46,131 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2023-01-28 10:24:46,134 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 10:24:46,140 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 10:24:46,154 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2023-01-28 10:24:46,155 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 10:24:46,159 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 10:24:46,159 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 10:24:46,164 INFO L208 MainTranslator]: Completed translation [2023-01-28 10:24:46,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:46 WrapperNode [2023-01-28 10:24:46,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 10:24:46,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 10:24:46,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 10:24:46,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 10:24:46,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:46" (1/1) ... [2023-01-28 10:24:46,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:46" (1/1) ... [2023-01-28 10:24:46,187 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2023-01-28 10:24:46,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 10:24:46,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 10:24:46,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 10:24:46,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 10:24:46,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:46" (1/1) ... [2023-01-28 10:24:46,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:46" (1/1) ... [2023-01-28 10:24:46,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:46" (1/1) ... [2023-01-28 10:24:46,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:46" (1/1) ... [2023-01-28 10:24:46,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:46" (1/1) ... [2023-01-28 10:24:46,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:46" (1/1) ... [2023-01-28 10:24:46,203 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:46" (1/1) ... [2023-01-28 10:24:46,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:46" (1/1) ... [2023-01-28 10:24:46,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 10:24:46,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 10:24:46,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 10:24:46,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 10:24:46,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:46" (1/1) ... [2023-01-28 10:24:46,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 10:24:46,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:24:46,232 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) [2023-01-28 10:24:46,248 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 [2023-01-28 10:24:46,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 10:24:46,257 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 10:24:46,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 10:24:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 10:24:46,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 10:24:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-28 10:24:46,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-28 10:24:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-01-28 10:24:46,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-01-28 10:24:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 10:24:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 10:24:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 10:24:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 10:24:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 10:24:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 10:24:46,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 10:24:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 10:24:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 10:24:46,260 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 10:24:46,345 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 10:24:46,346 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 10:24:46,532 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 10:24:46,575 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 10:24:46,575 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-28 10:24:46,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:24:46 BoogieIcfgContainer [2023-01-28 10:24:46,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 10:24:46,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 10:24:46,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 10:24:46,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 10:24:46,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:24:46" (1/3) ... [2023-01-28 10:24:46,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5434e5a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:24:46, skipping insertion in model container [2023-01-28 10:24:46,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:46" (2/3) ... [2023-01-28 10:24:46,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5434e5a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:24:46, skipping insertion in model container [2023-01-28 10:24:46,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:24:46" (3/3) ... [2023-01-28 10:24:46,582 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2023-01-28 10:24:46,593 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 10:24:46,593 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 10:24:46,593 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 10:24:46,644 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-01-28 10:24:46,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 120 transitions, 272 flow [2023-01-28 10:24:46,717 INFO L130 PetriNetUnfolder]: 9/116 cut-off events. [2023-01-28 10:24:46,717 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 10:24:46,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 116 events. 9/116 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-01-28 10:24:46,722 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 120 transitions, 272 flow [2023-01-28 10:24:46,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 104 transitions, 232 flow [2023-01-28 10:24:46,727 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 10:24:46,733 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 104 transitions, 232 flow [2023-01-28 10:24:46,735 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 104 transitions, 232 flow [2023-01-28 10:24:46,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 104 transitions, 232 flow [2023-01-28 10:24:46,753 INFO L130 PetriNetUnfolder]: 9/104 cut-off events. [2023-01-28 10:24:46,753 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 10:24:46,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 104 events. 9/104 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-01-28 10:24:46,755 INFO L119 LiptonReduction]: Number of co-enabled transitions 2520 [2023-01-28 10:24:48,915 INFO L134 LiptonReduction]: Checked pairs total: 2606 [2023-01-28 10:24:48,915 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-01-28 10:24:48,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 10:24:48,929 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=PETRI_NET, 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;@69c17e3a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 10:24:48,929 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 10:24:48,934 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2023-01-28 10:24:48,934 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 10:24:48,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:24:48,934 INFO L208 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] [2023-01-28 10:24:48,935 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)] === [2023-01-28 10:24:48,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:24:48,938 INFO L85 PathProgramCache]: Analyzing trace with hash -475984634, now seen corresponding path program 1 times [2023-01-28 10:24:48,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:24:48,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294088283] [2023-01-28 10:24:48,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:24:48,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:24:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:24:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:49,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:24:49,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294088283] [2023-01-28 10:24:49,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294088283] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:24:49,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:24:49,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 10:24:49,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942995443] [2023-01-28 10:24:49,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:24:49,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 10:24:49,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:24:49,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 10:24:49,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 10:24:49,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 202 [2023-01-28 10:24:49,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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) [2023-01-28 10:24:49,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:24:49,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 202 [2023-01-28 10:24:49,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:24:49,537 INFO L130 PetriNetUnfolder]: 1537/1954 cut-off events. [2023-01-28 10:24:49,537 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2023-01-28 10:24:49,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4056 conditions, 1954 events. 1537/1954 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6355 event pairs, 141 based on Foata normal form. 1/1138 useless extension candidates. Maximal degree in co-relation 3091. Up to 1733 conditions per place. [2023-01-28 10:24:49,551 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 41 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2023-01-28 10:24:49,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 241 flow [2023-01-28 10:24:49,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 10:24:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 10:24:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-01-28 10:24:49,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5693069306930693 [2023-01-28 10:24:49,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-01-28 10:24:49,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-01-28 10:24:49,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:24:49,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-01-28 10:24:49,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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) [2023-01-28 10:24:49,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 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) [2023-01-28 10:24:49,578 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 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) [2023-01-28 10:24:49,579 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 82 flow. Second operand 3 states and 345 transitions. [2023-01-28 10:24:49,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 241 flow [2023-01-28 10:24:49,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 51 transitions, 211 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-01-28 10:24:49,587 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 99 flow [2023-01-28 10:24:49,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2023-01-28 10:24:49,591 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2023-01-28 10:24:49,591 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 99 flow [2023-01-28 10:24:49,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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) [2023-01-28 10:24:49,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:24:49,592 INFO L208 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] [2023-01-28 10:24:49,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 10:24:49,592 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)] === [2023-01-28 10:24:49,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:24:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2131273016, now seen corresponding path program 1 times [2023-01-28 10:24:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:24:49,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262452468] [2023-01-28 10:24:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:24:49,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:24:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:24:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:49,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:24:49,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262452468] [2023-01-28 10:24:49,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262452468] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:24:49,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:24:49,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:24:49,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596905345] [2023-01-28 10:24:49,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:24:49,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:24:49,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:24:49,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:24:49,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:24:49,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:24:49,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:24:49,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:24:49,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:24:49,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:24:49,964 INFO L130 PetriNetUnfolder]: 2645/3467 cut-off events. [2023-01-28 10:24:49,964 INFO L131 PetriNetUnfolder]: For 1092/1092 co-relation queries the response was YES. [2023-01-28 10:24:49,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8501 conditions, 3467 events. 2645/3467 cut-off events. For 1092/1092 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 15047 event pairs, 598 based on Foata normal form. 62/3529 useless extension candidates. Maximal degree in co-relation 2589. Up to 1576 conditions per place. [2023-01-28 10:24:49,979 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 86 selfloop transitions, 5 changer transitions 0/93 dead transitions. [2023-01-28 10:24:49,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 93 transitions, 461 flow [2023-01-28 10:24:49,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:24:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:24:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-01-28 10:24:49,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504950495049505 [2023-01-28 10:24:49,982 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-01-28 10:24:49,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-01-28 10:24:49,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:24:49,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-01-28 10:24:49,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 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) [2023-01-28 10:24:49,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:24:49,986 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:24:49,986 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 99 flow. Second operand 5 states and 510 transitions. [2023-01-28 10:24:49,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 93 transitions, 461 flow [2023-01-28 10:24:49,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 93 transitions, 448 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 10:24:49,989 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 129 flow [2023-01-28 10:24:49,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2023-01-28 10:24:49,989 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2023-01-28 10:24:49,989 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 129 flow [2023-01-28 10:24:49,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:24:49,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:24:49,990 INFO L208 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] [2023-01-28 10:24:49,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 10:24:49,990 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)] === [2023-01-28 10:24:49,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:24:49,990 INFO L85 PathProgramCache]: Analyzing trace with hash 134921043, now seen corresponding path program 1 times [2023-01-28 10:24:49,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:24:49,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409987545] [2023-01-28 10:24:49,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:24:49,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:24:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:24:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:50,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:24:50,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409987545] [2023-01-28 10:24:50,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409987545] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:24:50,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974186941] [2023-01-28 10:24:50,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:24:50,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:24:50,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:24:50,045 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) [2023-01-28 10:24:50,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 10:24:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:24:50,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 10:24:50,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:24:50,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:50,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:24:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:50,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974186941] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:24:50,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:24:50,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-01-28 10:24:50,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263887893] [2023-01-28 10:24:50,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:24:50,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 10:24:50,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:24:50,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 10:24:50,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-28 10:24:50,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:24:50,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 129 flow. Second operand has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 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) [2023-01-28 10:24:50,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:24:50,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:24:50,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:24:50,593 INFO L130 PetriNetUnfolder]: 3569/4785 cut-off events. [2023-01-28 10:24:50,593 INFO L131 PetriNetUnfolder]: For 3429/3842 co-relation queries the response was YES. [2023-01-28 10:24:50,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12910 conditions, 4785 events. 3569/4785 cut-off events. For 3429/3842 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 21796 event pairs, 436 based on Foata normal form. 523/5265 useless extension candidates. Maximal degree in co-relation 8290. Up to 1988 conditions per place. [2023-01-28 10:24:50,612 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 87 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2023-01-28 10:24:50,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 95 transitions, 523 flow [2023-01-28 10:24:50,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:24:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:24:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-01-28 10:24:50,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502970297029703 [2023-01-28 10:24:50,614 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-01-28 10:24:50,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-01-28 10:24:50,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:24:50,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-01-28 10:24:50,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 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) [2023-01-28 10:24:50,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:24:50,617 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:24:50,617 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 129 flow. Second operand 5 states and 508 transitions. [2023-01-28 10:24:50,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 95 transitions, 523 flow [2023-01-28 10:24:50,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 95 transitions, 504 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 10:24:50,623 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 159 flow [2023-01-28 10:24:50,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2023-01-28 10:24:50,624 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2023-01-28 10:24:50,624 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 159 flow [2023-01-28 10:24:50,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 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) [2023-01-28 10:24:50,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:24:50,625 INFO L208 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] [2023-01-28 10:24:50,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-28 10:24:50,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:24:50,833 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)] === [2023-01-28 10:24:50,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:24:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash -950453983, now seen corresponding path program 1 times [2023-01-28 10:24:50,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:24:50,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399096243] [2023-01-28 10:24:50,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:24:50,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:24:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:24:50,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:50,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:24:50,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399096243] [2023-01-28 10:24:50,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399096243] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:24:50,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509350463] [2023-01-28 10:24:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:24:50,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:24:50,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:24:50,903 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) [2023-01-28 10:24:50,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 10:24:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:24:50,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 10:24:50,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:24:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:51,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:24:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:51,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509350463] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:24:51,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:24:51,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-01-28 10:24:51,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956734662] [2023-01-28 10:24:51,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:24:51,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 10:24:51,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:24:51,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 10:24:51,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-28 10:24:51,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:24:51,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 159 flow. Second operand has 8 states, 8 states have (on average 90.0) internal successors, (720), 8 states have internal predecessors, (720), 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) [2023-01-28 10:24:51,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:24:51,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:24:51,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:24:51,406 INFO L130 PetriNetUnfolder]: 3913/5227 cut-off events. [2023-01-28 10:24:51,406 INFO L131 PetriNetUnfolder]: For 6362/6627 co-relation queries the response was YES. [2023-01-28 10:24:51,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16167 conditions, 5227 events. 3913/5227 cut-off events. For 6362/6627 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 23233 event pairs, 852 based on Foata normal form. 365/5557 useless extension candidates. Maximal degree in co-relation 10491. Up to 2296 conditions per place. [2023-01-28 10:24:51,431 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 90 selfloop transitions, 7 changer transitions 0/100 dead transitions. [2023-01-28 10:24:51,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 100 transitions, 596 flow [2023-01-28 10:24:51,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:24:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:24:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-01-28 10:24:51,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504950495049505 [2023-01-28 10:24:51,433 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-01-28 10:24:51,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-01-28 10:24:51,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:24:51,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-01-28 10:24:51,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 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) [2023-01-28 10:24:51,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:24:51,436 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:24:51,436 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 159 flow. Second operand 5 states and 510 transitions. [2023-01-28 10:24:51,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 100 transitions, 596 flow [2023-01-28 10:24:51,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 100 transitions, 587 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-01-28 10:24:51,444 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 212 flow [2023-01-28 10:24:51,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-01-28 10:24:51,444 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2023-01-28 10:24:51,445 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 212 flow [2023-01-28 10:24:51,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.0) internal successors, (720), 8 states have internal predecessors, (720), 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) [2023-01-28 10:24:51,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:24:51,445 INFO L208 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] [2023-01-28 10:24:51,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-01-28 10:24:51,651 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,SelfDestructingSolverStorable3 [2023-01-28 10:24:51,652 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)] === [2023-01-28 10:24:51,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:24:51,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1864400695, now seen corresponding path program 2 times [2023-01-28 10:24:51,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:24:51,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409349482] [2023-01-28 10:24:51,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:24:51,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:24:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:24:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:51,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:24:51,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409349482] [2023-01-28 10:24:51,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409349482] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:24:51,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:24:51,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:24:51,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446698860] [2023-01-28 10:24:51,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:24:51,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:24:51,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:24:51,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:24:51,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:24:51,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:24:51,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:24:51,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:24:51,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:24:51,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:24:52,254 INFO L130 PetriNetUnfolder]: 5551/7498 cut-off events. [2023-01-28 10:24:52,254 INFO L131 PetriNetUnfolder]: For 14127/14505 co-relation queries the response was YES. [2023-01-28 10:24:52,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24955 conditions, 7498 events. 5551/7498 cut-off events. For 14127/14505 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 36765 event pairs, 1429 based on Foata normal form. 411/7848 useless extension candidates. Maximal degree in co-relation 15467. Up to 3703 conditions per place. [2023-01-28 10:24:52,294 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 94 selfloop transitions, 11 changer transitions 0/108 dead transitions. [2023-01-28 10:24:52,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 108 transitions, 703 flow [2023-01-28 10:24:52,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:24:52,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:24:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-01-28 10:24:52,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502970297029703 [2023-01-28 10:24:52,296 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-01-28 10:24:52,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-01-28 10:24:52,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:24:52,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-01-28 10:24:52,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 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) [2023-01-28 10:24:52,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:24:52,299 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:24:52,300 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 212 flow. Second operand 5 states and 508 transitions. [2023-01-28 10:24:52,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 108 transitions, 703 flow [2023-01-28 10:24:52,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 689 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 10:24:52,319 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 269 flow [2023-01-28 10:24:52,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-01-28 10:24:52,320 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2023-01-28 10:24:52,320 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 269 flow [2023-01-28 10:24:52,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:24:52,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:24:52,321 INFO L208 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] [2023-01-28 10:24:52,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 10:24:52,321 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)] === [2023-01-28 10:24:52,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:24:52,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1282882796, now seen corresponding path program 2 times [2023-01-28 10:24:52,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:24:52,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482614748] [2023-01-28 10:24:52,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:24:52,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:24:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:24:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:52,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:24:52,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482614748] [2023-01-28 10:24:52,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482614748] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:24:52,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:24:52,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:24:52,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119223971] [2023-01-28 10:24:52,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:24:52,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:24:52,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:24:52,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:24:52,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:24:52,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:24:52,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 269 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:24:52,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:24:52,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:24:52,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:24:52,897 INFO L130 PetriNetUnfolder]: 5671/7868 cut-off events. [2023-01-28 10:24:52,898 INFO L131 PetriNetUnfolder]: For 25451/26949 co-relation queries the response was YES. [2023-01-28 10:24:52,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29008 conditions, 7868 events. 5671/7868 cut-off events. For 25451/26949 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 41212 event pairs, 1919 based on Foata normal form. 1586/9272 useless extension candidates. Maximal degree in co-relation 21702. Up to 4441 conditions per place. [2023-01-28 10:24:52,936 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 108 selfloop transitions, 6 changer transitions 0/120 dead transitions. [2023-01-28 10:24:52,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 120 transitions, 891 flow [2023-01-28 10:24:52,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:24:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:24:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-01-28 10:24:52,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502970297029703 [2023-01-28 10:24:52,938 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-01-28 10:24:52,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-01-28 10:24:52,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:24:52,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-01-28 10:24:52,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 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) [2023-01-28 10:24:52,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:24:52,941 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:24:52,941 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 269 flow. Second operand 5 states and 508 transitions. [2023-01-28 10:24:52,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 120 transitions, 891 flow [2023-01-28 10:24:52,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 120 transitions, 825 flow, removed 24 selfloop flow, removed 1 redundant places. [2023-01-28 10:24:52,959 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 291 flow [2023-01-28 10:24:52,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-01-28 10:24:52,960 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2023-01-28 10:24:52,960 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 291 flow [2023-01-28 10:24:52,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:24:52,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:24:52,960 INFO L208 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] [2023-01-28 10:24:52,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 10:24:52,961 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)] === [2023-01-28 10:24:52,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:24:52,961 INFO L85 PathProgramCache]: Analyzing trace with hash -786111875, now seen corresponding path program 3 times [2023-01-28 10:24:52,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:24:52,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672915361] [2023-01-28 10:24:52,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:24:52,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:24:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:24:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:53,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:24:53,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672915361] [2023-01-28 10:24:53,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672915361] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:24:53,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156883045] [2023-01-28 10:24:53,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 10:24:53,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:24:53,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:24:53,025 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:24:53,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 10:24:53,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 10:24:53,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:24:53,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 10:24:53,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:24:53,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:53,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:24:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:53,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156883045] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:24:53,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:24:53,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 10:24:53,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763423239] [2023-01-28 10:24:53,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:24:53,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 10:24:53,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:24:53,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 10:24:53,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-01-28 10:24:53,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:24:53,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 291 flow. Second operand has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 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) [2023-01-28 10:24:53,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:24:53,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:24:53,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:24:53,898 INFO L130 PetriNetUnfolder]: 8386/11509 cut-off events. [2023-01-28 10:24:53,899 INFO L131 PetriNetUnfolder]: For 32012/33129 co-relation queries the response was YES. [2023-01-28 10:24:53,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43270 conditions, 11509 events. 8386/11509 cut-off events. For 32012/33129 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 62789 event pairs, 1876 based on Foata normal form. 1224/12563 useless extension candidates. Maximal degree in co-relation 28010. Up to 4315 conditions per place. [2023-01-28 10:24:53,949 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 152 selfloop transitions, 20 changer transitions 0/177 dead transitions. [2023-01-28 10:24:53,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 177 transitions, 1265 flow [2023-01-28 10:24:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 10:24:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 10:24:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 819 transitions. [2023-01-28 10:24:53,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068069306930693 [2023-01-28 10:24:53,951 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 819 transitions. [2023-01-28 10:24:53,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 819 transitions. [2023-01-28 10:24:53,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:24:53,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 819 transitions. [2023-01-28 10:24:53,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.375) internal successors, (819), 8 states have internal predecessors, (819), 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) [2023-01-28 10:24:53,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 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) [2023-01-28 10:24:53,954 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 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) [2023-01-28 10:24:53,954 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 291 flow. Second operand 8 states and 819 transitions. [2023-01-28 10:24:53,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 177 transitions, 1265 flow [2023-01-28 10:24:53,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 177 transitions, 1223 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-01-28 10:24:53,987 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 466 flow [2023-01-28 10:24:53,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=466, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-01-28 10:24:53,988 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 32 predicate places. [2023-01-28 10:24:53,988 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 466 flow [2023-01-28 10:24:53,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 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) [2023-01-28 10:24:53,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:24:53,988 INFO L208 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] [2023-01-28 10:24:53,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 10:24:54,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:24:54,195 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)] === [2023-01-28 10:24:54,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:24:54,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1812859993, now seen corresponding path program 4 times [2023-01-28 10:24:54,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:24:54,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588403173] [2023-01-28 10:24:54,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:24:54,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:24:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:24:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:54,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:24:54,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588403173] [2023-01-28 10:24:54,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588403173] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:24:54,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:24:54,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:24:54,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474527230] [2023-01-28 10:24:54,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:24:54,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:24:54,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:24:54,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:24:54,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:24:54,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:24:54,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 466 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:24:54,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:24:54,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:24:54,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:24:55,100 INFO L130 PetriNetUnfolder]: 10374/14611 cut-off events. [2023-01-28 10:24:55,101 INFO L131 PetriNetUnfolder]: For 59618/61272 co-relation queries the response was YES. [2023-01-28 10:24:55,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57540 conditions, 14611 events. 10374/14611 cut-off events. For 59618/61272 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 85611 event pairs, 2227 based on Foata normal form. 1805/16079 useless extension candidates. Maximal degree in co-relation 50504. Up to 6194 conditions per place. [2023-01-28 10:24:55,165 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 137 selfloop transitions, 17 changer transitions 0/164 dead transitions. [2023-01-28 10:24:55,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 164 transitions, 1364 flow [2023-01-28 10:24:55,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 10:24:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 10:24:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2023-01-28 10:24:55,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5074257425742574 [2023-01-28 10:24:55,167 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 615 transitions. [2023-01-28 10:24:55,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 615 transitions. [2023-01-28 10:24:55,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:24:55,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 615 transitions. [2023-01-28 10:24:55,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 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) [2023-01-28 10:24:55,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 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) [2023-01-28 10:24:55,170 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 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) [2023-01-28 10:24:55,170 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 466 flow. Second operand 6 states and 615 transitions. [2023-01-28 10:24:55,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 164 transitions, 1364 flow [2023-01-28 10:24:55,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 164 transitions, 1326 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-01-28 10:24:55,242 INFO L231 Difference]: Finished difference. Result has 74 places, 72 transitions, 576 flow [2023-01-28 10:24:55,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=576, PETRI_PLACES=74, PETRI_TRANSITIONS=72} [2023-01-28 10:24:55,243 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2023-01-28 10:24:55,243 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 72 transitions, 576 flow [2023-01-28 10:24:55,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:24:55,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:24:55,244 INFO L208 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] [2023-01-28 10:24:55,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 10:24:55,244 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)] === [2023-01-28 10:24:55,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:24:55,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2097457269, now seen corresponding path program 5 times [2023-01-28 10:24:55,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:24:55,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635086596] [2023-01-28 10:24:55,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:24:55,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:24:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:24:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:55,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:24:55,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635086596] [2023-01-28 10:24:55,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635086596] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:24:55,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:24:55,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:24:55,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915496594] [2023-01-28 10:24:55,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:24:55,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:24:55,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:24:55,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:24:55,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:24:55,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:24:55,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 72 transitions, 576 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:24:55,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:24:55,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:24:55,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:24:56,286 INFO L130 PetriNetUnfolder]: 11079/15861 cut-off events. [2023-01-28 10:24:56,286 INFO L131 PetriNetUnfolder]: For 70431/72335 co-relation queries the response was YES. [2023-01-28 10:24:56,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64859 conditions, 15861 events. 11079/15861 cut-off events. For 70431/72335 co-relation queries the response was YES. Maximal size of possible extension queue 908. Compared 97497 event pairs, 2860 based on Foata normal form. 1937/17446 useless extension candidates. Maximal degree in co-relation 58035. Up to 6945 conditions per place. [2023-01-28 10:24:56,359 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 141 selfloop transitions, 11 changer transitions 0/162 dead transitions. [2023-01-28 10:24:56,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 162 transitions, 1461 flow [2023-01-28 10:24:56,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:24:56,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:24:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-01-28 10:24:56,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069306930693069 [2023-01-28 10:24:56,361 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-01-28 10:24:56,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-01-28 10:24:56,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:24:56,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-01-28 10:24:56,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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) [2023-01-28 10:24:56,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:24:56,363 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:24:56,363 INFO L175 Difference]: Start difference. First operand has 74 places, 72 transitions, 576 flow. Second operand 5 states and 512 transitions. [2023-01-28 10:24:56,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 162 transitions, 1461 flow [2023-01-28 10:24:56,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 162 transitions, 1461 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 10:24:56,475 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 638 flow [2023-01-28 10:24:56,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=638, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2023-01-28 10:24:56,476 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2023-01-28 10:24:56,476 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 638 flow [2023-01-28 10:24:56,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:24:56,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:24:56,477 INFO L208 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] [2023-01-28 10:24:56,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 10:24:56,477 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)] === [2023-01-28 10:24:56,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:24:56,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1571815567, now seen corresponding path program 6 times [2023-01-28 10:24:56,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:24:56,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549775992] [2023-01-28 10:24:56,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:24:56,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:24:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:24:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:56,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:24:56,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549775992] [2023-01-28 10:24:56,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549775992] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:24:56,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685881458] [2023-01-28 10:24:56,538 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 10:24:56,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:24:56,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:24:56,539 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:24:56,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 10:24:56,609 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-28 10:24:56,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:24:56,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 10:24:56,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:24:56,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:56,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:24:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:56,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685881458] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:24:56,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:24:56,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 10:24:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783042740] [2023-01-28 10:24:56,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:24:56,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 10:24:56,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:24:56,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 10:24:56,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-01-28 10:24:56,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:24:56,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 638 flow. Second operand has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 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) [2023-01-28 10:24:56,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:24:56,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:24:56,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:24:57,046 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 698#(= thread3Thread1of1ForFork3_~i~2 0), Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:24:57,046 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-01-28 10:24:57,046 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 10:24:57,046 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-01-28 10:24:57,046 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-01-28 10:24:57,049 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), 73#$Ultimate##0true, Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 10:24:57,049 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-01-28 10:24:57,049 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-01-28 10:24:57,049 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 10:24:57,049 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-01-28 10:24:57,161 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:24:57,161 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,161 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,161 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 10:24:57,162 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 10:24:57,163 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), 73#$Ultimate##0true, Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0), 64#thread1EXITtrue]) [2023-01-28 10:24:57,163 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,163 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 10:24:57,163 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 10:24:57,163 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,232 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 698#(= thread3Thread1of1ForFork3_~i~2 0), 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:24:57,232 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,233 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 10:24:57,233 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,233 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 10:24:57,234 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-01-28 10:24:57,234 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,234 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 10:24:57,234 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,234 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 10:24:57,235 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 10:24:57,235 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,236 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,236 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 10:24:57,236 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 10:24:57,379 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 698#(= thread3Thread1of1ForFork3_~i~2 0), 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:24:57,379 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,379 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,379 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,379 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,380 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0), 64#thread1EXITtrue]) [2023-01-28 10:24:57,380 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,380 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,380 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,381 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,383 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), 73#$Ultimate##0true, Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 10:24:57,383 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,383 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,383 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,383 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,392 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, 10#L91-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 10:24:57,392 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,393 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,393 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,393 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,393 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-01-28 10:24:57,394 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,394 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,394 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,394 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,395 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 10:24:57,395 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,395 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,395 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,395 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,397 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 64#thread1EXITtrue]) [2023-01-28 10:24:57,397 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,397 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,397 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,397 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:24:57,537 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, 10#L91-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0), 64#thread1EXITtrue]) [2023-01-28 10:24:57,537 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,538 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,538 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,538 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,539 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0), 64#thread1EXITtrue]) [2023-01-28 10:24:57,539 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,539 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,539 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,539 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,540 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:24:57,541 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,541 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,541 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,541 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,543 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), 73#$Ultimate##0true, Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 10:24:57,543 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,543 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,543 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,543 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,551 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 10:24:57,551 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,552 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,552 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,552 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,552 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 64#thread1EXITtrue]) [2023-01-28 10:24:57,553 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,553 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,553 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,553 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:24:57,669 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0), 64#thread1EXITtrue]) [2023-01-28 10:24:57,669 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 10:24:57,669 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 10:24:57,669 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,669 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,670 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 10:24:57,670 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 10:24:57,670 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,670 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 10:24:57,670 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,672 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:24:57,672 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 10:24:57,672 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,672 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 10:24:57,672 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,680 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), 48#L92-2true, Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-01-28 10:24:57,680 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 10:24:57,680 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 10:24:57,680 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,680 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:24:57,762 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 10:24:57,762 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 10:24:57,762 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 10:24:57,762 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 10:24:57,763 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 10:24:57,763 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 10:24:57,763 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 10:24:57,763 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 10:24:57,763 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 10:24:57,763 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 10:24:57,769 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-01-28 10:24:57,769 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 10:24:57,769 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 10:24:57,769 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 10:24:57,769 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 10:24:57,844 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 10:24:57,845 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 10:24:57,845 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 10:24:57,845 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 10:24:57,845 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 10:24:58,069 INFO L130 PetriNetUnfolder]: 12225/17299 cut-off events. [2023-01-28 10:24:58,069 INFO L131 PetriNetUnfolder]: For 90018/91284 co-relation queries the response was YES. [2023-01-28 10:24:58,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74018 conditions, 17299 events. 12225/17299 cut-off events. For 90018/91284 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 103390 event pairs, 3391 based on Foata normal form. 1383/18291 useless extension candidates. Maximal degree in co-relation 60175. Up to 6942 conditions per place. [2023-01-28 10:24:58,150 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 119 selfloop transitions, 31 changer transitions 0/157 dead transitions. [2023-01-28 10:24:58,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 157 transitions, 1499 flow [2023-01-28 10:24:58,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:24:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:24:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-01-28 10:24:58,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099009900990099 [2023-01-28 10:24:58,152 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-01-28 10:24:58,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-01-28 10:24:58,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:24:58,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-01-28 10:24:58,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 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) [2023-01-28 10:24:58,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:24:58,154 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:24:58,154 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 638 flow. Second operand 5 states and 515 transitions. [2023-01-28 10:24:58,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 157 transitions, 1499 flow [2023-01-28 10:24:58,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 157 transitions, 1460 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 10:24:58,260 INFO L231 Difference]: Finished difference. Result has 85 places, 85 transitions, 875 flow [2023-01-28 10:24:58,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=875, PETRI_PLACES=85, PETRI_TRANSITIONS=85} [2023-01-28 10:24:58,260 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 47 predicate places. [2023-01-28 10:24:58,261 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 85 transitions, 875 flow [2023-01-28 10:24:58,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 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) [2023-01-28 10:24:58,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:24:58,261 INFO L208 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] [2023-01-28 10:24:58,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-28 10:24:58,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:24:58,466 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)] === [2023-01-28 10:24:58,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:24:58,466 INFO L85 PathProgramCache]: Analyzing trace with hash -212221697, now seen corresponding path program 1 times [2023-01-28 10:24:58,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:24:58,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642217777] [2023-01-28 10:24:58,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:24:58,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:24:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:24:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:24:58,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:24:58,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642217777] [2023-01-28 10:24:58,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642217777] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:24:58,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:24:58,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:24:58,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111135762] [2023-01-28 10:24:58,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:24:58,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:24:58,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:24:58,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:24:58,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:24:58,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:24:58,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 85 transitions, 875 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:24:58,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:24:58,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:24:58,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:25:00,045 INFO L130 PetriNetUnfolder]: 15528/22702 cut-off events. [2023-01-28 10:25:00,045 INFO L131 PetriNetUnfolder]: For 139262/141033 co-relation queries the response was YES. [2023-01-28 10:25:00,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102188 conditions, 22702 events. 15528/22702 cut-off events. For 139262/141033 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 147110 event pairs, 3078 based on Foata normal form. 1878/24441 useless extension candidates. Maximal degree in co-relation 85103. Up to 7619 conditions per place. [2023-01-28 10:25:00,145 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 161 selfloop transitions, 52 changer transitions 4/226 dead transitions. [2023-01-28 10:25:00,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 226 transitions, 2528 flow [2023-01-28 10:25:00,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 10:25:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 10:25:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 607 transitions. [2023-01-28 10:25:00,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008250825082509 [2023-01-28 10:25:00,147 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 607 transitions. [2023-01-28 10:25:00,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 607 transitions. [2023-01-28 10:25:00,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:25:00,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 607 transitions. [2023-01-28 10:25:00,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 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) [2023-01-28 10:25:00,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 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) [2023-01-28 10:25:00,150 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 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) [2023-01-28 10:25:00,150 INFO L175 Difference]: Start difference. First operand has 85 places, 85 transitions, 875 flow. Second operand 6 states and 607 transitions. [2023-01-28 10:25:00,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 226 transitions, 2528 flow [2023-01-28 10:25:00,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 226 transitions, 2444 flow, removed 22 selfloop flow, removed 1 redundant places. [2023-01-28 10:25:00,437 INFO L231 Difference]: Finished difference. Result has 93 places, 114 transitions, 1322 flow [2023-01-28 10:25:00,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1322, PETRI_PLACES=93, PETRI_TRANSITIONS=114} [2023-01-28 10:25:00,438 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 55 predicate places. [2023-01-28 10:25:00,438 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 114 transitions, 1322 flow [2023-01-28 10:25:00,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:25:00,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:25:00,438 INFO L208 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] [2023-01-28 10:25:00,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 10:25:00,438 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)] === [2023-01-28 10:25:00,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:25:00,438 INFO L85 PathProgramCache]: Analyzing trace with hash 550303848, now seen corresponding path program 3 times [2023-01-28 10:25:00,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:25:00,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503805529] [2023-01-28 10:25:00,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:25:00,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:25:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:25:00,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:25:00,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:25:00,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503805529] [2023-01-28 10:25:00,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503805529] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:25:00,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:25:00,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:25:00,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116873644] [2023-01-28 10:25:00,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:25:00,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:25:00,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:25:00,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:25:00,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:25:00,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:25:00,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 114 transitions, 1322 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:25:00,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:25:00,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:25:00,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:25:01,232 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:25:01,232 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2023-01-28 10:25:01,232 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-01-28 10:25:01,232 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-01-28 10:25:01,232 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-01-28 10:25:01,248 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:25:01,249 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-28 10:25:01,249 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:25:01,249 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:25:01,249 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 10:25:01,542 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 671#true, 698#(= thread3Thread1of1ForFork3_~i~2 0), Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:25:01,542 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2023-01-28 10:25:01,542 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-28 10:25:01,542 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-28 10:25:01,542 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-28 10:25:01,555 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:25:01,555 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 10:25:01,555 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:25:01,555 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:25:01,555 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:25:01,569 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:25:01,569 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2023-01-28 10:25:01,569 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-28 10:25:01,569 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-28 10:25:01,569 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-28 10:25:01,583 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:25:01,584 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 10:25:01,584 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:25:01,584 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:25:01,584 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 10:25:01,875 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 671#true, 698#(= thread3Thread1of1ForFork3_~i~2 0), 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:25:01,875 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is not cut-off event [2023-01-28 10:25:01,875 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-01-28 10:25:01,875 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-01-28 10:25:01,875 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-01-28 10:25:01,891 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:25:01,892 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-28 10:25:01,892 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:25:01,892 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:25:01,892 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:25:01,893 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:25:01,893 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-28 10:25:01,893 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:25:01,893 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:25:01,893 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 10:25:02,307 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:25:02,307 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 10:25:02,307 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 10:25:02,307 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 10:25:02,307 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 10:25:02,307 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:25:02,308 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 10:25:02,308 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 10:25:02,308 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 10:25:02,308 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 10:25:02,466 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 10:25:02,466 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 10:25:02,466 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 10:25:02,466 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 10:25:02,467 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 10:25:02,913 INFO L130 PetriNetUnfolder]: 20473/29469 cut-off events. [2023-01-28 10:25:02,913 INFO L131 PetriNetUnfolder]: For 236429/240162 co-relation queries the response was YES. [2023-01-28 10:25:02,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147314 conditions, 29469 events. 20473/29469 cut-off events. For 236429/240162 co-relation queries the response was YES. Maximal size of possible extension queue 1691. Compared 196382 event pairs, 4703 based on Foata normal form. 4146/33372 useless extension candidates. Maximal degree in co-relation 127841. Up to 12333 conditions per place. [2023-01-28 10:25:03,061 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 246 selfloop transitions, 47 changer transitions 1/303 dead transitions. [2023-01-28 10:25:03,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 303 transitions, 4000 flow [2023-01-28 10:25:03,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 10:25:03,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 10:25:03,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 601 transitions. [2023-01-28 10:25:03,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49587458745874585 [2023-01-28 10:25:03,064 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 601 transitions. [2023-01-28 10:25:03,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 601 transitions. [2023-01-28 10:25:03,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:25:03,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 601 transitions. [2023-01-28 10:25:03,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 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) [2023-01-28 10:25:03,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 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) [2023-01-28 10:25:03,066 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 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) [2023-01-28 10:25:03,066 INFO L175 Difference]: Start difference. First operand has 93 places, 114 transitions, 1322 flow. Second operand 6 states and 601 transitions. [2023-01-28 10:25:03,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 303 transitions, 4000 flow [2023-01-28 10:25:03,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 303 transitions, 3992 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-01-28 10:25:03,771 INFO L231 Difference]: Finished difference. Result has 102 places, 147 transitions, 1986 flow [2023-01-28 10:25:03,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1986, PETRI_PLACES=102, PETRI_TRANSITIONS=147} [2023-01-28 10:25:03,771 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 64 predicate places. [2023-01-28 10:25:03,772 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 147 transitions, 1986 flow [2023-01-28 10:25:03,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:25:03,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:25:03,772 INFO L208 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] [2023-01-28 10:25:03,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 10:25:03,772 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)] === [2023-01-28 10:25:03,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:25:03,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1556227291, now seen corresponding path program 2 times [2023-01-28 10:25:03,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:25:03,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880897687] [2023-01-28 10:25:03,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:25:03,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:25:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:25:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:25:03,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:25:03,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880897687] [2023-01-28 10:25:03,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880897687] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:25:03,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:25:03,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:25:03,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758999110] [2023-01-28 10:25:03,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:25:03,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:25:03,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:25:03,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:25:03,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:25:03,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:25:03,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 147 transitions, 1986 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:25:03,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:25:03,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:25:03,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:25:06,240 INFO L130 PetriNetUnfolder]: 19448/28253 cut-off events. [2023-01-28 10:25:06,240 INFO L131 PetriNetUnfolder]: For 276671/281367 co-relation queries the response was YES. [2023-01-28 10:25:06,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152388 conditions, 28253 events. 19448/28253 cut-off events. For 276671/281367 co-relation queries the response was YES. Maximal size of possible extension queue 1625. Compared 190687 event pairs, 4561 based on Foata normal form. 3786/31525 useless extension candidates. Maximal degree in co-relation 130869. Up to 13463 conditions per place. [2023-01-28 10:25:06,404 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 268 selfloop transitions, 41 changer transitions 11/337 dead transitions. [2023-01-28 10:25:06,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 337 transitions, 4694 flow [2023-01-28 10:25:06,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 10:25:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 10:25:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 613 transitions. [2023-01-28 10:25:06,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057755775577558 [2023-01-28 10:25:06,406 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 613 transitions. [2023-01-28 10:25:06,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 613 transitions. [2023-01-28 10:25:06,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:25:06,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 613 transitions. [2023-01-28 10:25:06,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 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) [2023-01-28 10:25:06,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 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) [2023-01-28 10:25:06,409 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 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) [2023-01-28 10:25:06,409 INFO L175 Difference]: Start difference. First operand has 102 places, 147 transitions, 1986 flow. Second operand 6 states and 613 transitions. [2023-01-28 10:25:06,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 337 transitions, 4694 flow [2023-01-28 10:25:07,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 337 transitions, 4592 flow, removed 51 selfloop flow, removed 0 redundant places. [2023-01-28 10:25:07,467 INFO L231 Difference]: Finished difference. Result has 110 places, 172 transitions, 2600 flow [2023-01-28 10:25:07,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1964, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2600, PETRI_PLACES=110, PETRI_TRANSITIONS=172} [2023-01-28 10:25:07,467 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 72 predicate places. [2023-01-28 10:25:07,467 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 172 transitions, 2600 flow [2023-01-28 10:25:07,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:25:07,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:25:07,468 INFO L208 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] [2023-01-28 10:25:07,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 10:25:07,468 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)] === [2023-01-28 10:25:07,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:25:07,468 INFO L85 PathProgramCache]: Analyzing trace with hash 371724395, now seen corresponding path program 3 times [2023-01-28 10:25:07,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:25:07,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360875266] [2023-01-28 10:25:07,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:25:07,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:25:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:25:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:25:07,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:25:07,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360875266] [2023-01-28 10:25:07,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360875266] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:25:07,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:25:07,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:25:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958144410] [2023-01-28 10:25:07,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:25:07,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:25:07,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:25:07,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:25:07,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:25:07,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:25:07,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 172 transitions, 2600 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:25:07,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:25:07,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:25:07,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:25:10,702 INFO L130 PetriNetUnfolder]: 23525/35070 cut-off events. [2023-01-28 10:25:10,702 INFO L131 PetriNetUnfolder]: For 340488/342579 co-relation queries the response was YES. [2023-01-28 10:25:10,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192742 conditions, 35070 events. 23525/35070 cut-off events. For 340488/342579 co-relation queries the response was YES. Maximal size of possible extension queue 1887. Compared 250497 event pairs, 5250 based on Foata normal form. 2789/37354 useless extension candidates. Maximal degree in co-relation 164072. Up to 14042 conditions per place. [2023-01-28 10:25:10,923 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 283 selfloop transitions, 48 changer transitions 22/390 dead transitions. [2023-01-28 10:25:10,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 390 transitions, 5724 flow [2023-01-28 10:25:10,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 10:25:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 10:25:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2023-01-28 10:25:10,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041254125412541 [2023-01-28 10:25:10,925 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 611 transitions. [2023-01-28 10:25:10,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 611 transitions. [2023-01-28 10:25:10,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:25:10,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 611 transitions. [2023-01-28 10:25:10,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 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) [2023-01-28 10:25:10,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 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) [2023-01-28 10:25:10,928 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 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) [2023-01-28 10:25:10,928 INFO L175 Difference]: Start difference. First operand has 110 places, 172 transitions, 2600 flow. Second operand 6 states and 611 transitions. [2023-01-28 10:25:10,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 390 transitions, 5724 flow [2023-01-28 10:25:12,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 390 transitions, 5605 flow, removed 42 selfloop flow, removed 2 redundant places. [2023-01-28 10:25:12,853 INFO L231 Difference]: Finished difference. Result has 117 places, 211 transitions, 3311 flow [2023-01-28 10:25:12,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=2529, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3311, PETRI_PLACES=117, PETRI_TRANSITIONS=211} [2023-01-28 10:25:12,854 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 79 predicate places. [2023-01-28 10:25:12,854 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 211 transitions, 3311 flow [2023-01-28 10:25:12,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:25:12,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:25:12,854 INFO L208 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] [2023-01-28 10:25:12,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 10:25:12,854 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)] === [2023-01-28 10:25:12,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:25:12,855 INFO L85 PathProgramCache]: Analyzing trace with hash 153042763, now seen corresponding path program 4 times [2023-01-28 10:25:12,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:25:12,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928500231] [2023-01-28 10:25:12,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:25:12,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:25:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:25:12,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:25:12,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:25:12,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928500231] [2023-01-28 10:25:12,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928500231] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:25:12,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:25:12,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:25:12,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486668379] [2023-01-28 10:25:12,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:25:12,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:25:12,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:25:12,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:25:12,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:25:12,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:25:12,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 211 transitions, 3311 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:25:12,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:25:12,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:25:12,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:25:16,922 INFO L130 PetriNetUnfolder]: 26685/40089 cut-off events. [2023-01-28 10:25:16,923 INFO L131 PetriNetUnfolder]: For 493723/496874 co-relation queries the response was YES. [2023-01-28 10:25:17,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232960 conditions, 40089 events. 26685/40089 cut-off events. For 493723/496874 co-relation queries the response was YES. Maximal size of possible extension queue 2213. Compared 292880 event pairs, 6666 based on Foata normal form. 3099/42875 useless extension candidates. Maximal degree in co-relation 198842. Up to 17529 conditions per place. [2023-01-28 10:25:17,162 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 337 selfloop transitions, 48 changer transitions 20/442 dead transitions. [2023-01-28 10:25:17,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 442 transitions, 7325 flow [2023-01-28 10:25:17,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:25:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:25:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-01-28 10:25:17,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498019801980198 [2023-01-28 10:25:17,164 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-01-28 10:25:17,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-01-28 10:25:17,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:25:17,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-01-28 10:25:17,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 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) [2023-01-28 10:25:17,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:25:17,166 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:25:17,166 INFO L175 Difference]: Start difference. First operand has 117 places, 211 transitions, 3311 flow. Second operand 5 states and 503 transitions. [2023-01-28 10:25:17,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 442 transitions, 7325 flow [2023-01-28 10:25:20,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 442 transitions, 7257 flow, removed 34 selfloop flow, removed 0 redundant places. [2023-01-28 10:25:20,817 INFO L231 Difference]: Finished difference. Result has 124 places, 240 transitions, 3899 flow [2023-01-28 10:25:20,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=3273, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3899, PETRI_PLACES=124, PETRI_TRANSITIONS=240} [2023-01-28 10:25:20,817 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 86 predicate places. [2023-01-28 10:25:20,817 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 240 transitions, 3899 flow [2023-01-28 10:25:20,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:25:20,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:25:20,818 INFO L208 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] [2023-01-28 10:25:20,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 10:25:20,818 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:25:20,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:25:20,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1733936133, now seen corresponding path program 5 times [2023-01-28 10:25:20,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:25:20,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007286169] [2023-01-28 10:25:20,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:25:20,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:25:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:25:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:25:20,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:25:20,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007286169] [2023-01-28 10:25:20,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007286169] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:25:20,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:25:20,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:25:20,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517423864] [2023-01-28 10:25:20,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:25:20,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:25:20,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:25:20,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:25:20,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:25:20,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:25:20,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 240 transitions, 3899 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:25:20,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:25:20,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:25:20,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:25:25,428 INFO L130 PetriNetUnfolder]: 26719/40118 cut-off events. [2023-01-28 10:25:25,429 INFO L131 PetriNetUnfolder]: For 567927/573002 co-relation queries the response was YES. [2023-01-28 10:25:25,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251915 conditions, 40118 events. 26719/40118 cut-off events. For 567927/573002 co-relation queries the response was YES. Maximal size of possible extension queue 2456. Compared 296876 event pairs, 7549 based on Foata normal form. 4098/43649 useless extension candidates. Maximal degree in co-relation 214000. Up to 15734 conditions per place. [2023-01-28 10:25:25,740 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 257 selfloop transitions, 75 changer transitions 8/362 dead transitions. [2023-01-28 10:25:25,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 362 transitions, 5973 flow [2023-01-28 10:25:25,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:25:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:25:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-01-28 10:25:25,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099009900990099 [2023-01-28 10:25:25,742 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-01-28 10:25:25,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-01-28 10:25:25,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:25:25,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-01-28 10:25:25,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 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) [2023-01-28 10:25:25,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:25:25,746 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:25:25,746 INFO L175 Difference]: Start difference. First operand has 124 places, 240 transitions, 3899 flow. Second operand 5 states and 515 transitions. [2023-01-28 10:25:25,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 362 transitions, 5973 flow [2023-01-28 10:25:28,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 362 transitions, 5904 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-01-28 10:25:28,969 INFO L231 Difference]: Finished difference. Result has 128 places, 246 transitions, 4156 flow [2023-01-28 10:25:28,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=3859, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4156, PETRI_PLACES=128, PETRI_TRANSITIONS=246} [2023-01-28 10:25:28,969 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 90 predicate places. [2023-01-28 10:25:28,969 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 246 transitions, 4156 flow [2023-01-28 10:25:28,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:25:28,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:25:28,970 INFO L208 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] [2023-01-28 10:25:28,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 10:25:28,970 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:25:28,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:25:28,970 INFO L85 PathProgramCache]: Analyzing trace with hash 724866881, now seen corresponding path program 2 times [2023-01-28 10:25:28,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:25:28,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325361945] [2023-01-28 10:25:28,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:25:28,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:25:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:25:29,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:25:29,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:25:29,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325361945] [2023-01-28 10:25:29,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325361945] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:25:29,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492786954] [2023-01-28 10:25:29,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 10:25:29,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:25:29,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:25:29,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:25:29,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 10:25:29,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 10:25:29,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:25:29,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 10:25:29,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:25:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:25:29,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:25:29,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:25:29,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492786954] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:25:29,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:25:29,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-01-28 10:25:29,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885441903] [2023-01-28 10:25:29,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:25:29,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 10:25:29,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:25:29,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 10:25:29,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-28 10:25:29,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:25:29,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 246 transitions, 4156 flow. Second operand has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 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) [2023-01-28 10:25:29,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:25:29,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:25:29,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:25:33,751 INFO L130 PetriNetUnfolder]: 28102/42070 cut-off events. [2023-01-28 10:25:33,752 INFO L131 PetriNetUnfolder]: For 584259/587926 co-relation queries the response was YES. [2023-01-28 10:25:33,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266787 conditions, 42070 events. 28102/42070 cut-off events. For 584259/587926 co-relation queries the response was YES. Maximal size of possible extension queue 2565. Compared 313697 event pairs, 4899 based on Foata normal form. 2906/44097 useless extension candidates. Maximal degree in co-relation 229533. Up to 26800 conditions per place. [2023-01-28 10:25:34,023 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 282 selfloop transitions, 74 changer transitions 17/390 dead transitions. [2023-01-28 10:25:34,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 390 transitions, 6870 flow [2023-01-28 10:25:34,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:25:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:25:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 502 transitions. [2023-01-28 10:25:34,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.497029702970297 [2023-01-28 10:25:34,025 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 502 transitions. [2023-01-28 10:25:34,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 502 transitions. [2023-01-28 10:25:34,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:25:34,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 502 transitions. [2023-01-28 10:25:34,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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) [2023-01-28 10:25:34,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:25:34,027 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:25:34,027 INFO L175 Difference]: Start difference. First operand has 128 places, 246 transitions, 4156 flow. Second operand 5 states and 502 transitions. [2023-01-28 10:25:34,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 390 transitions, 6870 flow [2023-01-28 10:25:38,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 390 transitions, 6701 flow, removed 26 selfloop flow, removed 2 redundant places. [2023-01-28 10:25:38,343 INFO L231 Difference]: Finished difference. Result has 132 places, 257 transitions, 4529 flow [2023-01-28 10:25:38,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=4043, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4529, PETRI_PLACES=132, PETRI_TRANSITIONS=257} [2023-01-28 10:25:38,344 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 94 predicate places. [2023-01-28 10:25:38,344 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 257 transitions, 4529 flow [2023-01-28 10:25:38,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 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) [2023-01-28 10:25:38,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:25:38,344 INFO L208 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] [2023-01-28 10:25:38,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 10:25:38,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-28 10:25:38,549 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:25:38,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:25:38,549 INFO L85 PathProgramCache]: Analyzing trace with hash 661454854, now seen corresponding path program 4 times [2023-01-28 10:25:38,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:25:38,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177643063] [2023-01-28 10:25:38,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:25:38,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:25:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:25:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:25:38,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:25:38,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177643063] [2023-01-28 10:25:38,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177643063] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:25:38,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:25:38,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:25:38,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451625350] [2023-01-28 10:25:38,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:25:38,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:25:38,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:25:38,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:25:38,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:25:38,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:25:38,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 257 transitions, 4529 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:25:38,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:25:38,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:25:38,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:25:43,031 INFO L130 PetriNetUnfolder]: 27022/40814 cut-off events. [2023-01-28 10:25:43,031 INFO L131 PetriNetUnfolder]: For 648539/653209 co-relation queries the response was YES. [2023-01-28 10:25:43,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260199 conditions, 40814 events. 27022/40814 cut-off events. For 648539/653209 co-relation queries the response was YES. Maximal size of possible extension queue 2518. Compared 306608 event pairs, 7155 based on Foata normal form. 4021/44368 useless extension candidates. Maximal degree in co-relation 221887. Up to 15876 conditions per place. [2023-01-28 10:25:43,337 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 273 selfloop transitions, 120 changer transitions 31/441 dead transitions. [2023-01-28 10:25:43,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 441 transitions, 8068 flow [2023-01-28 10:25:43,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:25:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:25:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 513 transitions. [2023-01-28 10:25:43,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079207920792079 [2023-01-28 10:25:43,338 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 513 transitions. [2023-01-28 10:25:43,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 513 transitions. [2023-01-28 10:25:43,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:25:43,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 513 transitions. [2023-01-28 10:25:43,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 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) [2023-01-28 10:25:43,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:25:43,341 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:25:43,341 INFO L175 Difference]: Start difference. First operand has 132 places, 257 transitions, 4529 flow. Second operand 5 states and 513 transitions. [2023-01-28 10:25:43,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 441 transitions, 8068 flow [2023-01-28 10:25:47,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 441 transitions, 7929 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-01-28 10:25:47,560 INFO L231 Difference]: Finished difference. Result has 137 places, 295 transitions, 5544 flow [2023-01-28 10:25:47,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=4420, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5544, PETRI_PLACES=137, PETRI_TRANSITIONS=295} [2023-01-28 10:25:47,560 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 99 predicate places. [2023-01-28 10:25:47,560 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 295 transitions, 5544 flow [2023-01-28 10:25:47,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:25:47,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:25:47,561 INFO L208 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] [2023-01-28 10:25:47,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-28 10:25:47,561 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:25:47,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:25:47,561 INFO L85 PathProgramCache]: Analyzing trace with hash -593576133, now seen corresponding path program 3 times [2023-01-28 10:25:47,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:25:47,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670991435] [2023-01-28 10:25:47,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:25:47,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:25:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:25:47,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:25:47,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:25:47,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670991435] [2023-01-28 10:25:47,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670991435] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:25:47,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:25:47,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:25:47,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185747415] [2023-01-28 10:25:47,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:25:47,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:25:47,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:25:47,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:25:47,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:25:47,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:25:47,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 295 transitions, 5544 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:25:47,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:25:47,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:25:47,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:25:52,915 INFO L130 PetriNetUnfolder]: 29877/44914 cut-off events. [2023-01-28 10:25:52,915 INFO L131 PetriNetUnfolder]: For 718125/722944 co-relation queries the response was YES. [2023-01-28 10:25:53,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295671 conditions, 44914 events. 29877/44914 cut-off events. For 718125/722944 co-relation queries the response was YES. Maximal size of possible extension queue 2839. Compared 340177 event pairs, 7513 based on Foata normal form. 3729/47583 useless extension candidates. Maximal degree in co-relation 256515. Up to 16539 conditions per place. [2023-01-28 10:25:53,235 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 294 selfloop transitions, 121 changer transitions 8/445 dead transitions. [2023-01-28 10:25:53,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 445 transitions, 8306 flow [2023-01-28 10:25:53,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:25:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:25:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2023-01-28 10:25:53,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138613861386139 [2023-01-28 10:25:53,237 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 519 transitions. [2023-01-28 10:25:53,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 519 transitions. [2023-01-28 10:25:53,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:25:53,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 519 transitions. [2023-01-28 10:25:53,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 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) [2023-01-28 10:25:53,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:25:53,239 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:25:53,239 INFO L175 Difference]: Start difference. First operand has 137 places, 295 transitions, 5544 flow. Second operand 5 states and 519 transitions. [2023-01-28 10:25:53,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 445 transitions, 8306 flow [2023-01-28 10:25:58,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 445 transitions, 8082 flow, removed 58 selfloop flow, removed 1 redundant places. [2023-01-28 10:25:58,700 INFO L231 Difference]: Finished difference. Result has 141 places, 307 transitions, 5912 flow [2023-01-28 10:25:58,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=5356, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5912, PETRI_PLACES=141, PETRI_TRANSITIONS=307} [2023-01-28 10:25:58,701 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 103 predicate places. [2023-01-28 10:25:58,701 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 307 transitions, 5912 flow [2023-01-28 10:25:58,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:25:58,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:25:58,701 INFO L208 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] [2023-01-28 10:25:58,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-01-28 10:25:58,701 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:25:58,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:25:58,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1280457636, now seen corresponding path program 5 times [2023-01-28 10:25:58,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:25:58,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808775174] [2023-01-28 10:25:58,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:25:58,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:25:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:25:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:25:58,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:25:58,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808775174] [2023-01-28 10:25:58,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808775174] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:25:58,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138069106] [2023-01-28 10:25:58,736 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 10:25:58,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:25:58,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:25:58,737 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:25:58,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-28 10:25:58,815 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 10:25:58,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:25:58,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 10:25:58,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:25:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:25:58,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:25:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:25:58,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138069106] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:25:58,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:25:58,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-01-28 10:25:58,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244530266] [2023-01-28 10:25:58,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:25:58,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 10:25:58,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:25:58,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 10:25:58,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-28 10:25:58,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:25:58,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 307 transitions, 5912 flow. Second operand has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 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) [2023-01-28 10:25:58,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:25:58,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:25:58,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:26:04,434 INFO L130 PetriNetUnfolder]: 30927/46403 cut-off events. [2023-01-28 10:26:04,434 INFO L131 PetriNetUnfolder]: For 782816/787508 co-relation queries the response was YES. [2023-01-28 10:26:04,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306594 conditions, 46403 events. 30927/46403 cut-off events. For 782816/787508 co-relation queries the response was YES. Maximal size of possible extension queue 2740. Compared 347457 event pairs, 6549 based on Foata normal form. 4025/50056 useless extension candidates. Maximal degree in co-relation 265828. Up to 27244 conditions per place. [2023-01-28 10:26:04,800 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 399 selfloop transitions, 64 changer transitions 22/502 dead transitions. [2023-01-28 10:26:04,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 502 transitions, 10330 flow [2023-01-28 10:26:04,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:26:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:26:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 498 transitions. [2023-01-28 10:26:04,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49306930693069306 [2023-01-28 10:26:04,802 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 498 transitions. [2023-01-28 10:26:04,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 498 transitions. [2023-01-28 10:26:04,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:26:04,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 498 transitions. [2023-01-28 10:26:04,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 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) [2023-01-28 10:26:04,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:26:04,804 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:26:04,804 INFO L175 Difference]: Start difference. First operand has 141 places, 307 transitions, 5912 flow. Second operand 5 states and 498 transitions. [2023-01-28 10:26:04,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 502 transitions, 10330 flow [2023-01-28 10:26:11,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 502 transitions, 9931 flow, removed 45 selfloop flow, removed 2 redundant places. [2023-01-28 10:26:11,508 INFO L231 Difference]: Finished difference. Result has 145 places, 331 transitions, 6445 flow [2023-01-28 10:26:11,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=5646, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6445, PETRI_PLACES=145, PETRI_TRANSITIONS=331} [2023-01-28 10:26:11,509 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 107 predicate places. [2023-01-28 10:26:11,509 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 331 transitions, 6445 flow [2023-01-28 10:26:11,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 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) [2023-01-28 10:26:11,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:26:11,510 INFO L208 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] [2023-01-28 10:26:11,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-28 10:26:11,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:26:11,715 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:26:11,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:26:11,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1098078909, now seen corresponding path program 4 times [2023-01-28 10:26:11,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:26:11,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009472076] [2023-01-28 10:26:11,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:26:11,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:26:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:26:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:26:11,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:26:11,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009472076] [2023-01-28 10:26:11,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009472076] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:26:11,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:26:11,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:26:11,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101765305] [2023-01-28 10:26:11,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:26:11,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:26:11,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:26:11,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:26:11,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:26:11,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:26:11,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 331 transitions, 6445 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:26:11,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:26:11,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:26:11,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:26:17,728 INFO L130 PetriNetUnfolder]: 32086/48461 cut-off events. [2023-01-28 10:26:17,728 INFO L131 PetriNetUnfolder]: For 856277/861744 co-relation queries the response was YES. [2023-01-28 10:26:17,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323315 conditions, 48461 events. 32086/48461 cut-off events. For 856277/861744 co-relation queries the response was YES. Maximal size of possible extension queue 3140. Compared 373632 event pairs, 7386 based on Foata normal form. 4189/51590 useless extension candidates. Maximal degree in co-relation 283420. Up to 18163 conditions per place. [2023-01-28 10:26:18,094 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 249 selfloop transitions, 147 changer transitions 23/441 dead transitions. [2023-01-28 10:26:18,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 441 transitions, 8570 flow [2023-01-28 10:26:18,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:26:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:26:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-01-28 10:26:18,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069306930693069 [2023-01-28 10:26:18,095 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-01-28 10:26:18,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-01-28 10:26:18,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:26:18,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-01-28 10:26:18,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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) [2023-01-28 10:26:18,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:26:18,097 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:26:18,097 INFO L175 Difference]: Start difference. First operand has 145 places, 331 transitions, 6445 flow. Second operand 5 states and 512 transitions. [2023-01-28 10:26:18,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 441 transitions, 8570 flow [2023-01-28 10:26:23,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 441 transitions, 8442 flow, removed 25 selfloop flow, removed 3 redundant places. [2023-01-28 10:26:23,280 INFO L231 Difference]: Finished difference. Result has 148 places, 334 transitions, 6718 flow [2023-01-28 10:26:23,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=6328, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6718, PETRI_PLACES=148, PETRI_TRANSITIONS=334} [2023-01-28 10:26:23,280 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 110 predicate places. [2023-01-28 10:26:23,280 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 334 transitions, 6718 flow [2023-01-28 10:26:23,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:26:23,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:26:23,281 INFO L208 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] [2023-01-28 10:26:23,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-01-28 10:26:23,281 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:26:23,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:26:23,281 INFO L85 PathProgramCache]: Analyzing trace with hash -75263484, now seen corresponding path program 6 times [2023-01-28 10:26:23,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:26:23,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246388106] [2023-01-28 10:26:23,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:26:23,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:26:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:26:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:26:23,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:26:23,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246388106] [2023-01-28 10:26:23,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246388106] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:26:23,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:26:23,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:26:23,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640714762] [2023-01-28 10:26:23,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:26:23,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:26:23,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:26:23,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:26:23,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:26:23,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:26:23,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 334 transitions, 6718 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:26:23,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:26:23,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:26:23,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:26:29,521 INFO L130 PetriNetUnfolder]: 31442/47939 cut-off events. [2023-01-28 10:26:29,521 INFO L131 PetriNetUnfolder]: For 864160/866898 co-relation queries the response was YES. [2023-01-28 10:26:29,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318852 conditions, 47939 events. 31442/47939 cut-off events. For 864160/866898 co-relation queries the response was YES. Maximal size of possible extension queue 2788. Compared 371200 event pairs, 6897 based on Foata normal form. 2516/50112 useless extension candidates. Maximal degree in co-relation 283808. Up to 18393 conditions per place. [2023-01-28 10:26:29,875 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 403 selfloop transitions, 104 changer transitions 73/617 dead transitions. [2023-01-28 10:26:29,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 617 transitions, 12476 flow [2023-01-28 10:26:29,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 10:26:29,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 10:26:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2023-01-28 10:26:29,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4991749174917492 [2023-01-28 10:26:29,877 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 605 transitions. [2023-01-28 10:26:29,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 605 transitions. [2023-01-28 10:26:29,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:26:29,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 605 transitions. [2023-01-28 10:26:29,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 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) [2023-01-28 10:26:29,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 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) [2023-01-28 10:26:29,878 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 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) [2023-01-28 10:26:29,879 INFO L175 Difference]: Start difference. First operand has 148 places, 334 transitions, 6718 flow. Second operand 6 states and 605 transitions. [2023-01-28 10:26:29,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 617 transitions, 12476 flow [2023-01-28 10:26:35,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 617 transitions, 12120 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-28 10:26:35,598 INFO L231 Difference]: Finished difference. Result has 155 places, 390 transitions, 7945 flow [2023-01-28 10:26:35,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=6438, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7945, PETRI_PLACES=155, PETRI_TRANSITIONS=390} [2023-01-28 10:26:35,598 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 117 predicate places. [2023-01-28 10:26:35,598 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 390 transitions, 7945 flow [2023-01-28 10:26:35,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:26:35,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:26:35,599 INFO L208 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] [2023-01-28 10:26:35,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-01-28 10:26:35,599 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:26:35,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:26:35,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1821063516, now seen corresponding path program 7 times [2023-01-28 10:26:35,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:26:35,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278464111] [2023-01-28 10:26:35,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:26:35,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:26:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:26:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:26:35,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:26:35,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278464111] [2023-01-28 10:26:35,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278464111] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:26:35,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:26:35,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:26:35,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089480881] [2023-01-28 10:26:35,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:26:35,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:26:35,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:26:35,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:26:35,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:26:35,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:26:35,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 390 transitions, 7945 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:26:35,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:26:35,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:26:35,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:26:41,977 INFO L130 PetriNetUnfolder]: 30968/46642 cut-off events. [2023-01-28 10:26:41,977 INFO L131 PetriNetUnfolder]: For 926450/929539 co-relation queries the response was YES. [2023-01-28 10:26:42,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331385 conditions, 46642 events. 30968/46642 cut-off events. For 926450/929539 co-relation queries the response was YES. Maximal size of possible extension queue 2795. Compared 349861 event pairs, 9053 based on Foata normal form. 2471/48755 useless extension candidates. Maximal degree in co-relation 295279. Up to 16874 conditions per place. [2023-01-28 10:26:42,384 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 306 selfloop transitions, 169 changer transitions 22/530 dead transitions. [2023-01-28 10:26:42,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 530 transitions, 11154 flow [2023-01-28 10:26:42,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:26:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:26:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-01-28 10:26:42,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501980198019802 [2023-01-28 10:26:42,386 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-01-28 10:26:42,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-01-28 10:26:42,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:26:42,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-01-28 10:26:42,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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) [2023-01-28 10:26:42,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:26:42,387 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:26:42,387 INFO L175 Difference]: Start difference. First operand has 155 places, 390 transitions, 7945 flow. Second operand 5 states and 507 transitions. [2023-01-28 10:26:42,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 530 transitions, 11154 flow [2023-01-28 10:26:48,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 530 transitions, 11078 flow, removed 38 selfloop flow, removed 0 redundant places. [2023-01-28 10:26:48,918 INFO L231 Difference]: Finished difference. Result has 160 places, 409 transitions, 8720 flow [2023-01-28 10:26:48,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=7877, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8720, PETRI_PLACES=160, PETRI_TRANSITIONS=409} [2023-01-28 10:26:48,918 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 122 predicate places. [2023-01-28 10:26:48,919 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 409 transitions, 8720 flow [2023-01-28 10:26:48,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:26:48,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:26:48,919 INFO L208 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] [2023-01-28 10:26:48,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-01-28 10:26:48,919 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:26:48,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:26:48,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2013740015, now seen corresponding path program 5 times [2023-01-28 10:26:48,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:26:48,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895267431] [2023-01-28 10:26:48,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:26:48,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:26:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:26:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:26:48,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:26:48,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895267431] [2023-01-28 10:26:48,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895267431] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:26:48,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:26:48,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:26:48,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613464424] [2023-01-28 10:26:48,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:26:48,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:26:48,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:26:48,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:26:48,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:26:48,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:26:48,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 409 transitions, 8720 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:26:48,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:26:48,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:26:48,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:26:54,849 INFO L130 PetriNetUnfolder]: 27955/41862 cut-off events. [2023-01-28 10:26:54,849 INFO L131 PetriNetUnfolder]: For 940457/946048 co-relation queries the response was YES. [2023-01-28 10:26:55,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308888 conditions, 41862 events. 27955/41862 cut-off events. For 940457/946048 co-relation queries the response was YES. Maximal size of possible extension queue 2756. Compared 311318 event pairs, 7203 based on Foata normal form. 4581/45565 useless extension candidates. Maximal degree in co-relation 288644. Up to 18914 conditions per place. [2023-01-28 10:26:55,177 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 314 selfloop transitions, 185 changer transitions 30/551 dead transitions. [2023-01-28 10:26:55,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 551 transitions, 11826 flow [2023-01-28 10:26:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:26:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:26:55,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-01-28 10:26:55,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099009900990099 [2023-01-28 10:26:55,178 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-01-28 10:26:55,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-01-28 10:26:55,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:26:55,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-01-28 10:26:55,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 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) [2023-01-28 10:26:55,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:26:55,180 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:26:55,180 INFO L175 Difference]: Start difference. First operand has 160 places, 409 transitions, 8720 flow. Second operand 5 states and 515 transitions. [2023-01-28 10:26:55,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 551 transitions, 11826 flow [2023-01-28 10:27:00,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 551 transitions, 11392 flow, removed 45 selfloop flow, removed 3 redundant places. [2023-01-28 10:27:00,186 INFO L231 Difference]: Finished difference. Result has 162 places, 420 transitions, 9009 flow [2023-01-28 10:27:00,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=8292, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9009, PETRI_PLACES=162, PETRI_TRANSITIONS=420} [2023-01-28 10:27:00,187 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 124 predicate places. [2023-01-28 10:27:00,187 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 420 transitions, 9009 flow [2023-01-28 10:27:00,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:27:00,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:27:00,187 INFO L208 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] [2023-01-28 10:27:00,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-01-28 10:27:00,187 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:27:00,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:27:00,187 INFO L85 PathProgramCache]: Analyzing trace with hash 328926055, now seen corresponding path program 6 times [2023-01-28 10:27:00,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:27:00,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74227109] [2023-01-28 10:27:00,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:27:00,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:27:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:27:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:27:00,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:27:00,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74227109] [2023-01-28 10:27:00,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74227109] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:27:00,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120950301] [2023-01-28 10:27:00,224 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 10:27:00,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:27:00,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:27:00,225 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:27:00,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-28 10:27:00,310 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-28 10:27:00,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:27:00,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 10:27:00,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:27:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:27:00,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:27:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:27:00,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120950301] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:27:00,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:27:00,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 10:27:00,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414935471] [2023-01-28 10:27:00,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:27:00,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 10:27:00,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:27:00,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 10:27:00,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-01-28 10:27:00,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:27:00,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 420 transitions, 9009 flow. Second operand has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 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) [2023-01-28 10:27:00,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:27:00,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:27:00,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:27:07,351 INFO L130 PetriNetUnfolder]: 30804/45994 cut-off events. [2023-01-28 10:27:07,351 INFO L131 PetriNetUnfolder]: For 1028273/1032695 co-relation queries the response was YES. [2023-01-28 10:27:07,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337437 conditions, 45994 events. 30804/45994 cut-off events. For 1028273/1032695 co-relation queries the response was YES. Maximal size of possible extension queue 2811. Compared 340648 event pairs, 7530 based on Foata normal form. 4096/49359 useless extension candidates. Maximal degree in co-relation 316189. Up to 17610 conditions per place. [2023-01-28 10:27:07,711 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 416 selfloop transitions, 163 changer transitions 26/651 dead transitions. [2023-01-28 10:27:07,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 651 transitions, 14204 flow [2023-01-28 10:27:07,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:27:07,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:27:07,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-01-28 10:27:07,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099009900990099 [2023-01-28 10:27:07,712 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-01-28 10:27:07,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-01-28 10:27:07,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:27:07,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-01-28 10:27:07,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 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) [2023-01-28 10:27:07,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:27:07,713 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:27:07,713 INFO L175 Difference]: Start difference. First operand has 162 places, 420 transitions, 9009 flow. Second operand 5 states and 515 transitions. [2023-01-28 10:27:07,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 651 transitions, 14204 flow [2023-01-28 10:27:14,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 651 transitions, 13622 flow, removed 54 selfloop flow, removed 4 redundant places. [2023-01-28 10:27:14,056 INFO L231 Difference]: Finished difference. Result has 165 places, 481 transitions, 10412 flow [2023-01-28 10:27:14,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=8543, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10412, PETRI_PLACES=165, PETRI_TRANSITIONS=481} [2023-01-28 10:27:14,057 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 127 predicate places. [2023-01-28 10:27:14,057 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 481 transitions, 10412 flow [2023-01-28 10:27:14,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 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) [2023-01-28 10:27:14,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:27:14,057 INFO L208 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] [2023-01-28 10:27:14,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-01-28 10:27:14,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:27:14,262 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:27:14,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:27:14,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1550796492, now seen corresponding path program 8 times [2023-01-28 10:27:14,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:27:14,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136315243] [2023-01-28 10:27:14,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:27:14,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:27:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:27:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:27:14,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:27:14,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136315243] [2023-01-28 10:27:14,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136315243] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:27:14,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:27:14,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:27:14,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252573080] [2023-01-28 10:27:14,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:27:14,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:27:14,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:27:14,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:27:14,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:27:14,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:27:14,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 481 transitions, 10412 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:27:14,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:27:14,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:27:14,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:27:21,406 INFO L130 PetriNetUnfolder]: 30448/45750 cut-off events. [2023-01-28 10:27:21,407 INFO L131 PetriNetUnfolder]: For 988654/990532 co-relation queries the response was YES. [2023-01-28 10:27:21,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336545 conditions, 45750 events. 30448/45750 cut-off events. For 988654/990532 co-relation queries the response was YES. Maximal size of possible extension queue 2616. Compared 339960 event pairs, 7545 based on Foata normal form. 1138/46536 useless extension candidates. Maximal degree in co-relation 317170. Up to 21598 conditions per place. [2023-01-28 10:27:21,872 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 487 selfloop transitions, 97 changer transitions 77/715 dead transitions. [2023-01-28 10:27:21,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 715 transitions, 15601 flow [2023-01-28 10:27:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:27:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:27:21,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2023-01-28 10:27:21,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505940594059406 [2023-01-28 10:27:21,873 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions. [2023-01-28 10:27:21,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions. [2023-01-28 10:27:21,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:27:21,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions. [2023-01-28 10:27:21,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 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) [2023-01-28 10:27:21,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:27:21,875 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:27:21,875 INFO L175 Difference]: Start difference. First operand has 165 places, 481 transitions, 10412 flow. Second operand 5 states and 511 transitions. [2023-01-28 10:27:21,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 715 transitions, 15601 flow [2023-01-28 10:27:28,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 715 transitions, 15241 flow, removed 96 selfloop flow, removed 1 redundant places. [2023-01-28 10:27:28,925 INFO L231 Difference]: Finished difference. Result has 171 places, 524 transitions, 11402 flow [2023-01-28 10:27:28,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=10101, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11402, PETRI_PLACES=171, PETRI_TRANSITIONS=524} [2023-01-28 10:27:28,926 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 133 predicate places. [2023-01-28 10:27:28,926 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 524 transitions, 11402 flow [2023-01-28 10:27:28,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:27:28,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:27:28,926 INFO L208 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] [2023-01-28 10:27:28,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-01-28 10:27:28,927 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:27:28,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:27:28,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1955010241, now seen corresponding path program 7 times [2023-01-28 10:27:28,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:27:28,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274388837] [2023-01-28 10:27:28,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:27:28,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:27:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:27:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:27:28,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:27:28,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274388837] [2023-01-28 10:27:28,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274388837] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:27:28,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21445237] [2023-01-28 10:27:28,979 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 10:27:28,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:27:28,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:27:28,980 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:27:28,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-28 10:27:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:27:29,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 10:27:29,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:27:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:27:29,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:27:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:27:29,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21445237] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:27:29,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:27:29,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 10:27:29,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696386694] [2023-01-28 10:27:29,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:27:29,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 10:27:29,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:27:29,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 10:27:29,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-01-28 10:27:29,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:27:29,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 524 transitions, 11402 flow. Second operand has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 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) [2023-01-28 10:27:29,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:27:29,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:27:29,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:27:35,909 INFO L130 PetriNetUnfolder]: 28497/42251 cut-off events. [2023-01-28 10:27:35,910 INFO L131 PetriNetUnfolder]: For 1036949/1041043 co-relation queries the response was YES. [2023-01-28 10:27:36,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324920 conditions, 42251 events. 28497/42251 cut-off events. For 1036949/1041043 co-relation queries the response was YES. Maximal size of possible extension queue 2536. Compared 306329 event pairs, 3394 based on Foata normal form. 3859/45367 useless extension candidates. Maximal degree in co-relation 306550. Up to 15562 conditions per place. [2023-01-28 10:27:36,322 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 574 selfloop transitions, 161 changer transitions 81/868 dead transitions. [2023-01-28 10:27:36,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 868 transitions, 18971 flow [2023-01-28 10:27:36,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 10:27:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 10:27:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 813 transitions. [2023-01-28 10:27:36,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030940594059405 [2023-01-28 10:27:36,323 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 813 transitions. [2023-01-28 10:27:36,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 813 transitions. [2023-01-28 10:27:36,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:27:36,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 813 transitions. [2023-01-28 10:27:36,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.625) internal successors, (813), 8 states have internal predecessors, (813), 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) [2023-01-28 10:27:36,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 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) [2023-01-28 10:27:36,326 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 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) [2023-01-28 10:27:36,326 INFO L175 Difference]: Start difference. First operand has 171 places, 524 transitions, 11402 flow. Second operand 8 states and 813 transitions. [2023-01-28 10:27:36,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 868 transitions, 18971 flow [2023-01-28 10:27:43,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 868 transitions, 18711 flow, removed 101 selfloop flow, removed 1 redundant places. [2023-01-28 10:27:43,049 INFO L231 Difference]: Finished difference. Result has 179 places, 546 transitions, 12220 flow [2023-01-28 10:27:43,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11204, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12220, PETRI_PLACES=179, PETRI_TRANSITIONS=546} [2023-01-28 10:27:43,049 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 141 predicate places. [2023-01-28 10:27:43,049 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 546 transitions, 12220 flow [2023-01-28 10:27:43,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 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) [2023-01-28 10:27:43,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:27:43,050 INFO L208 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] [2023-01-28 10:27:43,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-28 10:27:43,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-01-28 10:27:43,250 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:27:43,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:27:43,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1547411515, now seen corresponding path program 6 times [2023-01-28 10:27:43,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:27:43,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533973171] [2023-01-28 10:27:43,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:27:43,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:27:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:27:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:27:43,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:27:43,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533973171] [2023-01-28 10:27:43,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533973171] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:27:43,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:27:43,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:27:43,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878488766] [2023-01-28 10:27:43,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:27:43,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:27:43,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:27:43,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:27:43,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:27:43,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:27:43,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 546 transitions, 12220 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:27:43,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:27:43,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:27:43,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:27:49,250 INFO L130 PetriNetUnfolder]: 25160/36932 cut-off events. [2023-01-28 10:27:49,250 INFO L131 PetriNetUnfolder]: For 986589/994236 co-relation queries the response was YES. [2023-01-28 10:27:49,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290487 conditions, 36932 events. 25160/36932 cut-off events. For 986589/994236 co-relation queries the response was YES. Maximal size of possible extension queue 2305. Compared 259742 event pairs, 5948 based on Foata normal form. 5920/41908 useless extension candidates. Maximal degree in co-relation 273173. Up to 16715 conditions per place. [2023-01-28 10:27:49,603 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 388 selfloop transitions, 235 changer transitions 75/729 dead transitions. [2023-01-28 10:27:49,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 729 transitions, 16766 flow [2023-01-28 10:27:49,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 10:27:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 10:27:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2023-01-28 10:27:49,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-28 10:27:49,604 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2023-01-28 10:27:49,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2023-01-28 10:27:49,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:27:49,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2023-01-28 10:27:49,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 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) [2023-01-28 10:27:49,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 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) [2023-01-28 10:27:49,606 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 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) [2023-01-28 10:27:49,606 INFO L175 Difference]: Start difference. First operand has 179 places, 546 transitions, 12220 flow. Second operand 6 states and 606 transitions. [2023-01-28 10:27:49,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 729 transitions, 16766 flow [2023-01-28 10:27:54,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 729 transitions, 16268 flow, removed 86 selfloop flow, removed 5 redundant places. [2023-01-28 10:27:54,263 INFO L231 Difference]: Finished difference. Result has 180 places, 545 transitions, 12355 flow [2023-01-28 10:27:54,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11776, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12355, PETRI_PLACES=180, PETRI_TRANSITIONS=545} [2023-01-28 10:27:54,263 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 142 predicate places. [2023-01-28 10:27:54,263 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 545 transitions, 12355 flow [2023-01-28 10:27:54,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:27:54,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:27:54,264 INFO L208 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] [2023-01-28 10:27:54,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-01-28 10:27:54,264 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:27:54,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:27:54,264 INFO L85 PathProgramCache]: Analyzing trace with hash 13754851, now seen corresponding path program 7 times [2023-01-28 10:27:54,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:27:54,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554246890] [2023-01-28 10:27:54,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:27:54,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:27:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:27:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:27:54,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:27:54,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554246890] [2023-01-28 10:27:54,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554246890] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:27:54,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:27:54,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:27:54,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513470047] [2023-01-28 10:27:54,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:27:54,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:27:54,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:27:54,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:27:54,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:27:54,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:27:54,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 545 transitions, 12355 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:27:54,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:27:54,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:27:54,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:28:00,030 INFO L130 PetriNetUnfolder]: 24669/35922 cut-off events. [2023-01-28 10:28:00,030 INFO L131 PetriNetUnfolder]: For 841027/843152 co-relation queries the response was YES. [2023-01-28 10:28:00,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277215 conditions, 35922 events. 24669/35922 cut-off events. For 841027/843152 co-relation queries the response was YES. Maximal size of possible extension queue 1938. Compared 242490 event pairs, 4292 based on Foata normal form. 1728/37238 useless extension candidates. Maximal degree in co-relation 262952. Up to 18008 conditions per place. [2023-01-28 10:28:00,344 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 439 selfloop transitions, 192 changer transitions 64/733 dead transitions. [2023-01-28 10:28:00,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 733 transitions, 17092 flow [2023-01-28 10:28:00,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:28:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:28:00,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2023-01-28 10:28:00,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500990099009901 [2023-01-28 10:28:00,345 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2023-01-28 10:28:00,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2023-01-28 10:28:00,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:28:00,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2023-01-28 10:28:00,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 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) [2023-01-28 10:28:00,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:28:00,346 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:28:00,346 INFO L175 Difference]: Start difference. First operand has 180 places, 545 transitions, 12355 flow. Second operand 5 states and 506 transitions. [2023-01-28 10:28:00,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 733 transitions, 17092 flow [2023-01-28 10:28:05,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 733 transitions, 16406 flow, removed 112 selfloop flow, removed 5 redundant places. [2023-01-28 10:28:05,575 INFO L231 Difference]: Finished difference. Result has 181 places, 553 transitions, 12456 flow [2023-01-28 10:28:05,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11669, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12456, PETRI_PLACES=181, PETRI_TRANSITIONS=553} [2023-01-28 10:28:05,576 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 143 predicate places. [2023-01-28 10:28:05,576 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 553 transitions, 12456 flow [2023-01-28 10:28:05,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:28:05,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:28:05,577 INFO L208 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] [2023-01-28 10:28:05,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-01-28 10:28:05,577 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:28:05,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:28:05,577 INFO L85 PathProgramCache]: Analyzing trace with hash 201753452, now seen corresponding path program 9 times [2023-01-28 10:28:05,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:28:05,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844000444] [2023-01-28 10:28:05,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:28:05,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:28:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:28:05,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:28:05,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:28:05,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844000444] [2023-01-28 10:28:05,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844000444] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:28:05,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:28:05,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:28:05,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35079874] [2023-01-28 10:28:05,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:28:05,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:28:05,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:28:05,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:28:05,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:28:05,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:28:05,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 553 transitions, 12456 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:28:05,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:28:05,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:28:05,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:28:11,617 INFO L130 PetriNetUnfolder]: 25669/36968 cut-off events. [2023-01-28 10:28:11,618 INFO L131 PetriNetUnfolder]: For 867355/869414 co-relation queries the response was YES. [2023-01-28 10:28:11,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283852 conditions, 36968 events. 25669/36968 cut-off events. For 867355/869414 co-relation queries the response was YES. Maximal size of possible extension queue 1951. Compared 244752 event pairs, 6934 based on Foata normal form. 1210/37880 useless extension candidates. Maximal degree in co-relation 269900. Up to 20029 conditions per place. [2023-01-28 10:28:11,933 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 553 selfloop transitions, 93 changer transitions 22/718 dead transitions. [2023-01-28 10:28:11,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 718 transitions, 16758 flow [2023-01-28 10:28:11,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:28:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:28:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-01-28 10:28:11,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501980198019802 [2023-01-28 10:28:11,937 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-01-28 10:28:11,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-01-28 10:28:11,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:28:11,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-01-28 10:28:11,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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) [2023-01-28 10:28:11,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:28:11,939 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:28:11,939 INFO L175 Difference]: Start difference. First operand has 181 places, 553 transitions, 12456 flow. Second operand 5 states and 507 transitions. [2023-01-28 10:28:11,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 718 transitions, 16758 flow [2023-01-28 10:28:17,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 718 transitions, 16201 flow, removed 51 selfloop flow, removed 5 redundant places. [2023-01-28 10:28:17,936 INFO L231 Difference]: Finished difference. Result has 181 places, 562 transitions, 12412 flow [2023-01-28 10:28:17,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11976, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12412, PETRI_PLACES=181, PETRI_TRANSITIONS=562} [2023-01-28 10:28:17,937 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 143 predicate places. [2023-01-28 10:28:17,937 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 562 transitions, 12412 flow [2023-01-28 10:28:17,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:28:17,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:28:17,937 INFO L208 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] [2023-01-28 10:28:17,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-01-28 10:28:17,937 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:28:17,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:28:17,937 INFO L85 PathProgramCache]: Analyzing trace with hash -303154112, now seen corresponding path program 10 times [2023-01-28 10:28:17,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:28:17,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705811278] [2023-01-28 10:28:17,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:28:17,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:28:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:28:17,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:28:17,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:28:17,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705811278] [2023-01-28 10:28:17,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705811278] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:28:17,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:28:17,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:28:17,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190321764] [2023-01-28 10:28:17,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:28:17,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:28:17,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:28:17,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:28:17,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:28:17,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:28:17,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 562 transitions, 12412 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:28:17,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:28:17,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:28:17,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:28:23,356 INFO L130 PetriNetUnfolder]: 23491/33728 cut-off events. [2023-01-28 10:28:23,357 INFO L131 PetriNetUnfolder]: For 806643/809922 co-relation queries the response was YES. [2023-01-28 10:28:23,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261789 conditions, 33728 events. 23491/33728 cut-off events. For 806643/809922 co-relation queries the response was YES. Maximal size of possible extension queue 1895. Compared 221443 event pairs, 6161 based on Foata normal form. 2063/35586 useless extension candidates. Maximal degree in co-relation 251511. Up to 16283 conditions per place. [2023-01-28 10:28:23,638 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 495 selfloop transitions, 131 changer transitions 51/705 dead transitions. [2023-01-28 10:28:23,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 705 transitions, 16312 flow [2023-01-28 10:28:23,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:28:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:28:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-01-28 10:28:23,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49603960396039604 [2023-01-28 10:28:23,640 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-01-28 10:28:23,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-01-28 10:28:23,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:28:23,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-01-28 10:28:23,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 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) [2023-01-28 10:28:23,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:28:23,641 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:28:23,641 INFO L175 Difference]: Start difference. First operand has 181 places, 562 transitions, 12412 flow. Second operand 5 states and 501 transitions. [2023-01-28 10:28:23,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 705 transitions, 16312 flow [2023-01-28 10:28:29,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 705 transitions, 16044 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-01-28 10:28:29,293 INFO L231 Difference]: Finished difference. Result has 183 places, 550 transitions, 12321 flow [2023-01-28 10:28:29,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=12196, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12321, PETRI_PLACES=183, PETRI_TRANSITIONS=550} [2023-01-28 10:28:29,294 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 145 predicate places. [2023-01-28 10:28:29,294 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 550 transitions, 12321 flow [2023-01-28 10:28:29,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:28:29,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:28:29,294 INFO L208 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] [2023-01-28 10:28:29,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-01-28 10:28:29,294 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:28:29,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:28:29,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1032574491, now seen corresponding path program 8 times [2023-01-28 10:28:29,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:28:29,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296340365] [2023-01-28 10:28:29,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:28:29,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:28:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:28:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:28:29,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:28:29,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296340365] [2023-01-28 10:28:29,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296340365] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:28:29,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:28:29,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:28:29,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454336718] [2023-01-28 10:28:29,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:28:29,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:28:29,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:28:29,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:28:29,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:28:29,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:28:29,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 550 transitions, 12321 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:28:29,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:28:29,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:28:29,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:28:34,297 INFO L130 PetriNetUnfolder]: 22334/31675 cut-off events. [2023-01-28 10:28:34,298 INFO L131 PetriNetUnfolder]: For 775607/778609 co-relation queries the response was YES. [2023-01-28 10:28:34,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248094 conditions, 31675 events. 22334/31675 cut-off events. For 775607/778609 co-relation queries the response was YES. Maximal size of possible extension queue 1768. Compared 200690 event pairs, 5780 based on Foata normal form. 2118/32979 useless extension candidates. Maximal degree in co-relation 243421. Up to 16795 conditions per place. [2023-01-28 10:28:34,548 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 370 selfloop transitions, 183 changer transitions 93/692 dead transitions. [2023-01-28 10:28:34,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 692 transitions, 16016 flow [2023-01-28 10:28:34,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:28:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:28:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2023-01-28 10:28:34,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-28 10:28:34,549 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2023-01-28 10:28:34,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2023-01-28 10:28:34,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:28:34,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2023-01-28 10:28:34,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 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) [2023-01-28 10:28:34,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:28:34,550 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:28:34,550 INFO L175 Difference]: Start difference. First operand has 183 places, 550 transitions, 12321 flow. Second operand 5 states and 505 transitions. [2023-01-28 10:28:34,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 692 transitions, 16016 flow [2023-01-28 10:28:38,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 692 transitions, 15511 flow, removed 76 selfloop flow, removed 6 redundant places. [2023-01-28 10:28:38,560 INFO L231 Difference]: Finished difference. Result has 180 places, 550 transitions, 12272 flow [2023-01-28 10:28:38,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11868, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12272, PETRI_PLACES=180, PETRI_TRANSITIONS=550} [2023-01-28 10:28:38,560 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 142 predicate places. [2023-01-28 10:28:38,561 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 550 transitions, 12272 flow [2023-01-28 10:28:38,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:28:38,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:28:38,561 INFO L208 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] [2023-01-28 10:28:38,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-01-28 10:28:38,561 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:28:38,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:28:38,561 INFO L85 PathProgramCache]: Analyzing trace with hash -481538739, now seen corresponding path program 8 times [2023-01-28 10:28:38,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:28:38,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782947156] [2023-01-28 10:28:38,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:28:38,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:28:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:28:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:28:38,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:28:38,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782947156] [2023-01-28 10:28:38,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782947156] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:28:38,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483578390] [2023-01-28 10:28:38,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 10:28:38,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:28:38,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:28:38,597 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:28:38,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-28 10:28:38,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 10:28:38,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:28:38,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 10:28:38,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:28:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:28:38,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:28:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:28:38,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483578390] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:28:38,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:28:38,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 10:28:38,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833615142] [2023-01-28 10:28:38,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:28:38,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 10:28:38,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:28:38,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 10:28:38,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-01-28 10:28:38,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:28:38,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 550 transitions, 12272 flow. Second operand has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 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) [2023-01-28 10:28:38,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:28:38,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:28:38,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:28:43,661 INFO L130 PetriNetUnfolder]: 22923/32314 cut-off events. [2023-01-28 10:28:43,661 INFO L131 PetriNetUnfolder]: For 737438/739982 co-relation queries the response was YES. [2023-01-28 10:28:43,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251696 conditions, 32314 events. 22923/32314 cut-off events. For 737438/739982 co-relation queries the response was YES. Maximal size of possible extension queue 1770. Compared 201711 event pairs, 2880 based on Foata normal form. 1865/33810 useless extension candidates. Maximal degree in co-relation 227485. Up to 14697 conditions per place. [2023-01-28 10:28:43,947 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 497 selfloop transitions, 230 changer transitions 119/881 dead transitions. [2023-01-28 10:28:43,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 881 transitions, 19638 flow [2023-01-28 10:28:43,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 10:28:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 10:28:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 809 transitions. [2023-01-28 10:28:43,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006188118811881 [2023-01-28 10:28:43,948 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 809 transitions. [2023-01-28 10:28:43,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 809 transitions. [2023-01-28 10:28:43,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:28:43,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 809 transitions. [2023-01-28 10:28:43,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.125) internal successors, (809), 8 states have internal predecessors, (809), 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) [2023-01-28 10:28:43,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 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) [2023-01-28 10:28:43,951 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 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) [2023-01-28 10:28:43,951 INFO L175 Difference]: Start difference. First operand has 180 places, 550 transitions, 12272 flow. Second operand 8 states and 809 transitions. [2023-01-28 10:28:43,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 881 transitions, 19638 flow [2023-01-28 10:28:48,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 881 transitions, 19252 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-01-28 10:28:48,644 INFO L231 Difference]: Finished difference. Result has 185 places, 560 transitions, 12698 flow [2023-01-28 10:28:48,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11892, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12698, PETRI_PLACES=185, PETRI_TRANSITIONS=560} [2023-01-28 10:28:48,644 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 147 predicate places. [2023-01-28 10:28:48,645 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 560 transitions, 12698 flow [2023-01-28 10:28:48,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 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) [2023-01-28 10:28:48,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:28:48,645 INFO L208 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] [2023-01-28 10:28:48,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-28 10:28:48,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:28:48,849 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:28:48,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:28:48,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2051744475, now seen corresponding path program 9 times [2023-01-28 10:28:48,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:28:48,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263484264] [2023-01-28 10:28:48,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:28:48,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:28:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:28:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:28:48,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:28:48,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263484264] [2023-01-28 10:28:48,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263484264] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:28:48,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852752808] [2023-01-28 10:28:48,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 10:28:48,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:28:48,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:28:48,930 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:28:48,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-28 10:28:49,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 10:28:49,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:28:49,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 10:28:49,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:28:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:28:49,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:28:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:28:49,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852752808] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:28:49,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:28:49,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 10:28:49,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611359005] [2023-01-28 10:28:49,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:28:49,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 10:28:49,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:28:49,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 10:28:49,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-01-28 10:28:49,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:28:49,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 560 transitions, 12698 flow. Second operand has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 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) [2023-01-28 10:28:49,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:28:49,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:28:49,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:28:53,654 INFO L130 PetriNetUnfolder]: 21401/29770 cut-off events. [2023-01-28 10:28:53,654 INFO L131 PetriNetUnfolder]: For 730383/733737 co-relation queries the response was YES. [2023-01-28 10:28:53,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239539 conditions, 29770 events. 21401/29770 cut-off events. For 730383/733737 co-relation queries the response was YES. Maximal size of possible extension queue 1611. Compared 179571 event pairs, 5378 based on Foata normal form. 2146/31540 useless extension candidates. Maximal degree in co-relation 207874. Up to 16809 conditions per place. [2023-01-28 10:28:53,924 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 441 selfloop transitions, 154 changer transitions 51/679 dead transitions. [2023-01-28 10:28:53,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 679 transitions, 15822 flow [2023-01-28 10:28:53,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:28:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:28:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-01-28 10:28:53,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501980198019802 [2023-01-28 10:28:53,925 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-01-28 10:28:53,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-01-28 10:28:53,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:28:53,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-01-28 10:28:53,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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) [2023-01-28 10:28:53,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:28:53,927 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:28:53,927 INFO L175 Difference]: Start difference. First operand has 185 places, 560 transitions, 12698 flow. Second operand 5 states and 507 transitions. [2023-01-28 10:28:53,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 679 transitions, 15822 flow [2023-01-28 10:28:58,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 679 transitions, 15218 flow, removed 82 selfloop flow, removed 6 redundant places. [2023-01-28 10:28:58,932 INFO L231 Difference]: Finished difference. Result has 183 places, 541 transitions, 12100 flow [2023-01-28 10:28:58,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=12106, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12100, PETRI_PLACES=183, PETRI_TRANSITIONS=541} [2023-01-28 10:28:58,932 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 145 predicate places. [2023-01-28 10:28:58,933 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 541 transitions, 12100 flow [2023-01-28 10:28:58,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 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) [2023-01-28 10:28:58,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:28:58,933 INFO L208 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] [2023-01-28 10:28:58,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-28 10:28:59,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-01-28 10:28:59,138 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:28:59,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:28:59,138 INFO L85 PathProgramCache]: Analyzing trace with hash -210520731, now seen corresponding path program 9 times [2023-01-28 10:28:59,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:28:59,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491238626] [2023-01-28 10:28:59,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:28:59,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:28:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:28:59,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:28:59,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:28:59,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491238626] [2023-01-28 10:28:59,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491238626] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:28:59,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:28:59,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:28:59,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554044390] [2023-01-28 10:28:59,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:28:59,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:28:59,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:28:59,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:28:59,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:28:59,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:28:59,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 541 transitions, 12100 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:28:59,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:28:59,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:28:59,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:29:02,767 INFO L130 PetriNetUnfolder]: 18175/24257 cut-off events. [2023-01-28 10:29:02,767 INFO L131 PetriNetUnfolder]: For 603230/605933 co-relation queries the response was YES. [2023-01-28 10:29:02,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196240 conditions, 24257 events. 18175/24257 cut-off events. For 603230/605933 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 129418 event pairs, 4009 based on Foata normal form. 2024/25529 useless extension candidates. Maximal degree in co-relation 178146. Up to 13332 conditions per place. [2023-01-28 10:29:02,978 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 327 selfloop transitions, 195 changer transitions 61/613 dead transitions. [2023-01-28 10:29:02,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 613 transitions, 14273 flow [2023-01-28 10:29:02,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:29:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:29:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-01-28 10:29:02,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49603960396039604 [2023-01-28 10:29:02,979 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-01-28 10:29:02,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-01-28 10:29:02,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:29:02,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-01-28 10:29:02,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 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) [2023-01-28 10:29:02,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:29:02,980 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:29:02,980 INFO L175 Difference]: Start difference. First operand has 183 places, 541 transitions, 12100 flow. Second operand 5 states and 501 transitions. [2023-01-28 10:29:02,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 613 transitions, 14273 flow [2023-01-28 10:29:06,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 613 transitions, 13631 flow, removed 142 selfloop flow, removed 8 redundant places. [2023-01-28 10:29:06,175 INFO L231 Difference]: Finished difference. Result has 175 places, 509 transitions, 11199 flow [2023-01-28 10:29:06,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11485, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11199, PETRI_PLACES=175, PETRI_TRANSITIONS=509} [2023-01-28 10:29:06,175 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 137 predicate places. [2023-01-28 10:29:06,175 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 509 transitions, 11199 flow [2023-01-28 10:29:06,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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) [2023-01-28 10:29:06,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:29:06,176 INFO L208 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] [2023-01-28 10:29:06,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-01-28 10:29:06,176 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:29:06,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:29:06,176 INFO L85 PathProgramCache]: Analyzing trace with hash -667345164, now seen corresponding path program 1 times [2023-01-28 10:29:06,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:29:06,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038649671] [2023-01-28 10:29:06,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:29:06,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:29:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:29:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:29:06,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:29:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038649671] [2023-01-28 10:29:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038649671] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:29:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117930552] [2023-01-28 10:29:06,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:29:06,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:29:06,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:29:06,229 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:29:06,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-28 10:29:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:29:06,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 10:29:06,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:29:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:29:06,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:29:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:29:06,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117930552] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:29:06,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:29:06,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-01-28 10:29:06,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333398522] [2023-01-28 10:29:06,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:29:06,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 10:29:06,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:29:06,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 10:29:06,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-28 10:29:06,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 10:29:06,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 509 transitions, 11199 flow. Second operand has 8 states, 8 states have (on average 90.0) internal successors, (720), 8 states have internal predecessors, (720), 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) [2023-01-28 10:29:06,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:29:06,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 10:29:06,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:29:09,278 INFO L130 PetriNetUnfolder]: 17052/22257 cut-off events. [2023-01-28 10:29:09,278 INFO L131 PetriNetUnfolder]: For 507950/509893 co-relation queries the response was YES. [2023-01-28 10:29:09,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184120 conditions, 22257 events. 17052/22257 cut-off events. For 507950/509893 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 109890 event pairs, 2012 based on Foata normal form. 998/22714 useless extension candidates. Maximal degree in co-relation 168442. Up to 13528 conditions per place. [2023-01-28 10:29:09,463 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 420 selfloop transitions, 169 changer transitions 1/620 dead transitions. [2023-01-28 10:29:09,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 620 transitions, 14088 flow [2023-01-28 10:29:09,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:29:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:29:09,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-01-28 10:29:09,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49603960396039604 [2023-01-28 10:29:09,464 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-01-28 10:29:09,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-01-28 10:29:09,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:29:09,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-01-28 10:29:09,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 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) [2023-01-28 10:29:09,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:29:09,466 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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) [2023-01-28 10:29:09,466 INFO L175 Difference]: Start difference. First operand has 175 places, 509 transitions, 11199 flow. Second operand 5 states and 501 transitions. [2023-01-28 10:29:09,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 620 transitions, 14088 flow [2023-01-28 10:29:12,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 620 transitions, 12458 flow, removed 172 selfloop flow, removed 22 redundant places. [2023-01-28 10:29:12,168 INFO L231 Difference]: Finished difference. Result has 143 places, 525 transitions, 10573 flow [2023-01-28 10:29:12,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=9715, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10573, PETRI_PLACES=143, PETRI_TRANSITIONS=525} [2023-01-28 10:29:12,168 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 105 predicate places. [2023-01-28 10:29:12,168 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 525 transitions, 10573 flow [2023-01-28 10:29:12,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.0) internal successors, (720), 8 states have internal predecessors, (720), 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) [2023-01-28 10:29:12,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:29:12,168 INFO L208 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] [2023-01-28 10:29:12,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-28 10:29:12,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-01-28 10:29:12,369 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:29:12,369 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:29:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash -65837510, now seen corresponding path program 2 times [2023-01-28 10:29:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:29:12,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16654906] [2023-01-28 10:29:12,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:29:12,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:29:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:29:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:29:12,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:29:12,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16654906] [2023-01-28 10:29:12,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16654906] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:29:12,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862466216] [2023-01-28 10:29:12,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 10:29:12,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:29:12,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:29:12,404 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:29:12,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-28 10:29:12,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 10:29:12,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:29:12,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 10:29:12,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:29:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:29:12,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:29:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:29:12,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862466216] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:29:12,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:29:12,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 10:29:12,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403888450] [2023-01-28 10:29:12,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:29:12,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 10:29:12,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:29:12,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 10:29:12,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-01-28 10:29:12,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 202 [2023-01-28 10:29:12,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 525 transitions, 10573 flow. Second operand has 10 states, 10 states have (on average 87.3) internal successors, (873), 10 states have internal predecessors, (873), 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) [2023-01-28 10:29:12,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:29:12,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 202 [2023-01-28 10:29:12,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:29:15,961 INFO L130 PetriNetUnfolder]: 19775/25806 cut-off events. [2023-01-28 10:29:15,962 INFO L131 PetriNetUnfolder]: For 471967/473084 co-relation queries the response was YES. [2023-01-28 10:29:16,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203310 conditions, 25806 events. 19775/25806 cut-off events. For 471967/473084 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 128460 event pairs, 1201 based on Foata normal form. 865/26315 useless extension candidates. Maximal degree in co-relation 182335. Up to 15510 conditions per place. [2023-01-28 10:29:16,153 INFO L137 encePairwiseOnDemand]: 195/202 looper letters, 443 selfloop transitions, 385 changer transitions 2/842 dead transitions. [2023-01-28 10:29:16,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 842 transitions, 16889 flow [2023-01-28 10:29:16,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-28 10:29:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-01-28 10:29:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1428 transitions. [2023-01-28 10:29:16,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47128712871287126 [2023-01-28 10:29:16,155 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1428 transitions. [2023-01-28 10:29:16,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1428 transitions. [2023-01-28 10:29:16,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:29:16,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1428 transitions. [2023-01-28 10:29:16,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 95.2) internal successors, (1428), 15 states have internal predecessors, (1428), 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) [2023-01-28 10:29:16,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 202.0) internal successors, (3232), 16 states have internal predecessors, (3232), 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) [2023-01-28 10:29:16,158 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 202.0) internal successors, (3232), 16 states have internal predecessors, (3232), 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) [2023-01-28 10:29:16,158 INFO L175 Difference]: Start difference. First operand has 143 places, 525 transitions, 10573 flow. Second operand 15 states and 1428 transitions. [2023-01-28 10:29:16,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 842 transitions, 16889 flow [2023-01-28 10:29:18,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 842 transitions, 16574 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-01-28 10:29:18,532 INFO L231 Difference]: Finished difference. Result has 161 places, 620 transitions, 13397 flow [2023-01-28 10:29:18,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=10319, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=294, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13397, PETRI_PLACES=161, PETRI_TRANSITIONS=620} [2023-01-28 10:29:18,533 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 123 predicate places. [2023-01-28 10:29:18,533 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 620 transitions, 13397 flow [2023-01-28 10:29:18,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.3) internal successors, (873), 10 states have internal predecessors, (873), 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) [2023-01-28 10:29:18,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:29:18,533 INFO L208 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] [2023-01-28 10:29:18,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-28 10:29:18,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-01-28 10:29:18,734 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:29:18,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:29:18,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1053393848, now seen corresponding path program 3 times [2023-01-28 10:29:18,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:29:18,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933802196] [2023-01-28 10:29:18,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:29:18,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:29:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:29:18,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:29:18,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:29:18,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933802196] [2023-01-28 10:29:18,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933802196] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:29:18,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644241054] [2023-01-28 10:29:18,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 10:29:18,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:29:18,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:29:18,768 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:29:18,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-28 10:29:18,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 10:29:18,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:29:18,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 10:29:18,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:29:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:29:18,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:29:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:29:18,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644241054] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:29:18,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:29:18,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 10:29:18,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972391547] [2023-01-28 10:29:18,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:29:18,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 10:29:18,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:29:18,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 10:29:18,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-01-28 10:29:18,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 202 [2023-01-28 10:29:18,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 620 transitions, 13397 flow. Second operand has 10 states, 10 states have (on average 87.2) internal successors, (872), 10 states have internal predecessors, (872), 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) [2023-01-28 10:29:18,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:29:18,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 202 [2023-01-28 10:29:18,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:29:23,514 INFO L130 PetriNetUnfolder]: 24929/32605 cut-off events. [2023-01-28 10:29:23,514 INFO L131 PetriNetUnfolder]: For 612389/612946 co-relation queries the response was YES. [2023-01-28 10:29:23,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264605 conditions, 32605 events. 24929/32605 cut-off events. For 612389/612946 co-relation queries the response was YES. Maximal size of possible extension queue 1431. Compared 167413 event pairs, 1622 based on Foata normal form. 498/32960 useless extension candidates. Maximal degree in co-relation 240253. Up to 19261 conditions per place. [2023-01-28 10:29:23,773 INFO L137 encePairwiseOnDemand]: 194/202 looper letters, 618 selfloop transitions, 358 changer transitions 1/1001 dead transitions. [2023-01-28 10:29:23,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 1001 transitions, 21666 flow [2023-01-28 10:29:23,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 10:29:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 10:29:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1341 transitions. [2023-01-28 10:29:23,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4741867043847242 [2023-01-28 10:29:23,775 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1341 transitions. [2023-01-28 10:29:23,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1341 transitions. [2023-01-28 10:29:23,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:29:23,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1341 transitions. [2023-01-28 10:29:23,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 95.78571428571429) internal successors, (1341), 14 states have internal predecessors, (1341), 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) [2023-01-28 10:29:23,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 202.0) internal successors, (3030), 15 states have internal predecessors, (3030), 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) [2023-01-28 10:29:23,778 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 202.0) internal successors, (3030), 15 states have internal predecessors, (3030), 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) [2023-01-28 10:29:23,778 INFO L175 Difference]: Start difference. First operand has 161 places, 620 transitions, 13397 flow. Second operand 14 states and 1341 transitions. [2023-01-28 10:29:23,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 1001 transitions, 21666 flow [2023-01-28 10:29:28,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 1001 transitions, 19189 flow, removed 283 selfloop flow, removed 10 redundant places. [2023-01-28 10:29:28,232 INFO L231 Difference]: Finished difference. Result has 166 places, 742 transitions, 15014 flow [2023-01-28 10:29:28,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11655, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=235, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=15014, PETRI_PLACES=166, PETRI_TRANSITIONS=742} [2023-01-28 10:29:28,232 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 128 predicate places. [2023-01-28 10:29:28,232 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 742 transitions, 15014 flow [2023-01-28 10:29:28,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.2) internal successors, (872), 10 states have internal predecessors, (872), 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) [2023-01-28 10:29:28,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:29:28,232 INFO L208 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] [2023-01-28 10:29:28,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-01-28 10:29:28,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-01-28 10:29:28,435 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:29:28,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:29:28,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1871381985, now seen corresponding path program 1 times [2023-01-28 10:29:28,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:29:28,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408477983] [2023-01-28 10:29:28,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:29:28,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:29:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:29:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:29:28,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:29:28,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408477983] [2023-01-28 10:29:28,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408477983] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:29:28,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281406991] [2023-01-28 10:29:28,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:29:28,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:29:28,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:29:28,541 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:29:28,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-01-28 10:29:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:29:28,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 17 conjunts are in the unsatisfiable core [2023-01-28 10:29:28,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:29:28,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:29:28,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:29:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:29:28,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281406991] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:29:28,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:29:28,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 7 [2023-01-28 10:29:28,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722624780] [2023-01-28 10:29:28,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:29:28,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 10:29:28,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:29:28,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 10:29:28,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-01-28 10:29:28,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 202 [2023-01-28 10:29:28,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 742 transitions, 15014 flow. Second operand has 9 states, 9 states have (on average 104.66666666666667) internal successors, (942), 9 states have internal predecessors, (942), 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) [2023-01-28 10:29:28,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:29:28,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 202 [2023-01-28 10:29:28,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:29:36,543 INFO L130 PetriNetUnfolder]: 40667/54062 cut-off events. [2023-01-28 10:29:36,543 INFO L131 PetriNetUnfolder]: For 970693/986750 co-relation queries the response was YES. [2023-01-28 10:29:36,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412629 conditions, 54062 events. 40667/54062 cut-off events. For 970693/986750 co-relation queries the response was YES. Maximal size of possible extension queue 2511. Compared 315673 event pairs, 3619 based on Foata normal form. 8820/60831 useless extension candidates. Maximal degree in co-relation 380576. Up to 32297 conditions per place. [2023-01-28 10:29:37,086 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 482 selfloop transitions, 559 changer transitions 5/1125 dead transitions. [2023-01-28 10:29:37,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 1125 transitions, 23116 flow [2023-01-28 10:29:37,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 10:29:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 10:29:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1057 transitions. [2023-01-28 10:29:37,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5814081408140814 [2023-01-28 10:29:37,088 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1057 transitions. [2023-01-28 10:29:37,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1057 transitions. [2023-01-28 10:29:37,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:29:37,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1057 transitions. [2023-01-28 10:29:37,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.44444444444444) internal successors, (1057), 9 states have internal predecessors, (1057), 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) [2023-01-28 10:29:37,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 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) [2023-01-28 10:29:37,090 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 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) [2023-01-28 10:29:37,090 INFO L175 Difference]: Start difference. First operand has 166 places, 742 transitions, 15014 flow. Second operand 9 states and 1057 transitions. [2023-01-28 10:29:37,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 1125 transitions, 23116 flow [2023-01-28 10:29:42,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 1125 transitions, 21178 flow, removed 438 selfloop flow, removed 11 redundant places. [2023-01-28 10:29:42,211 INFO L231 Difference]: Finished difference. Result has 165 places, 1005 transitions, 21197 flow [2023-01-28 10:29:42,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=9252, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=21197, PETRI_PLACES=165, PETRI_TRANSITIONS=1005} [2023-01-28 10:29:42,211 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 127 predicate places. [2023-01-28 10:29:42,211 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 1005 transitions, 21197 flow [2023-01-28 10:29:42,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 104.66666666666667) internal successors, (942), 9 states have internal predecessors, (942), 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) [2023-01-28 10:29:42,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:29:42,212 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:29:42,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-01-28 10:29:42,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:29:42,415 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:29:42,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:29:42,415 INFO L85 PathProgramCache]: Analyzing trace with hash 787534766, now seen corresponding path program 2 times [2023-01-28 10:29:42,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:29:42,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440096648] [2023-01-28 10:29:42,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:29:42,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:29:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:29:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:29:42,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:29:42,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440096648] [2023-01-28 10:29:42,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440096648] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:29:42,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031981567] [2023-01-28 10:29:42,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 10:29:42,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:29:42,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:29:42,467 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:29:42,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-01-28 10:29:42,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 10:29:42,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:29:42,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 10:29:42,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:29:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:29:42,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:29:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:29:42,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031981567] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:29:42,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:29:42,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-01-28 10:29:42,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221606469] [2023-01-28 10:29:42,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:29:42,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 10:29:42,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:29:42,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 10:29:42,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-01-28 10:29:42,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 202 [2023-01-28 10:29:42,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 1005 transitions, 21197 flow. Second operand has 12 states, 12 states have (on average 87.5) internal successors, (1050), 12 states have internal predecessors, (1050), 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) [2023-01-28 10:29:42,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:29:42,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 202 [2023-01-28 10:29:42,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:29:59,169 INFO L130 PetriNetUnfolder]: 78598/104797 cut-off events. [2023-01-28 10:29:59,169 INFO L131 PetriNetUnfolder]: For 1577870/1578845 co-relation queries the response was YES. [2023-01-28 10:29:59,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783151 conditions, 104797 events. 78598/104797 cut-off events. For 1577870/1578845 co-relation queries the response was YES. Maximal size of possible extension queue 4020. Compared 643365 event pairs, 11791 based on Foata normal form. 3039/107475 useless extension candidates. Maximal degree in co-relation 768271. Up to 57556 conditions per place. [2023-01-28 10:30:00,435 INFO L137 encePairwiseOnDemand]: 194/202 looper letters, 1521 selfloop transitions, 456 changer transitions 0/1997 dead transitions. [2023-01-28 10:30:00,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1997 transitions, 42747 flow [2023-01-28 10:30:00,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-28 10:30:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-28 10:30:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1265 transitions. [2023-01-28 10:30:00,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48172124904798175 [2023-01-28 10:30:00,437 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1265 transitions. [2023-01-28 10:30:00,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1265 transitions. [2023-01-28 10:30:00,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:30:00,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1265 transitions. [2023-01-28 10:30:00,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.3076923076923) internal successors, (1265), 13 states have internal predecessors, (1265), 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) [2023-01-28 10:30:00,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 202.0) internal successors, (2828), 14 states have internal predecessors, (2828), 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) [2023-01-28 10:30:00,440 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 202.0) internal successors, (2828), 14 states have internal predecessors, (2828), 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) [2023-01-28 10:30:00,440 INFO L175 Difference]: Start difference. First operand has 165 places, 1005 transitions, 21197 flow. Second operand 13 states and 1265 transitions. [2023-01-28 10:30:00,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 1997 transitions, 42747 flow [2023-01-28 10:30:50,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 1997 transitions, 40401 flow, removed 1173 selfloop flow, removed 0 redundant places. [2023-01-28 10:30:50,633 INFO L231 Difference]: Finished difference. Result has 187 places, 1278 transitions, 27482 flow [2023-01-28 10:30:50,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=20057, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1005, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=27482, PETRI_PLACES=187, PETRI_TRANSITIONS=1278} [2023-01-28 10:30:50,634 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 149 predicate places. [2023-01-28 10:30:50,634 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 1278 transitions, 27482 flow [2023-01-28 10:30:50,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.5) internal successors, (1050), 12 states have internal predecessors, (1050), 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) [2023-01-28 10:30:50,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:30:50,634 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:30:50,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-01-28 10:30:50,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-01-28 10:30:50,835 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:30:50,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:30:50,835 INFO L85 PathProgramCache]: Analyzing trace with hash -926111482, now seen corresponding path program 3 times [2023-01-28 10:30:50,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:30:50,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403628785] [2023-01-28 10:30:50,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:30:50,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:30:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:30:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:30:50,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:30:50,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403628785] [2023-01-28 10:30:50,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403628785] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:30:50,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612424753] [2023-01-28 10:30:50,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 10:30:50,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:30:50,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:30:50,891 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:30:50,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-01-28 10:30:50,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-28 10:30:50,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:30:50,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 10:30:50,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:30:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:30:51,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:30:51,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:30:51,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612424753] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:30:51,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:30:51,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-01-28 10:30:51,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890720877] [2023-01-28 10:30:51,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:30:51,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 10:30:51,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:30:51,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 10:30:51,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-01-28 10:30:51,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 202 [2023-01-28 10:30:51,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 1278 transitions, 27482 flow. Second operand has 14 states, 14 states have (on average 86.5) internal successors, (1211), 14 states have internal predecessors, (1211), 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) [2023-01-28 10:30:51,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:30:51,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 202 [2023-01-28 10:30:51,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand