./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65bf47faf943da19c0d2d15e35f35ceed9dd68ed50ac4355a0589bd57bf3d155 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 20:13:54,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 20:13:54,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 20:13:54,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 20:13:54,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 20:13:54,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 20:13:54,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 20:13:54,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 20:13:54,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 20:13:54,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 20:13:54,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 20:13:54,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 20:13:54,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 20:13:54,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 20:13:54,711 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 20:13:54,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 20:13:54,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 20:13:54,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 20:13:54,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 20:13:54,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 20:13:54,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 20:13:54,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 20:13:54,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 20:13:54,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 20:13:54,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 20:13:54,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 20:13:54,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 20:13:54,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 20:13:54,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 20:13:54,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 20:13:54,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 20:13:54,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 20:13:54,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 20:13:54,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 20:13:54,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 20:13:54,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 20:13:54,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 20:13:54,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 20:13:54,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 20:13:54,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 20:13:54,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 20:13:54,746 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 20:13:54,786 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 20:13:54,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 20:13:54,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 20:13:54,787 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 20:13:54,788 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 20:13:54,788 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 20:13:54,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 20:13:54,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 20:13:54,789 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 20:13:54,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 20:13:54,790 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 20:13:54,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 20:13:54,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 20:13:54,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 20:13:54,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 20:13:54,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 20:13:54,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 20:13:54,791 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 20:13:54,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 20:13:54,792 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 20:13:54,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 20:13:54,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 20:13:54,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 20:13:54,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 20:13:54,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 20:13:54,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 20:13:54,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 20:13:54,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 20:13:54,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 20:13:54,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 20:13:54,794 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 20:13:54,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 20:13:54,795 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 20:13:54,795 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 20:13:54,795 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 20:13:54,795 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65bf47faf943da19c0d2d15e35f35ceed9dd68ed50ac4355a0589bd57bf3d155 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-08-30 20:13:55,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 20:13:55,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 20:13:55,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 20:13:55,112 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 20:13:55,113 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 20:13:55,114 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-08-30 20:13:56,229 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 20:13:56,409 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 20:13:56,410 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-08-30 20:13:56,414 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eb9b8b4c/869786be47194bbe89d5a10ff11105aa/FLAG12e040eca [2023-08-30 20:13:56,425 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eb9b8b4c/869786be47194bbe89d5a10ff11105aa [2023-08-30 20:13:56,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 20:13:56,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 20:13:56,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 20:13:56,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 20:13:56,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 20:13:56,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:13:56" (1/1) ... [2023-08-30 20:13:56,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab8ccbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:13:56, skipping insertion in model container [2023-08-30 20:13:56,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:13:56" (1/1) ... [2023-08-30 20:13:56,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 20:13:56,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 20:13:56,652 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-08-30 20:13:56,658 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 20:13:56,668 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 20:13:56,703 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-08-30 20:13:56,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 20:13:56,713 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 20:13:56,714 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 20:13:56,720 INFO L208 MainTranslator]: Completed translation [2023-08-30 20:13:56,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:13:56 WrapperNode [2023-08-30 20:13:56,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 20:13:56,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 20:13:56,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 20:13:56,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 20:13:56,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:13:56" (1/1) ... [2023-08-30 20:13:56,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:13:56" (1/1) ... [2023-08-30 20:13:56,773 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2023-08-30 20:13:56,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 20:13:56,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 20:13:56,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 20:13:56,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 20:13:56,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:13:56" (1/1) ... [2023-08-30 20:13:56,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:13:56" (1/1) ... [2023-08-30 20:13:56,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:13:56" (1/1) ... [2023-08-30 20:13:56,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:13:56" (1/1) ... [2023-08-30 20:13:56,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:13:56" (1/1) ... [2023-08-30 20:13:56,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:13:56" (1/1) ... [2023-08-30 20:13:56,814 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:13:56" (1/1) ... [2023-08-30 20:13:56,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:13:56" (1/1) ... [2023-08-30 20:13:56,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 20:13:56,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 20:13:56,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 20:13:56,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 20:13:56,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:13:56" (1/1) ... [2023-08-30 20:13:56,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 20:13:56,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:13:56,854 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-08-30 20:13:56,880 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-08-30 20:13:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 20:13:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 20:13:56,897 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 20:13:56,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 20:13:56,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 20:13:56,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 20:13:56,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 20:13:56,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-30 20:13:56,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-30 20:13:56,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 20:13:56,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 20:13:56,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 20:13:56,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 20:13:56,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 20:13:56,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 20:13:56,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 20:13:56,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 20:13:56,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 20:13:56,901 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 20:13:57,007 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 20:13:57,009 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 20:13:57,271 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 20:13:57,315 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 20:13:57,316 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-30 20:13:57,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:13:57 BoogieIcfgContainer [2023-08-30 20:13:57,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 20:13:57,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 20:13:57,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 20:13:57,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 20:13:57,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 08:13:56" (1/3) ... [2023-08-30 20:13:57,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdc6dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:13:57, skipping insertion in model container [2023-08-30 20:13:57,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:13:56" (2/3) ... [2023-08-30 20:13:57,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdc6dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:13:57, skipping insertion in model container [2023-08-30 20:13:57,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:13:57" (3/3) ... [2023-08-30 20:13:57,339 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2023-08-30 20:13:57,346 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 20:13:57,362 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 20:13:57,362 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-30 20:13:57,362 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 20:13:57,442 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-30 20:13:57,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 120 transitions, 272 flow [2023-08-30 20:13:57,537 INFO L130 PetriNetUnfolder]: 9/116 cut-off events. [2023-08-30 20:13:57,538 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 20:13:57,545 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-08-30 20:13:57,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 120 transitions, 272 flow [2023-08-30 20:13:57,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 104 transitions, 232 flow [2023-08-30 20:13:57,551 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 20:13:57,559 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 104 transitions, 232 flow [2023-08-30 20:13:57,561 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 104 transitions, 232 flow [2023-08-30 20:13:57,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 104 transitions, 232 flow [2023-08-30 20:13:57,586 INFO L130 PetriNetUnfolder]: 9/104 cut-off events. [2023-08-30 20:13:57,587 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 20:13:57,588 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-08-30 20:13:57,589 INFO L119 LiptonReduction]: Number of co-enabled transitions 2520 [2023-08-30 20:14:00,265 INFO L134 LiptonReduction]: Checked pairs total: 2606 [2023-08-30 20:14:00,265 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-08-30 20:14:00,278 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 20:14:00,283 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=true, 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;@521efec4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 20:14:00,283 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 20:14:00,290 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2023-08-30 20:14:00,290 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 20:14:00,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:00,291 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-08-30 20:14:00,292 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-08-30 20:14:00,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:00,296 INFO L85 PathProgramCache]: Analyzing trace with hash -475984634, now seen corresponding path program 1 times [2023-08-30 20:14:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:00,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651876858] [2023-08-30 20:14:00,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:00,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:00,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:00,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651876858] [2023-08-30 20:14:00,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651876858] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:14:00,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:14:00,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 20:14:00,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597391842] [2023-08-30 20:14:00,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:14:00,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 20:14:00,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:00,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 20:14:00,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 20:14:00,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 202 [2023-08-30 20:14:00,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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-08-30 20:14:00,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:00,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 202 [2023-08-30 20:14:00,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:01,196 INFO L130 PetriNetUnfolder]: 1537/1954 cut-off events. [2023-08-30 20:14:01,197 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2023-08-30 20:14:01,202 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-08-30 20:14:01,213 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 41 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2023-08-30 20:14:01,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 241 flow [2023-08-30 20:14:01,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 20:14:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 20:14:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-30 20:14:01,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5742574257425742 [2023-08-30 20:14:01,234 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-30 20:14:01,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-30 20:14:01,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:01,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-30 20:14:01,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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-08-30 20:14:01,249 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-08-30 20:14:01,249 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-08-30 20:14:01,251 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 82 flow. Second operand 3 states and 348 transitions. [2023-08-30 20:14:01,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 241 flow [2023-08-30 20:14:01,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 51 transitions, 211 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-30 20:14:01,259 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 99 flow [2023-08-30 20:14:01,261 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-08-30 20:14:01,266 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2023-08-30 20:14:01,266 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 99 flow [2023-08-30 20:14:01,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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-08-30 20:14:01,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:01,270 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-08-30 20:14:01,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 20:14:01,271 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-08-30 20:14:01,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:01,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2131273016, now seen corresponding path program 1 times [2023-08-30 20:14:01,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:01,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558878218] [2023-08-30 20:14:01,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:01,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:01,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:01,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558878218] [2023-08-30 20:14:01,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558878218] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:14:01,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:14:01,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:14:01,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026338992] [2023-08-30 20:14:01,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:14:01,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:14:01,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:01,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:14:01,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:14:01,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 202 [2023-08-30 20:14:01,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-08-30 20:14:01,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:01,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 202 [2023-08-30 20:14:01,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:01,841 INFO L130 PetriNetUnfolder]: 2645/3467 cut-off events. [2023-08-30 20:14:01,842 INFO L131 PetriNetUnfolder]: For 1092/1092 co-relation queries the response was YES. [2023-08-30 20:14:01,845 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-08-30 20:14:01,859 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 86 selfloop transitions, 5 changer transitions 0/93 dead transitions. [2023-08-30 20:14:01,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 93 transitions, 461 flow [2023-08-30 20:14:01,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:14:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:14:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2023-08-30 20:14:01,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5445544554455446 [2023-08-30 20:14:01,862 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 550 transitions. [2023-08-30 20:14:01,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 550 transitions. [2023-08-30 20:14:01,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:01,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 550 transitions. [2023-08-30 20:14:01,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 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-08-30 20:14:01,866 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-08-30 20:14:01,867 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-08-30 20:14:01,867 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 99 flow. Second operand 5 states and 550 transitions. [2023-08-30 20:14:01,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 93 transitions, 461 flow [2023-08-30 20:14:01,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 93 transitions, 448 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 20:14:01,870 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 129 flow [2023-08-30 20:14:01,871 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-08-30 20:14:01,871 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2023-08-30 20:14:01,871 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 129 flow [2023-08-30 20:14:01,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-08-30 20:14:01,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:01,872 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-08-30 20:14:01,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 20:14:01,873 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-08-30 20:14:01,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:01,873 INFO L85 PathProgramCache]: Analyzing trace with hash 134921043, now seen corresponding path program 1 times [2023-08-30 20:14:01,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:01,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817093471] [2023-08-30 20:14:01,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:01,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:01,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:01,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817093471] [2023-08-30 20:14:01,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817093471] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:14:01,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001092711] [2023-08-30 20:14:01,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:01,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:14:01,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:14:01,957 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-08-30 20:14:01,987 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-08-30 20:14:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:02,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 20:14:02,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:14:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:02,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:14:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:02,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001092711] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:14:02,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:14:02,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-30 20:14:02,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031539321] [2023-08-30 20:14:02,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:14:02,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 20:14:02,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:02,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 20:14:02,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 20:14:02,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-30 20:14:02,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 129 flow. Second operand has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 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-08-30 20:14:02,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:02,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-30 20:14:02,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:02,769 INFO L130 PetriNetUnfolder]: 3569/4785 cut-off events. [2023-08-30 20:14:02,769 INFO L131 PetriNetUnfolder]: For 3429/3842 co-relation queries the response was YES. [2023-08-30 20:14:02,774 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-08-30 20:14:02,810 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 87 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2023-08-30 20:14:02,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 95 transitions, 523 flow [2023-08-30 20:14:02,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:14:02,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:14:02,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2023-08-30 20:14:02,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5326732673267327 [2023-08-30 20:14:02,813 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2023-08-30 20:14:02,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2023-08-30 20:14:02,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:02,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2023-08-30 20:14:02,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 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-08-30 20:14:02,816 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-08-30 20:14:02,817 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-08-30 20:14:02,817 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 129 flow. Second operand 5 states and 538 transitions. [2023-08-30 20:14:02,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 95 transitions, 523 flow [2023-08-30 20:14:02,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 95 transitions, 504 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 20:14:02,825 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 159 flow [2023-08-30 20:14:02,825 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-08-30 20:14:02,826 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2023-08-30 20:14:02,826 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 159 flow [2023-08-30 20:14:02,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 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-08-30 20:14:02,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:02,827 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-08-30 20:14:02,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 20:14:03,033 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-08-30 20:14:03,034 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-08-30 20:14:03,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:03,034 INFO L85 PathProgramCache]: Analyzing trace with hash -950453983, now seen corresponding path program 1 times [2023-08-30 20:14:03,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:03,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007610876] [2023-08-30 20:14:03,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:03,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:03,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:03,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:03,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007610876] [2023-08-30 20:14:03,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007610876] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:14:03,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753926979] [2023-08-30 20:14:03,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:03,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:14:03,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:14:03,124 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-08-30 20:14:03,129 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-08-30 20:14:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:03,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 20:14:03,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:14:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:03,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:14:03,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:03,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753926979] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:14:03,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:14:03,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-30 20:14:03,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203030396] [2023-08-30 20:14:03,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:14:03,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 20:14:03,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:03,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 20:14:03,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 20:14:03,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-30 20:14:03,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 159 flow. Second operand has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 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-08-30 20:14:03,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:03,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-30 20:14:03,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:03,899 INFO L130 PetriNetUnfolder]: 3913/5227 cut-off events. [2023-08-30 20:14:03,899 INFO L131 PetriNetUnfolder]: For 6362/6627 co-relation queries the response was YES. [2023-08-30 20:14:03,935 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-08-30 20:14:03,963 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 90 selfloop transitions, 7 changer transitions 0/100 dead transitions. [2023-08-30 20:14:03,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 100 transitions, 596 flow [2023-08-30 20:14:03,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:14:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:14:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2023-08-30 20:14:03,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5346534653465347 [2023-08-30 20:14:03,965 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 540 transitions. [2023-08-30 20:14:03,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 540 transitions. [2023-08-30 20:14:03,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:03,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 540 transitions. [2023-08-30 20:14:03,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 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-08-30 20:14:03,969 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-08-30 20:14:03,969 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-08-30 20:14:03,970 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 159 flow. Second operand 5 states and 540 transitions. [2023-08-30 20:14:03,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 100 transitions, 596 flow [2023-08-30 20:14:03,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 100 transitions, 587 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-30 20:14:03,982 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 212 flow [2023-08-30 20:14:03,982 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-08-30 20:14:03,983 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2023-08-30 20:14:03,983 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 212 flow [2023-08-30 20:14:03,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 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-08-30 20:14:03,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:03,984 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-08-30 20:14:03,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-30 20:14:04,189 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-08-30 20:14:04,190 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-08-30 20:14:04,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:04,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1864400695, now seen corresponding path program 2 times [2023-08-30 20:14:04,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:04,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779020343] [2023-08-30 20:14:04,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:04,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:04,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-08-30 20:14:04,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:04,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779020343] [2023-08-30 20:14:04,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779020343] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:14:04,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:14:04,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:14:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863630381] [2023-08-30 20:14:04,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:14:04,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:14:04,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:04,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:14:04,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:14:04,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 202 [2023-08-30 20:14:04,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-08-30 20:14:04,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:04,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 202 [2023-08-30 20:14:04,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:05,006 INFO L130 PetriNetUnfolder]: 5551/7498 cut-off events. [2023-08-30 20:14:05,007 INFO L131 PetriNetUnfolder]: For 14127/14505 co-relation queries the response was YES. [2023-08-30 20:14:05,018 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-08-30 20:14:05,050 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 94 selfloop transitions, 11 changer transitions 0/108 dead transitions. [2023-08-30 20:14:05,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 108 transitions, 703 flow [2023-08-30 20:14:05,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:14:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:14:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2023-08-30 20:14:05,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5425742574257426 [2023-08-30 20:14:05,053 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 548 transitions. [2023-08-30 20:14:05,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 548 transitions. [2023-08-30 20:14:05,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:05,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 548 transitions. [2023-08-30 20:14:05,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 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-08-30 20:14:05,056 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-08-30 20:14:05,057 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-08-30 20:14:05,057 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 212 flow. Second operand 5 states and 548 transitions. [2023-08-30 20:14:05,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 108 transitions, 703 flow [2023-08-30 20:14:05,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 689 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 20:14:05,073 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 269 flow [2023-08-30 20:14:05,073 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-08-30 20:14:05,074 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2023-08-30 20:14:05,074 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 269 flow [2023-08-30 20:14:05,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-08-30 20:14:05,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:05,075 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-08-30 20:14:05,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 20:14:05,075 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-08-30 20:14:05,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:05,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1282882796, now seen corresponding path program 2 times [2023-08-30 20:14:05,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:05,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303761147] [2023-08-30 20:14:05,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:05,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:05,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:05,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303761147] [2023-08-30 20:14:05,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303761147] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:14:05,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:14:05,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:14:05,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549901315] [2023-08-30 20:14:05,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:14:05,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:14:05,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:05,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:14:05,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:14:05,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 202 [2023-08-30 20:14:05,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 269 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-08-30 20:14:05,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:05,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 202 [2023-08-30 20:14:05,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:05,843 INFO L130 PetriNetUnfolder]: 5671/7868 cut-off events. [2023-08-30 20:14:05,844 INFO L131 PetriNetUnfolder]: For 25451/26949 co-relation queries the response was YES. [2023-08-30 20:14:05,856 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-08-30 20:14:05,888 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 108 selfloop transitions, 6 changer transitions 0/120 dead transitions. [2023-08-30 20:14:05,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 120 transitions, 891 flow [2023-08-30 20:14:05,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:14:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:14:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2023-08-30 20:14:05,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5425742574257426 [2023-08-30 20:14:05,891 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 548 transitions. [2023-08-30 20:14:05,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 548 transitions. [2023-08-30 20:14:05,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:05,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 548 transitions. [2023-08-30 20:14:05,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 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-08-30 20:14:05,894 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-08-30 20:14:05,895 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-08-30 20:14:05,895 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 269 flow. Second operand 5 states and 548 transitions. [2023-08-30 20:14:05,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 120 transitions, 891 flow [2023-08-30 20:14:05,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 120 transitions, 825 flow, removed 24 selfloop flow, removed 1 redundant places. [2023-08-30 20:14:05,913 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 291 flow [2023-08-30 20:14:05,913 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-08-30 20:14:05,914 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2023-08-30 20:14:05,914 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 291 flow [2023-08-30 20:14:05,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-08-30 20:14:05,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:05,915 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-08-30 20:14:05,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 20:14:05,915 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-08-30 20:14:05,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:05,916 INFO L85 PathProgramCache]: Analyzing trace with hash -786111875, now seen corresponding path program 3 times [2023-08-30 20:14:05,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:05,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584083789] [2023-08-30 20:14:05,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:05,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:05,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:05,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584083789] [2023-08-30 20:14:05,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584083789] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:14:05,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264677478] [2023-08-30 20:14:05,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 20:14:05,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:14:05,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:14:05,985 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-08-30 20:14:06,008 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-08-30 20:14:06,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 20:14:06,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:14:06,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 20:14:06,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:14:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:06,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:14:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:06,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264677478] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:14:06,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:14:06,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 20:14:06,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308296668] [2023-08-30 20:14:06,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:14:06,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 20:14:06,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:06,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 20:14:06,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 20:14:06,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-30 20:14:06,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 291 flow. Second operand has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 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-08-30 20:14:06,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:06,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-30 20:14:06,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:07,424 INFO L130 PetriNetUnfolder]: 8386/11509 cut-off events. [2023-08-30 20:14:07,425 INFO L131 PetriNetUnfolder]: For 32012/33129 co-relation queries the response was YES. [2023-08-30 20:14:07,449 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-08-30 20:14:07,490 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 152 selfloop transitions, 20 changer transitions 0/177 dead transitions. [2023-08-30 20:14:07,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 177 transitions, 1265 flow [2023-08-30 20:14:07,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 20:14:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 20:14:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 867 transitions. [2023-08-30 20:14:07,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.536509900990099 [2023-08-30 20:14:07,494 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 867 transitions. [2023-08-30 20:14:07,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 867 transitions. [2023-08-30 20:14:07,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:07,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 867 transitions. [2023-08-30 20:14:07,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.375) internal successors, (867), 8 states have internal predecessors, (867), 0 states have call successors, (0), 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-08-30 20:14:07,498 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-08-30 20:14:07,499 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-08-30 20:14:07,499 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 291 flow. Second operand 8 states and 867 transitions. [2023-08-30 20:14:07,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 177 transitions, 1265 flow [2023-08-30 20:14:07,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 177 transitions, 1223 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-30 20:14:07,537 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 466 flow [2023-08-30 20:14:07,537 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-08-30 20:14:07,537 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 32 predicate places. [2023-08-30 20:14:07,538 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 466 flow [2023-08-30 20:14:07,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 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-08-30 20:14:07,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:07,538 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-08-30 20:14:07,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-30 20:14:07,744 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-08-30 20:14:07,744 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-08-30 20:14:07,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:07,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1812859993, now seen corresponding path program 4 times [2023-08-30 20:14:07,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:07,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633498428] [2023-08-30 20:14:07,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:07,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:07,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:07,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633498428] [2023-08-30 20:14:07,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633498428] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:14:07,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:14:07,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:14:07,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922688619] [2023-08-30 20:14:07,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:14:07,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:14:07,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:07,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:14:07,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:14:07,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 20:14:07,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 466 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:14:07,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:07,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 20:14:07,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:08,777 INFO L130 PetriNetUnfolder]: 10374/14611 cut-off events. [2023-08-30 20:14:08,778 INFO L131 PetriNetUnfolder]: For 59618/61272 co-relation queries the response was YES. [2023-08-30 20:14:08,812 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-08-30 20:14:08,866 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 137 selfloop transitions, 17 changer transitions 0/164 dead transitions. [2023-08-30 20:14:08,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 164 transitions, 1364 flow [2023-08-30 20:14:08,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 20:14:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 20:14:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 657 transitions. [2023-08-30 20:14:08,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5420792079207921 [2023-08-30 20:14:08,868 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 657 transitions. [2023-08-30 20:14:08,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 657 transitions. [2023-08-30 20:14:08,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:08,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 657 transitions. [2023-08-30 20:14:08,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 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-08-30 20:14:08,873 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-08-30 20:14:08,874 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-08-30 20:14:08,874 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 466 flow. Second operand 6 states and 657 transitions. [2023-08-30 20:14:08,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 164 transitions, 1364 flow [2023-08-30 20:14:09,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 164 transitions, 1326 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-30 20:14:09,075 INFO L231 Difference]: Finished difference. Result has 74 places, 72 transitions, 576 flow [2023-08-30 20:14:09,075 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-08-30 20:14:09,084 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2023-08-30 20:14:09,084 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 72 transitions, 576 flow [2023-08-30 20:14:09,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:14:09,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:09,085 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-08-30 20:14:09,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 20:14:09,086 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-08-30 20:14:09,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:09,086 INFO L85 PathProgramCache]: Analyzing trace with hash -2097457269, now seen corresponding path program 5 times [2023-08-30 20:14:09,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:09,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859853690] [2023-08-30 20:14:09,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:09,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:09,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:09,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859853690] [2023-08-30 20:14:09,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859853690] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:14:09,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:14:09,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:14:09,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701821049] [2023-08-30 20:14:09,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:14:09,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:14:09,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:09,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:14:09,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:14:09,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 202 [2023-08-30 20:14:09,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 72 transitions, 576 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-08-30 20:14:09,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:09,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 202 [2023-08-30 20:14:09,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:10,309 INFO L130 PetriNetUnfolder]: 11079/15861 cut-off events. [2023-08-30 20:14:10,310 INFO L131 PetriNetUnfolder]: For 70431/72335 co-relation queries the response was YES. [2023-08-30 20:14:10,347 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-08-30 20:14:10,389 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 141 selfloop transitions, 11 changer transitions 0/162 dead transitions. [2023-08-30 20:14:10,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 162 transitions, 1461 flow [2023-08-30 20:14:10,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:14:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:14:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2023-08-30 20:14:10,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5465346534653466 [2023-08-30 20:14:10,391 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 552 transitions. [2023-08-30 20:14:10,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 552 transitions. [2023-08-30 20:14:10,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:10,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 552 transitions. [2023-08-30 20:14:10,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 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-08-30 20:14:10,395 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-08-30 20:14:10,395 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-08-30 20:14:10,395 INFO L175 Difference]: Start difference. First operand has 74 places, 72 transitions, 576 flow. Second operand 5 states and 552 transitions. [2023-08-30 20:14:10,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 162 transitions, 1461 flow [2023-08-30 20:14:10,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 162 transitions, 1461 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 20:14:10,514 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 638 flow [2023-08-30 20:14:10,514 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-08-30 20:14:10,515 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2023-08-30 20:14:10,515 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 638 flow [2023-08-30 20:14:10,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-08-30 20:14:10,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:10,516 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-08-30 20:14:10,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 20:14:10,516 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-08-30 20:14:10,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1571815567, now seen corresponding path program 6 times [2023-08-30 20:14:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:10,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785320612] [2023-08-30 20:14:10,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:10,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:10,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:10,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785320612] [2023-08-30 20:14:10,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785320612] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:14:10,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368315723] [2023-08-30 20:14:10,574 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 20:14:10,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:14:10,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:14:10,577 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-08-30 20:14:10,602 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-08-30 20:14:10,670 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-30 20:14:10,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:14:10,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 20:14:10,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:14:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:10,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:14:10,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-08-30 20:14:10,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368315723] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:14:10,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:14:10,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 20:14:10,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667008081] [2023-08-30 20:14:10,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:14:10,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 20:14:10,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:10,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 20:14:10,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-30 20:14:10,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-30 20:14:10,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 638 flow. Second operand has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 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-08-30 20:14:10,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:10,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-30 20:14:10,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:11,216 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-08-30 20:14:11,216 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 20:14:11,216 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 20:14:11,216 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 20:14:11,216 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 20:14:11,220 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-08-30 20:14:11,220 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 20:14:11,220 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 20:14:11,220 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 20:14:11,220 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 20:14:11,308 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-08-30 20:14:11,309 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,309 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,309 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 20:14:11,309 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 20:14:11,310 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-08-30 20:14:11,311 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,311 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 20:14:11,311 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 20:14:11,311 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,318 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-08-30 20:14:11,318 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,318 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 20:14:11,318 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,318 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 20:14:11,319 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-08-30 20:14:11,319 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,319 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 20:14:11,319 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,319 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 20:14:11,320 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-08-30 20:14:11,320 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,320 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,320 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 20:14:11,320 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 20:14:11,469 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-08-30 20:14:11,469 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,469 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,470 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,470 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,470 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-08-30 20:14:11,470 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,471 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,471 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,471 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,473 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-08-30 20:14:11,473 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,473 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,473 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,473 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,481 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-08-30 20:14:11,481 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,481 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,481 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,481 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,482 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-08-30 20:14:11,482 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,482 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,482 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,482 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,483 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-08-30 20:14:11,483 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,483 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,483 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,483 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,484 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-08-30 20:14:11,484 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,484 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,485 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,485 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:11,615 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-08-30 20:14:11,616 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,616 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,616 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,616 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,617 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-08-30 20:14:11,617 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,617 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,617 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,617 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,619 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-08-30 20:14:11,619 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,619 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,619 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,619 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,621 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-08-30 20:14:11,621 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,621 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,621 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,621 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,630 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-08-30 20:14:11,630 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,630 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,630 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,630 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,631 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-08-30 20:14:11,631 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,631 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,631 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,631 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:11,725 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-08-30 20:14:11,725 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 20:14:11,725 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 20:14:11,725 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,725 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,726 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-08-30 20:14:11,726 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 20:14:11,726 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,726 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 20:14:11,727 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,728 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-08-30 20:14:11,728 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 20:14:11,728 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,728 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 20:14:11,728 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,734 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-08-30 20:14:11,735 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 20:14:11,735 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 20:14:11,735 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,735 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:11,801 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-08-30 20:14:11,802 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 20:14:11,802 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 20:14:11,802 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 20:14:11,802 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 20:14:11,802 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-08-30 20:14:11,803 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 20:14:11,803 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 20:14:11,803 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 20:14:11,803 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 20:14:11,807 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-08-30 20:14:11,807 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 20:14:11,807 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 20:14:11,808 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 20:14:11,808 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 20:14:11,862 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-08-30 20:14:11,862 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 20:14:11,862 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 20:14:11,862 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 20:14:11,862 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 20:14:11,995 INFO L130 PetriNetUnfolder]: 12225/17299 cut-off events. [2023-08-30 20:14:11,996 INFO L131 PetriNetUnfolder]: For 90018/91284 co-relation queries the response was YES. [2023-08-30 20:14:12,046 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-08-30 20:14:12,118 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 119 selfloop transitions, 31 changer transitions 0/157 dead transitions. [2023-08-30 20:14:12,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 157 transitions, 1499 flow [2023-08-30 20:14:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:14:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:14:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 545 transitions. [2023-08-30 20:14:12,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396039603960396 [2023-08-30 20:14:12,121 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 545 transitions. [2023-08-30 20:14:12,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 545 transitions. [2023-08-30 20:14:12,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:12,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 545 transitions. [2023-08-30 20:14:12,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 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-08-30 20:14:12,124 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-08-30 20:14:12,125 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-08-30 20:14:12,125 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 638 flow. Second operand 5 states and 545 transitions. [2023-08-30 20:14:12,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 157 transitions, 1499 flow [2023-08-30 20:14:12,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 157 transitions, 1460 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 20:14:12,269 INFO L231 Difference]: Finished difference. Result has 85 places, 85 transitions, 875 flow [2023-08-30 20:14:12,269 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-08-30 20:14:12,270 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 47 predicate places. [2023-08-30 20:14:12,270 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 85 transitions, 875 flow [2023-08-30 20:14:12,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 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-08-30 20:14:12,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:12,271 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-08-30 20:14:12,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-30 20:14:12,477 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-08-30 20:14:12,477 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-08-30 20:14:12,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:12,477 INFO L85 PathProgramCache]: Analyzing trace with hash -212221697, now seen corresponding path program 1 times [2023-08-30 20:14:12,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:12,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033716180] [2023-08-30 20:14:12,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:12,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:12,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:12,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033716180] [2023-08-30 20:14:12,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033716180] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:14:12,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:14:12,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:14:12,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458898921] [2023-08-30 20:14:12,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:14:12,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:14:12,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:12,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:14:12,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:14:12,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 20:14:12,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 85 transitions, 875 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:14:12,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:12,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 20:14:12,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:14,066 INFO L130 PetriNetUnfolder]: 15528/22702 cut-off events. [2023-08-30 20:14:14,066 INFO L131 PetriNetUnfolder]: For 139262/141033 co-relation queries the response was YES. [2023-08-30 20:14:14,171 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-08-30 20:14:14,259 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 161 selfloop transitions, 52 changer transitions 4/226 dead transitions. [2023-08-30 20:14:14,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 226 transitions, 2528 flow [2023-08-30 20:14:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 20:14:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 20:14:14,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 649 transitions. [2023-08-30 20:14:14,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5354785478547854 [2023-08-30 20:14:14,262 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 649 transitions. [2023-08-30 20:14:14,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 649 transitions. [2023-08-30 20:14:14,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:14,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 649 transitions. [2023-08-30 20:14:14,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 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-08-30 20:14:14,266 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-08-30 20:14:14,266 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-08-30 20:14:14,266 INFO L175 Difference]: Start difference. First operand has 85 places, 85 transitions, 875 flow. Second operand 6 states and 649 transitions. [2023-08-30 20:14:14,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 226 transitions, 2528 flow [2023-08-30 20:14:14,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 226 transitions, 2444 flow, removed 22 selfloop flow, removed 1 redundant places. [2023-08-30 20:14:14,589 INFO L231 Difference]: Finished difference. Result has 93 places, 114 transitions, 1322 flow [2023-08-30 20:14:14,589 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-08-30 20:14:14,589 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 55 predicate places. [2023-08-30 20:14:14,590 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 114 transitions, 1322 flow [2023-08-30 20:14:14,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:14:14,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:14,590 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-08-30 20:14:14,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 20:14:14,591 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-08-30 20:14:14,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:14,591 INFO L85 PathProgramCache]: Analyzing trace with hash 550303848, now seen corresponding path program 3 times [2023-08-30 20:14:14,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:14,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286623977] [2023-08-30 20:14:14,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:14,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:14,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:14,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:14,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286623977] [2023-08-30 20:14:14,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286623977] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:14:14,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:14:14,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:14:14,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414634505] [2023-08-30 20:14:14,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:14:14,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:14:14,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:14,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:14:14,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:14:14,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 20:14:14,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 114 transitions, 1322 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:14:14,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:14,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 20:14:14,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:15,553 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-08-30 20:14:15,554 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2023-08-30 20:14:15,554 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-08-30 20:14:15,554 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-08-30 20:14:15,554 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-08-30 20:14:15,573 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-08-30 20:14:15,573 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 20:14:15,573 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:15,573 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:15,573 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 20:14:15,882 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-08-30 20:14:15,882 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2023-08-30 20:14:15,882 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-08-30 20:14:15,882 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-08-30 20:14:15,882 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-08-30 20:14:15,896 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-08-30 20:14:15,896 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 20:14:15,896 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:15,896 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:15,896 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:15,911 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-08-30 20:14:15,911 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2023-08-30 20:14:15,911 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-08-30 20:14:15,911 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-08-30 20:14:15,911 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-08-30 20:14:15,926 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-08-30 20:14:15,927 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 20:14:15,927 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:15,927 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:15,927 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 20:14:16,243 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-08-30 20:14:16,243 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is not cut-off event [2023-08-30 20:14:16,243 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-08-30 20:14:16,244 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-08-30 20:14:16,244 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-08-30 20:14:16,261 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-08-30 20:14:16,262 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 20:14:16,262 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:16,262 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:16,262 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:16,263 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-08-30 20:14:16,263 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 20:14:16,263 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:16,263 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:16,263 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 20:14:16,554 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-08-30 20:14:16,554 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 20:14:16,554 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 20:14:16,554 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 20:14:16,554 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 20:14:16,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], [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-08-30 20:14:16,555 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 20:14:16,555 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 20:14:16,555 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 20:14:16,555 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 20:14:16,754 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-08-30 20:14:16,754 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 20:14:16,754 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 20:14:16,754 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 20:14:16,754 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 20:14:17,179 INFO L130 PetriNetUnfolder]: 20473/29469 cut-off events. [2023-08-30 20:14:17,179 INFO L131 PetriNetUnfolder]: For 236429/240162 co-relation queries the response was YES. [2023-08-30 20:14:17,313 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-08-30 20:14:17,453 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 246 selfloop transitions, 47 changer transitions 1/303 dead transitions. [2023-08-30 20:14:17,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 303 transitions, 4000 flow [2023-08-30 20:14:17,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 20:14:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 20:14:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2023-08-30 20:14:17,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5305280528052805 [2023-08-30 20:14:17,456 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 643 transitions. [2023-08-30 20:14:17,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions. [2023-08-30 20:14:17,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:17,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions. [2023-08-30 20:14:17,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 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-08-30 20:14:17,460 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-08-30 20:14:17,460 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-08-30 20:14:17,461 INFO L175 Difference]: Start difference. First operand has 93 places, 114 transitions, 1322 flow. Second operand 6 states and 643 transitions. [2023-08-30 20:14:17,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 303 transitions, 4000 flow [2023-08-30 20:14:18,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 303 transitions, 3992 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-30 20:14:18,246 INFO L231 Difference]: Finished difference. Result has 102 places, 147 transitions, 1986 flow [2023-08-30 20:14:18,246 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-08-30 20:14:18,246 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 64 predicate places. [2023-08-30 20:14:18,247 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 147 transitions, 1986 flow [2023-08-30 20:14:18,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:14:18,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:18,247 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-08-30 20:14:18,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 20:14:18,247 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-08-30 20:14:18,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:18,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1556227291, now seen corresponding path program 2 times [2023-08-30 20:14:18,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:18,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661235301] [2023-08-30 20:14:18,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:18,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:18,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:18,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661235301] [2023-08-30 20:14:18,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661235301] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:14:18,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:14:18,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:14:18,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052687436] [2023-08-30 20:14:18,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:14:18,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:14:18,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:18,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:14:18,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:14:18,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 20:14:18,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 147 transitions, 1986 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:14:18,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:18,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 20:14:18,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:21,384 INFO L130 PetriNetUnfolder]: 19448/28253 cut-off events. [2023-08-30 20:14:21,384 INFO L131 PetriNetUnfolder]: For 276671/281367 co-relation queries the response was YES. [2023-08-30 20:14:21,477 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-08-30 20:14:21,571 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 268 selfloop transitions, 41 changer transitions 11/337 dead transitions. [2023-08-30 20:14:21,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 337 transitions, 4694 flow [2023-08-30 20:14:21,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 20:14:21,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 20:14:21,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 655 transitions. [2023-08-30 20:14:21,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5404290429042904 [2023-08-30 20:14:21,574 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 655 transitions. [2023-08-30 20:14:21,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 655 transitions. [2023-08-30 20:14:21,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:21,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 655 transitions. [2023-08-30 20:14:21,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 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-08-30 20:14:21,578 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-08-30 20:14:21,578 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-08-30 20:14:21,579 INFO L175 Difference]: Start difference. First operand has 102 places, 147 transitions, 1986 flow. Second operand 6 states and 655 transitions. [2023-08-30 20:14:21,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 337 transitions, 4694 flow [2023-08-30 20:14:22,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 337 transitions, 4592 flow, removed 51 selfloop flow, removed 0 redundant places. [2023-08-30 20:14:22,519 INFO L231 Difference]: Finished difference. Result has 110 places, 172 transitions, 2600 flow [2023-08-30 20:14:22,520 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-08-30 20:14:22,520 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 72 predicate places. [2023-08-30 20:14:22,520 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 172 transitions, 2600 flow [2023-08-30 20:14:22,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:14:22,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:22,521 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-08-30 20:14:22,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 20:14:22,521 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-08-30 20:14:22,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:22,522 INFO L85 PathProgramCache]: Analyzing trace with hash 371724395, now seen corresponding path program 3 times [2023-08-30 20:14:22,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:22,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341848901] [2023-08-30 20:14:22,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:22,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:22,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:22,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341848901] [2023-08-30 20:14:22,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341848901] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:14:22,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:14:22,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:14:22,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292560656] [2023-08-30 20:14:22,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:14:22,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:14:22,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:22,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:14:22,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:14:22,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 20:14:22,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 172 transitions, 2600 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:14:22,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:22,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 20:14:22,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:26,125 INFO L130 PetriNetUnfolder]: 23525/35070 cut-off events. [2023-08-30 20:14:26,126 INFO L131 PetriNetUnfolder]: For 340488/342579 co-relation queries the response was YES. [2023-08-30 20:14:26,263 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-08-30 20:14:26,360 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 283 selfloop transitions, 48 changer transitions 22/390 dead transitions. [2023-08-30 20:14:26,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 390 transitions, 5724 flow [2023-08-30 20:14:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 20:14:26,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 20:14:26,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2023-08-30 20:14:26,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5387788778877888 [2023-08-30 20:14:26,362 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 653 transitions. [2023-08-30 20:14:26,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 653 transitions. [2023-08-30 20:14:26,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:26,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 653 transitions. [2023-08-30 20:14:26,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 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-08-30 20:14:26,365 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-08-30 20:14:26,366 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-08-30 20:14:26,366 INFO L175 Difference]: Start difference. First operand has 110 places, 172 transitions, 2600 flow. Second operand 6 states and 653 transitions. [2023-08-30 20:14:26,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 390 transitions, 5724 flow [2023-08-30 20:14:27,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 390 transitions, 5605 flow, removed 42 selfloop flow, removed 2 redundant places. [2023-08-30 20:14:27,977 INFO L231 Difference]: Finished difference. Result has 117 places, 211 transitions, 3311 flow [2023-08-30 20:14:27,977 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-08-30 20:14:27,978 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 79 predicate places. [2023-08-30 20:14:27,978 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 211 transitions, 3311 flow [2023-08-30 20:14:27,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:14:27,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:27,979 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-08-30 20:14:27,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 20:14:27,979 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-08-30 20:14:27,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:27,979 INFO L85 PathProgramCache]: Analyzing trace with hash 153042763, now seen corresponding path program 4 times [2023-08-30 20:14:27,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:27,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675159842] [2023-08-30 20:14:27,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:27,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:28,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:28,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675159842] [2023-08-30 20:14:28,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675159842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:14:28,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:14:28,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:14:28,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568871795] [2023-08-30 20:14:28,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:14:28,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:14:28,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:28,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:14:28,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:14:28,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 20:14:28,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 211 transitions, 3311 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:14:28,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:28,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 20:14:28,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:32,491 INFO L130 PetriNetUnfolder]: 26685/40089 cut-off events. [2023-08-30 20:14:32,491 INFO L131 PetriNetUnfolder]: For 493723/496874 co-relation queries the response was YES. [2023-08-30 20:14:32,685 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-08-30 20:14:32,957 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 337 selfloop transitions, 48 changer transitions 20/442 dead transitions. [2023-08-30 20:14:32,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 442 transitions, 7325 flow [2023-08-30 20:14:32,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:14:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:14:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2023-08-30 20:14:32,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5326732673267327 [2023-08-30 20:14:32,959 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2023-08-30 20:14:32,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2023-08-30 20:14:32,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:32,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2023-08-30 20:14:32,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 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-08-30 20:14:32,963 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-08-30 20:14:32,963 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-08-30 20:14:32,963 INFO L175 Difference]: Start difference. First operand has 117 places, 211 transitions, 3311 flow. Second operand 5 states and 538 transitions. [2023-08-30 20:14:32,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 442 transitions, 7325 flow [2023-08-30 20:14:35,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 442 transitions, 7257 flow, removed 34 selfloop flow, removed 0 redundant places. [2023-08-30 20:14:36,003 INFO L231 Difference]: Finished difference. Result has 124 places, 240 transitions, 3899 flow [2023-08-30 20:14:36,003 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-08-30 20:14:36,004 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 86 predicate places. [2023-08-30 20:14:36,004 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 240 transitions, 3899 flow [2023-08-30 20:14:36,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:14:36,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:36,004 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-08-30 20:14:36,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 20:14:36,005 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-08-30 20:14:36,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:36,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1733936133, now seen corresponding path program 5 times [2023-08-30 20:14:36,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:36,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683765224] [2023-08-30 20:14:36,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:36,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:36,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:36,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683765224] [2023-08-30 20:14:36,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683765224] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:14:36,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:14:36,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:14:36,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161871367] [2023-08-30 20:14:36,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:14:36,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:14:36,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:36,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:14:36,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:14:36,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 20:14:36,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 240 transitions, 3899 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:14:36,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:36,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 20:14:36,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:40,687 INFO L130 PetriNetUnfolder]: 26719/40118 cut-off events. [2023-08-30 20:14:40,687 INFO L131 PetriNetUnfolder]: For 567927/573002 co-relation queries the response was YES. [2023-08-30 20:14:40,879 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-08-30 20:14:40,996 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 257 selfloop transitions, 75 changer transitions 8/362 dead transitions. [2023-08-30 20:14:40,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 362 transitions, 5973 flow [2023-08-30 20:14:40,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:14:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:14:40,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2023-08-30 20:14:40,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5445544554455446 [2023-08-30 20:14:40,998 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 550 transitions. [2023-08-30 20:14:40,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 550 transitions. [2023-08-30 20:14:40,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:40,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 550 transitions. [2023-08-30 20:14:40,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 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-08-30 20:14:41,001 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-08-30 20:14:41,001 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-08-30 20:14:41,001 INFO L175 Difference]: Start difference. First operand has 124 places, 240 transitions, 3899 flow. Second operand 5 states and 550 transitions. [2023-08-30 20:14:41,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 362 transitions, 5973 flow [2023-08-30 20:14:43,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 362 transitions, 5904 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-08-30 20:14:43,650 INFO L231 Difference]: Finished difference. Result has 128 places, 246 transitions, 4156 flow [2023-08-30 20:14:43,650 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-08-30 20:14:43,651 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 90 predicate places. [2023-08-30 20:14:43,651 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 246 transitions, 4156 flow [2023-08-30 20:14:43,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:14:43,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:43,652 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-08-30 20:14:43,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 20:14:43,653 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-08-30 20:14:43,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:43,653 INFO L85 PathProgramCache]: Analyzing trace with hash 724866881, now seen corresponding path program 2 times [2023-08-30 20:14:43,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:43,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619404516] [2023-08-30 20:14:43,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:43,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:43,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:43,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619404516] [2023-08-30 20:14:43,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619404516] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:14:43,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92422287] [2023-08-30 20:14:43,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 20:14:43,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:14:43,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:14:43,715 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-08-30 20:14:43,718 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-08-30 20:14:43,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:14:43,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:14:43,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 20:14:43,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:14:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:43,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:14:43,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:43,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92422287] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:14:43,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:14:43,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-30 20:14:43,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538134957] [2023-08-30 20:14:43,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:14:43,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 20:14:43,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:43,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 20:14:43,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 20:14:43,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-30 20:14:43,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 246 transitions, 4156 flow. Second operand has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 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-08-30 20:14:43,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:43,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-30 20:14:43,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:49,028 INFO L130 PetriNetUnfolder]: 28102/42070 cut-off events. [2023-08-30 20:14:49,029 INFO L131 PetriNetUnfolder]: For 584259/587926 co-relation queries the response was YES. [2023-08-30 20:14:49,245 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-08-30 20:14:49,386 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 282 selfloop transitions, 74 changer transitions 17/390 dead transitions. [2023-08-30 20:14:49,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 390 transitions, 6870 flow [2023-08-30 20:14:49,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:14:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:14:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2023-08-30 20:14:49,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5267326732673268 [2023-08-30 20:14:49,388 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2023-08-30 20:14:49,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2023-08-30 20:14:49,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:49,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2023-08-30 20:14:49,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 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-08-30 20:14:49,391 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-08-30 20:14:49,391 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-08-30 20:14:49,391 INFO L175 Difference]: Start difference. First operand has 128 places, 246 transitions, 4156 flow. Second operand 5 states and 532 transitions. [2023-08-30 20:14:49,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 390 transitions, 6870 flow [2023-08-30 20:14:53,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 390 transitions, 6701 flow, removed 26 selfloop flow, removed 2 redundant places. [2023-08-30 20:14:53,225 INFO L231 Difference]: Finished difference. Result has 132 places, 257 transitions, 4529 flow [2023-08-30 20:14:53,225 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-08-30 20:14:53,225 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 94 predicate places. [2023-08-30 20:14:53,226 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 257 transitions, 4529 flow [2023-08-30 20:14:53,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 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-08-30 20:14:53,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:14:53,226 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-08-30 20:14:53,235 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-08-30 20:14:53,431 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-08-30 20:14:53,432 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-08-30 20:14:53,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:14:53,432 INFO L85 PathProgramCache]: Analyzing trace with hash 661454854, now seen corresponding path program 4 times [2023-08-30 20:14:53,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:14:53,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766947004] [2023-08-30 20:14:53,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:14:53,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:14:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:14:53,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:14:53,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:14:53,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766947004] [2023-08-30 20:14:53,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766947004] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:14:53,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:14:53,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:14:53,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033841348] [2023-08-30 20:14:53,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:14:53,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:14:53,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:14:53,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:14:53,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:14:53,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 20:14:53,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 257 transitions, 4529 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:14:53,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:14:53,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 20:14:53,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:14:58,402 INFO L130 PetriNetUnfolder]: 27022/40814 cut-off events. [2023-08-30 20:14:58,402 INFO L131 PetriNetUnfolder]: For 648539/653209 co-relation queries the response was YES. [2023-08-30 20:14:58,633 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-08-30 20:14:58,775 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 273 selfloop transitions, 120 changer transitions 31/441 dead transitions. [2023-08-30 20:14:58,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 441 transitions, 8068 flow [2023-08-30 20:14:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:14:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:14:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2023-08-30 20:14:58,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5425742574257426 [2023-08-30 20:14:58,778 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 548 transitions. [2023-08-30 20:14:58,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 548 transitions. [2023-08-30 20:14:58,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:14:58,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 548 transitions. [2023-08-30 20:14:58,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 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-08-30 20:14:58,781 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-08-30 20:14:58,781 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-08-30 20:14:58,781 INFO L175 Difference]: Start difference. First operand has 132 places, 257 transitions, 4529 flow. Second operand 5 states and 548 transitions. [2023-08-30 20:14:58,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 441 transitions, 8068 flow [2023-08-30 20:15:02,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 441 transitions, 7929 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-08-30 20:15:02,496 INFO L231 Difference]: Finished difference. Result has 137 places, 295 transitions, 5544 flow [2023-08-30 20:15:02,496 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-08-30 20:15:02,496 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 99 predicate places. [2023-08-30 20:15:02,496 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 295 transitions, 5544 flow [2023-08-30 20:15:02,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:15:02,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:15:02,497 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-08-30 20:15:02,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 20:15:02,497 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-08-30 20:15:02,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:15:02,498 INFO L85 PathProgramCache]: Analyzing trace with hash -593576133, now seen corresponding path program 3 times [2023-08-30 20:15:02,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:15:02,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676748663] [2023-08-30 20:15:02,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:15:02,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:15:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:15:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:15:02,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:15:02,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676748663] [2023-08-30 20:15:02,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676748663] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:15:02,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:15:02,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:15:02,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714837200] [2023-08-30 20:15:02,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:15:02,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:15:02,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:15:02,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:15:02,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:15:02,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 20:15:02,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 295 transitions, 5544 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:15:02,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:15:02,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 20:15:02,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:15:08,283 INFO L130 PetriNetUnfolder]: 29877/44914 cut-off events. [2023-08-30 20:15:08,284 INFO L131 PetriNetUnfolder]: For 718125/722944 co-relation queries the response was YES. [2023-08-30 20:15:08,547 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-08-30 20:15:08,687 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 294 selfloop transitions, 121 changer transitions 8/445 dead transitions. [2023-08-30 20:15:08,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 445 transitions, 8306 flow [2023-08-30 20:15:08,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:15:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:15:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 554 transitions. [2023-08-30 20:15:08,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5485148514851486 [2023-08-30 20:15:08,689 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 554 transitions. [2023-08-30 20:15:08,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 554 transitions. [2023-08-30 20:15:08,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:15:08,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 554 transitions. [2023-08-30 20:15:08,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 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-08-30 20:15:08,692 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-08-30 20:15:08,692 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-08-30 20:15:08,692 INFO L175 Difference]: Start difference. First operand has 137 places, 295 transitions, 5544 flow. Second operand 5 states and 554 transitions. [2023-08-30 20:15:08,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 445 transitions, 8306 flow [2023-08-30 20:15:13,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 445 transitions, 8082 flow, removed 58 selfloop flow, removed 1 redundant places. [2023-08-30 20:15:13,403 INFO L231 Difference]: Finished difference. Result has 141 places, 307 transitions, 5912 flow [2023-08-30 20:15:13,403 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-08-30 20:15:13,403 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 103 predicate places. [2023-08-30 20:15:13,403 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 307 transitions, 5912 flow [2023-08-30 20:15:13,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:15:13,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:15:13,404 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-08-30 20:15:13,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 20:15:13,404 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-08-30 20:15:13,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:15:13,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1280457636, now seen corresponding path program 5 times [2023-08-30 20:15:13,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:15:13,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771860050] [2023-08-30 20:15:13,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:15:13,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:15:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:15:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:15:13,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:15:13,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771860050] [2023-08-30 20:15:13,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771860050] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:15:13,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567924137] [2023-08-30 20:15:13,456 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 20:15:13,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:15:13,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:15:13,457 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-08-30 20:15:13,460 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-08-30 20:15:13,554 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:15:13,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:15:13,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 20:15:13,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:15:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:15:13,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:15:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:15:13,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567924137] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:15:13,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:15:13,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-30 20:15:13,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357005446] [2023-08-30 20:15:13,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:15:13,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 20:15:13,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:15:13,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 20:15:13,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 20:15:13,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-30 20:15:13,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 307 transitions, 5912 flow. Second operand has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 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-08-30 20:15:13,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:15:13,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-30 20:15:13,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:15:19,729 INFO L130 PetriNetUnfolder]: 30927/46403 cut-off events. [2023-08-30 20:15:19,730 INFO L131 PetriNetUnfolder]: For 782816/787508 co-relation queries the response was YES. [2023-08-30 20:15:20,030 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-08-30 20:15:20,407 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 399 selfloop transitions, 64 changer transitions 22/502 dead transitions. [2023-08-30 20:15:20,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 502 transitions, 10330 flow [2023-08-30 20:15:20,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:15:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:15:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2023-08-30 20:15:20,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227722772277228 [2023-08-30 20:15:20,409 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2023-08-30 20:15:20,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2023-08-30 20:15:20,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:15:20,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2023-08-30 20:15:20,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 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-08-30 20:15:20,413 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-08-30 20:15:20,413 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-08-30 20:15:20,413 INFO L175 Difference]: Start difference. First operand has 141 places, 307 transitions, 5912 flow. Second operand 5 states and 528 transitions. [2023-08-30 20:15:20,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 502 transitions, 10330 flow [2023-08-30 20:15:26,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 502 transitions, 9931 flow, removed 45 selfloop flow, removed 2 redundant places. [2023-08-30 20:15:26,375 INFO L231 Difference]: Finished difference. Result has 145 places, 331 transitions, 6445 flow [2023-08-30 20:15:26,375 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-08-30 20:15:26,376 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 107 predicate places. [2023-08-30 20:15:26,376 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 331 transitions, 6445 flow [2023-08-30 20:15:26,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 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-08-30 20:15:26,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:15:26,376 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-08-30 20:15:26,381 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-08-30 20:15:26,577 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-08-30 20:15:26,578 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-08-30 20:15:26,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:15:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1098078909, now seen corresponding path program 4 times [2023-08-30 20:15:26,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:15:26,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328950675] [2023-08-30 20:15:26,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:15:26,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:15:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:15:26,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:15:26,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:15:26,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328950675] [2023-08-30 20:15:26,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328950675] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:15:26,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:15:26,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:15:26,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377575389] [2023-08-30 20:15:26,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:15:26,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:15:26,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:15:26,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:15:26,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:15:26,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 202 [2023-08-30 20:15:26,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 331 transitions, 6445 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-08-30 20:15:26,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:15:26,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 202 [2023-08-30 20:15:26,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:15:33,153 INFO L130 PetriNetUnfolder]: 32086/48461 cut-off events. [2023-08-30 20:15:33,153 INFO L131 PetriNetUnfolder]: For 856277/861744 co-relation queries the response was YES. [2023-08-30 20:15:33,441 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-08-30 20:15:33,583 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 249 selfloop transitions, 147 changer transitions 23/441 dead transitions. [2023-08-30 20:15:33,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 441 transitions, 8570 flow [2023-08-30 20:15:33,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:15:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:15:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2023-08-30 20:15:33,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5465346534653466 [2023-08-30 20:15:33,585 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 552 transitions. [2023-08-30 20:15:33,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 552 transitions. [2023-08-30 20:15:33,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:15:33,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 552 transitions. [2023-08-30 20:15:33,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 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-08-30 20:15:33,587 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-08-30 20:15:33,587 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-08-30 20:15:33,587 INFO L175 Difference]: Start difference. First operand has 145 places, 331 transitions, 6445 flow. Second operand 5 states and 552 transitions. [2023-08-30 20:15:33,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 441 transitions, 8570 flow [2023-08-30 20:15:38,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 441 transitions, 8442 flow, removed 25 selfloop flow, removed 3 redundant places. [2023-08-30 20:15:38,291 INFO L231 Difference]: Finished difference. Result has 148 places, 334 transitions, 6718 flow [2023-08-30 20:15:38,291 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-08-30 20:15:38,292 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 110 predicate places. [2023-08-30 20:15:38,292 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 334 transitions, 6718 flow [2023-08-30 20:15:38,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-08-30 20:15:38,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:15:38,292 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-08-30 20:15:38,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 20:15:38,292 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-08-30 20:15:38,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:15:38,292 INFO L85 PathProgramCache]: Analyzing trace with hash -75263484, now seen corresponding path program 6 times [2023-08-30 20:15:38,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:15:38,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343264153] [2023-08-30 20:15:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:15:38,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:15:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:15:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:15:38,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:15:38,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343264153] [2023-08-30 20:15:38,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343264153] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:15:38,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:15:38,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:15:38,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818333654] [2023-08-30 20:15:38,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:15:38,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:15:38,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:15:38,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:15:38,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:15:38,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 20:15:38,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 334 transitions, 6718 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:15:38,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:15:38,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 20:15:38,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:15:44,868 INFO L130 PetriNetUnfolder]: 31442/47939 cut-off events. [2023-08-30 20:15:44,869 INFO L131 PetriNetUnfolder]: For 864160/866898 co-relation queries the response was YES. [2023-08-30 20:15:45,188 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-08-30 20:15:45,321 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 403 selfloop transitions, 104 changer transitions 73/617 dead transitions. [2023-08-30 20:15:45,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 617 transitions, 12476 flow [2023-08-30 20:15:45,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 20:15:45,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 20:15:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 647 transitions. [2023-08-30 20:15:45,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5338283828382838 [2023-08-30 20:15:45,323 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 647 transitions. [2023-08-30 20:15:45,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 647 transitions. [2023-08-30 20:15:45,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:15:45,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 647 transitions. [2023-08-30 20:15:45,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 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-08-30 20:15:45,325 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-08-30 20:15:45,326 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-08-30 20:15:45,326 INFO L175 Difference]: Start difference. First operand has 148 places, 334 transitions, 6718 flow. Second operand 6 states and 647 transitions. [2023-08-30 20:15:45,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 617 transitions, 12476 flow [2023-08-30 20:15:50,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 617 transitions, 12120 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 20:15:50,419 INFO L231 Difference]: Finished difference. Result has 155 places, 390 transitions, 7945 flow [2023-08-30 20:15:50,420 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-08-30 20:15:50,420 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 117 predicate places. [2023-08-30 20:15:50,420 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 390 transitions, 7945 flow [2023-08-30 20:15:50,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:15:50,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:15:50,420 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-08-30 20:15:50,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 20:15:50,421 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-08-30 20:15:50,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:15:50,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1821063516, now seen corresponding path program 7 times [2023-08-30 20:15:50,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:15:50,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968777243] [2023-08-30 20:15:50,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:15:50,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:15:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:15:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:15:50,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:15:50,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968777243] [2023-08-30 20:15:50,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968777243] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:15:50,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:15:50,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:15:50,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900512736] [2023-08-30 20:15:50,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:15:50,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:15:50,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:15:50,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:15:50,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:15:50,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 20:15:50,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 390 transitions, 7945 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:15:50,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:15:50,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 20:15:50,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:15:57,480 INFO L130 PetriNetUnfolder]: 30968/46642 cut-off events. [2023-08-30 20:15:57,480 INFO L131 PetriNetUnfolder]: For 926450/929539 co-relation queries the response was YES. [2023-08-30 20:15:57,776 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-08-30 20:15:57,917 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 306 selfloop transitions, 169 changer transitions 22/530 dead transitions. [2023-08-30 20:15:57,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 530 transitions, 11154 flow [2023-08-30 20:15:57,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:15:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:15:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2023-08-30 20:15:57,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366336633663367 [2023-08-30 20:15:57,918 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 542 transitions. [2023-08-30 20:15:57,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 542 transitions. [2023-08-30 20:15:57,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:15:57,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 542 transitions. [2023-08-30 20:15:57,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 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-08-30 20:15:57,920 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-08-30 20:15:57,920 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-08-30 20:15:57,920 INFO L175 Difference]: Start difference. First operand has 155 places, 390 transitions, 7945 flow. Second operand 5 states and 542 transitions. [2023-08-30 20:15:57,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 530 transitions, 11154 flow [2023-08-30 20:16:03,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 530 transitions, 11078 flow, removed 38 selfloop flow, removed 0 redundant places. [2023-08-30 20:16:03,556 INFO L231 Difference]: Finished difference. Result has 160 places, 409 transitions, 8720 flow [2023-08-30 20:16:03,557 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-08-30 20:16:03,557 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 122 predicate places. [2023-08-30 20:16:03,557 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 409 transitions, 8720 flow [2023-08-30 20:16:03,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:16:03,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:16:03,557 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-08-30 20:16:03,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 20:16:03,558 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-08-30 20:16:03,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:16:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2013740015, now seen corresponding path program 5 times [2023-08-30 20:16:03,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:16:03,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485971995] [2023-08-30 20:16:03,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:16:03,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:16:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:16:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:16:03,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:16:03,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485971995] [2023-08-30 20:16:03,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485971995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:16:03,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:16:03,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:16:03,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898536559] [2023-08-30 20:16:03,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:16:03,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:16:03,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:16:03,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:16:03,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:16:03,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 20:16:03,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 409 transitions, 8720 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:16:03,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:16:03,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 20:16:03,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:16:10,145 INFO L130 PetriNetUnfolder]: 27955/41862 cut-off events. [2023-08-30 20:16:10,145 INFO L131 PetriNetUnfolder]: For 940457/946048 co-relation queries the response was YES. [2023-08-30 20:16:10,398 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-08-30 20:16:10,523 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 314 selfloop transitions, 185 changer transitions 30/551 dead transitions. [2023-08-30 20:16:10,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 551 transitions, 11826 flow [2023-08-30 20:16:10,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:16:10,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:16:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2023-08-30 20:16:10,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5445544554455446 [2023-08-30 20:16:10,525 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 550 transitions. [2023-08-30 20:16:10,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 550 transitions. [2023-08-30 20:16:10,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:16:10,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 550 transitions. [2023-08-30 20:16:10,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 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-08-30 20:16:10,527 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-08-30 20:16:10,528 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-08-30 20:16:10,528 INFO L175 Difference]: Start difference. First operand has 160 places, 409 transitions, 8720 flow. Second operand 5 states and 550 transitions. [2023-08-30 20:16:10,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 551 transitions, 11826 flow [2023-08-30 20:16:14,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 551 transitions, 11392 flow, removed 45 selfloop flow, removed 3 redundant places. [2023-08-30 20:16:14,804 INFO L231 Difference]: Finished difference. Result has 162 places, 420 transitions, 9009 flow [2023-08-30 20:16:14,805 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-08-30 20:16:14,805 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 124 predicate places. [2023-08-30 20:16:14,805 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 420 transitions, 9009 flow [2023-08-30 20:16:14,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:16:14,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:16:14,806 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-08-30 20:16:14,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-30 20:16:14,806 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-08-30 20:16:14,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:16:14,806 INFO L85 PathProgramCache]: Analyzing trace with hash 328926055, now seen corresponding path program 6 times [2023-08-30 20:16:14,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:16:14,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839978091] [2023-08-30 20:16:14,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:16:14,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:16:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:16:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:16:14,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:16:14,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839978091] [2023-08-30 20:16:14,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839978091] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:16:14,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307704018] [2023-08-30 20:16:14,861 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 20:16:14,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:16:14,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:16:14,865 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-08-30 20:16:14,869 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-08-30 20:16:14,979 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-30 20:16:14,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:16:14,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 20:16:14,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:16:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:16:15,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:16:15,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:16:15,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307704018] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:16:15,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:16:15,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 20:16:15,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339905385] [2023-08-30 20:16:15,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:16:15,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 20:16:15,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:16:15,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 20:16:15,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-30 20:16:15,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-30 20:16:15,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 420 transitions, 9009 flow. Second operand has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 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-08-30 20:16:15,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:16:15,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-30 20:16:15,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:16:22,390 INFO L130 PetriNetUnfolder]: 30804/45994 cut-off events. [2023-08-30 20:16:22,390 INFO L131 PetriNetUnfolder]: For 1028273/1032695 co-relation queries the response was YES. [2023-08-30 20:16:22,670 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-08-30 20:16:22,816 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 416 selfloop transitions, 163 changer transitions 26/651 dead transitions. [2023-08-30 20:16:22,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 651 transitions, 14204 flow [2023-08-30 20:16:22,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:16:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:16:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 545 transitions. [2023-08-30 20:16:22,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396039603960396 [2023-08-30 20:16:22,818 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 545 transitions. [2023-08-30 20:16:22,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 545 transitions. [2023-08-30 20:16:22,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:16:22,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 545 transitions. [2023-08-30 20:16:22,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 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-08-30 20:16:22,820 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-08-30 20:16:22,820 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-08-30 20:16:22,820 INFO L175 Difference]: Start difference. First operand has 162 places, 420 transitions, 9009 flow. Second operand 5 states and 545 transitions. [2023-08-30 20:16:22,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 651 transitions, 14204 flow [2023-08-30 20:16:28,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 651 transitions, 13622 flow, removed 54 selfloop flow, removed 4 redundant places. [2023-08-30 20:16:28,230 INFO L231 Difference]: Finished difference. Result has 165 places, 481 transitions, 10412 flow [2023-08-30 20:16:28,231 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-08-30 20:16:28,231 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 127 predicate places. [2023-08-30 20:16:28,231 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 481 transitions, 10412 flow [2023-08-30 20:16:28,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 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-08-30 20:16:28,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:16:28,233 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-08-30 20:16:28,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 20:16:28,438 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-08-30 20:16:28,438 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-08-30 20:16:28,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:16:28,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1550796492, now seen corresponding path program 8 times [2023-08-30 20:16:28,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:16:28,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361917599] [2023-08-30 20:16:28,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:16:28,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:16:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:16:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:16:28,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:16:28,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361917599] [2023-08-30 20:16:28,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361917599] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:16:28,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:16:28,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:16:28,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496444134] [2023-08-30 20:16:28,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:16:28,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:16:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:16:28,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:16:28,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:16:28,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 20:16:28,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 481 transitions, 10412 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:16:28,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:16:28,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 20:16:28,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:16:36,611 INFO L130 PetriNetUnfolder]: 30448/45750 cut-off events. [2023-08-30 20:16:36,611 INFO L131 PetriNetUnfolder]: For 988654/990532 co-relation queries the response was YES. [2023-08-30 20:16:36,959 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-08-30 20:16:37,102 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 487 selfloop transitions, 97 changer transitions 77/715 dead transitions. [2023-08-30 20:16:37,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 715 transitions, 15601 flow [2023-08-30 20:16:37,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:16:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:16:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 546 transitions. [2023-08-30 20:16:37,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5405940594059406 [2023-08-30 20:16:37,104 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 546 transitions. [2023-08-30 20:16:37,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 546 transitions. [2023-08-30 20:16:37,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:16:37,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 546 transitions. [2023-08-30 20:16:37,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 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-08-30 20:16:37,106 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-08-30 20:16:37,107 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-08-30 20:16:37,107 INFO L175 Difference]: Start difference. First operand has 165 places, 481 transitions, 10412 flow. Second operand 5 states and 546 transitions. [2023-08-30 20:16:37,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 715 transitions, 15601 flow [2023-08-30 20:16:43,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 715 transitions, 15241 flow, removed 96 selfloop flow, removed 1 redundant places. [2023-08-30 20:16:43,303 INFO L231 Difference]: Finished difference. Result has 171 places, 524 transitions, 11402 flow [2023-08-30 20:16:43,303 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-08-30 20:16:43,304 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 133 predicate places. [2023-08-30 20:16:43,304 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 524 transitions, 11402 flow [2023-08-30 20:16:43,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:16:43,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:16:43,304 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-08-30 20:16:43,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-30 20:16:43,304 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-08-30 20:16:43,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:16:43,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1955010241, now seen corresponding path program 7 times [2023-08-30 20:16:43,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:16:43,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297875235] [2023-08-30 20:16:43,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:16:43,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:16:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:16:43,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:16:43,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:16:43,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297875235] [2023-08-30 20:16:43,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297875235] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:16:43,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407638958] [2023-08-30 20:16:43,356 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 20:16:43,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:16:43,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:16:43,361 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-08-30 20:16:43,365 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-08-30 20:16:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:16:43,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 20:16:43,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:16:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:16:43,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:16:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:16:43,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407638958] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:16:43,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:16:43,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 20:16:43,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175111458] [2023-08-30 20:16:43,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:16:43,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 20:16:43,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:16:43,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 20:16:43,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 20:16:43,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-30 20:16:43,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 524 transitions, 11402 flow. Second operand has 10 states, 10 states have (on average 95.7) internal successors, (957), 10 states have internal predecessors, (957), 0 states have call successors, (0), 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-08-30 20:16:43,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:16:43,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-30 20:16:43,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:16:51,187 INFO L130 PetriNetUnfolder]: 28497/42251 cut-off events. [2023-08-30 20:16:51,188 INFO L131 PetriNetUnfolder]: For 1036949/1041043 co-relation queries the response was YES. [2023-08-30 20:16:51,497 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-08-30 20:16:51,636 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 574 selfloop transitions, 161 changer transitions 81/868 dead transitions. [2023-08-30 20:16:51,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 868 transitions, 18971 flow [2023-08-30 20:16:51,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 20:16:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 20:16:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 861 transitions. [2023-08-30 20:16:51,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5327970297029703 [2023-08-30 20:16:51,638 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 861 transitions. [2023-08-30 20:16:51,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 861 transitions. [2023-08-30 20:16:51,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:16:51,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 861 transitions. [2023-08-30 20:16:51,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.625) internal successors, (861), 8 states have internal predecessors, (861), 0 states have call successors, (0), 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-08-30 20:16:51,641 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-08-30 20:16:51,642 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-08-30 20:16:51,642 INFO L175 Difference]: Start difference. First operand has 171 places, 524 transitions, 11402 flow. Second operand 8 states and 861 transitions. [2023-08-30 20:16:51,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 868 transitions, 18971 flow [2023-08-30 20:16:57,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 868 transitions, 18711 flow, removed 101 selfloop flow, removed 1 redundant places. [2023-08-30 20:16:57,463 INFO L231 Difference]: Finished difference. Result has 179 places, 546 transitions, 12220 flow [2023-08-30 20:16:57,464 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-08-30 20:16:57,464 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 141 predicate places. [2023-08-30 20:16:57,464 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 546 transitions, 12220 flow [2023-08-30 20:16:57,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.7) internal successors, (957), 10 states have internal predecessors, (957), 0 states have call successors, (0), 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-08-30 20:16:57,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:16:57,465 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-08-30 20:16:57,474 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-08-30 20:16:57,672 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-08-30 20:16:57,673 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-08-30 20:16:57,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:16:57,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1547411515, now seen corresponding path program 6 times [2023-08-30 20:16:57,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:16:57,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400628377] [2023-08-30 20:16:57,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:16:57,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:16:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:16:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:16:57,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:16:57,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400628377] [2023-08-30 20:16:57,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400628377] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:16:57,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:16:57,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:16:57,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166479432] [2023-08-30 20:16:57,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:16:57,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:16:57,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:16:57,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:16:57,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:16:57,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 20:16:57,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 546 transitions, 12220 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:16:57,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:16:57,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 20:16:57,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:17:04,009 INFO L130 PetriNetUnfolder]: 25160/36932 cut-off events. [2023-08-30 20:17:04,009 INFO L131 PetriNetUnfolder]: For 986589/994236 co-relation queries the response was YES. [2023-08-30 20:17:04,296 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-08-30 20:17:04,424 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 388 selfloop transitions, 235 changer transitions 75/729 dead transitions. [2023-08-30 20:17:04,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 729 transitions, 16766 flow [2023-08-30 20:17:04,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 20:17:04,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 20:17:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 648 transitions. [2023-08-30 20:17:04,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5346534653465347 [2023-08-30 20:17:04,426 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 648 transitions. [2023-08-30 20:17:04,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 648 transitions. [2023-08-30 20:17:04,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:17:04,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 648 transitions. [2023-08-30 20:17:04,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 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-08-30 20:17:04,428 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-08-30 20:17:04,428 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-08-30 20:17:04,428 INFO L175 Difference]: Start difference. First operand has 179 places, 546 transitions, 12220 flow. Second operand 6 states and 648 transitions. [2023-08-30 20:17:04,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 729 transitions, 16766 flow [2023-08-30 20:17:08,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 729 transitions, 16268 flow, removed 86 selfloop flow, removed 5 redundant places. [2023-08-30 20:17:08,620 INFO L231 Difference]: Finished difference. Result has 180 places, 545 transitions, 12355 flow [2023-08-30 20:17:08,620 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-08-30 20:17:08,620 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 142 predicate places. [2023-08-30 20:17:08,621 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 545 transitions, 12355 flow [2023-08-30 20:17:08,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:17:08,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:17:08,621 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-08-30 20:17:08,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-30 20:17:08,621 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-08-30 20:17:08,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:17:08,622 INFO L85 PathProgramCache]: Analyzing trace with hash 13754851, now seen corresponding path program 7 times [2023-08-30 20:17:08,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:17:08,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924349898] [2023-08-30 20:17:08,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:17:08,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:17:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:17:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:17:08,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:17:08,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924349898] [2023-08-30 20:17:08,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924349898] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:17:08,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:17:08,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:17:08,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562536803] [2023-08-30 20:17:08,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:17:08,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:17:08,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:17:08,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:17:08,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:17:08,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 202 [2023-08-30 20:17:08,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 545 transitions, 12355 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-08-30 20:17:08,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:17:08,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 202 [2023-08-30 20:17:08,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:17:14,969 INFO L130 PetriNetUnfolder]: 24669/35922 cut-off events. [2023-08-30 20:17:14,970 INFO L131 PetriNetUnfolder]: For 841027/843152 co-relation queries the response was YES. [2023-08-30 20:17:15,277 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-08-30 20:17:15,398 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 439 selfloop transitions, 192 changer transitions 64/733 dead transitions. [2023-08-30 20:17:15,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 733 transitions, 17092 flow [2023-08-30 20:17:15,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:17:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:17:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 546 transitions. [2023-08-30 20:17:15,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5405940594059406 [2023-08-30 20:17:15,399 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 546 transitions. [2023-08-30 20:17:15,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 546 transitions. [2023-08-30 20:17:15,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:17:15,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 546 transitions. [2023-08-30 20:17:15,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 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-08-30 20:17:15,401 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-08-30 20:17:15,401 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-08-30 20:17:15,401 INFO L175 Difference]: Start difference. First operand has 180 places, 545 transitions, 12355 flow. Second operand 5 states and 546 transitions. [2023-08-30 20:17:15,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 733 transitions, 17092 flow [2023-08-30 20:17:20,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 733 transitions, 16406 flow, removed 112 selfloop flow, removed 5 redundant places. [2023-08-30 20:17:20,130 INFO L231 Difference]: Finished difference. Result has 181 places, 553 transitions, 12456 flow [2023-08-30 20:17:20,130 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-08-30 20:17:20,131 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 143 predicate places. [2023-08-30 20:17:20,131 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 553 transitions, 12456 flow [2023-08-30 20:17:20,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-08-30 20:17:20,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:17:20,132 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-08-30 20:17:20,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-30 20:17:20,132 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-08-30 20:17:20,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:17:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash 201753452, now seen corresponding path program 9 times [2023-08-30 20:17:20,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:17:20,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223341339] [2023-08-30 20:17:20,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:17:20,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:17:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:17:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:17:20,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:17:20,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223341339] [2023-08-30 20:17:20,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223341339] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:17:20,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:17:20,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:17:20,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364869870] [2023-08-30 20:17:20,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:17:20,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:17:20,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:17:20,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:17:20,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:17:20,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 20:17:20,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 553 transitions, 12456 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:17:20,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:17:20,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 20:17:20,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:17:26,716 INFO L130 PetriNetUnfolder]: 25669/36968 cut-off events. [2023-08-30 20:17:26,716 INFO L131 PetriNetUnfolder]: For 867355/869414 co-relation queries the response was YES. [2023-08-30 20:17:27,042 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-08-30 20:17:27,177 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 553 selfloop transitions, 93 changer transitions 22/718 dead transitions. [2023-08-30 20:17:27,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 718 transitions, 16758 flow [2023-08-30 20:17:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:17:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:17:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2023-08-30 20:17:27,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366336633663367 [2023-08-30 20:17:27,179 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 542 transitions. [2023-08-30 20:17:27,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 542 transitions. [2023-08-30 20:17:27,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:17:27,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 542 transitions. [2023-08-30 20:17:27,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 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-08-30 20:17:27,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-08-30 20:17:27,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-08-30 20:17:27,180 INFO L175 Difference]: Start difference. First operand has 181 places, 553 transitions, 12456 flow. Second operand 5 states and 542 transitions. [2023-08-30 20:17:27,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 718 transitions, 16758 flow [2023-08-30 20:17:32,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 718 transitions, 16201 flow, removed 51 selfloop flow, removed 5 redundant places. [2023-08-30 20:17:32,647 INFO L231 Difference]: Finished difference. Result has 181 places, 562 transitions, 12412 flow [2023-08-30 20:17:32,647 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-08-30 20:17:32,648 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 143 predicate places. [2023-08-30 20:17:32,648 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 562 transitions, 12412 flow [2023-08-30 20:17:32,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:17:32,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:17:32,648 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-08-30 20:17:32,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-30 20:17:32,649 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-08-30 20:17:32,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:17:32,649 INFO L85 PathProgramCache]: Analyzing trace with hash -303154112, now seen corresponding path program 10 times [2023-08-30 20:17:32,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:17:32,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832767573] [2023-08-30 20:17:32,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:17:32,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:17:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:17:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:17:32,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:17:32,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832767573] [2023-08-30 20:17:32,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832767573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:17:32,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:17:32,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:17:32,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419543067] [2023-08-30 20:17:32,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:17:32,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:17:32,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:17:32,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:17:32,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:17:32,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 20:17:32,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 562 transitions, 12412 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:17:32,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:17:32,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 20:17:32,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:17:38,323 INFO L130 PetriNetUnfolder]: 23491/33728 cut-off events. [2023-08-30 20:17:38,323 INFO L131 PetriNetUnfolder]: For 806643/809922 co-relation queries the response was YES. [2023-08-30 20:17:38,617 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-08-30 20:17:38,736 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 495 selfloop transitions, 131 changer transitions 51/705 dead transitions. [2023-08-30 20:17:38,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 705 transitions, 16312 flow [2023-08-30 20:17:38,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:17:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:17:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2023-08-30 20:17:38,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306930693069307 [2023-08-30 20:17:38,737 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 536 transitions. [2023-08-30 20:17:38,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 536 transitions. [2023-08-30 20:17:38,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:17:38,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 536 transitions. [2023-08-30 20:17:38,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 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-08-30 20:17:38,739 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-08-30 20:17:38,739 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-08-30 20:17:38,739 INFO L175 Difference]: Start difference. First operand has 181 places, 562 transitions, 12412 flow. Second operand 5 states and 536 transitions. [2023-08-30 20:17:38,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 705 transitions, 16312 flow [2023-08-30 20:17:43,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 705 transitions, 16044 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-08-30 20:17:43,830 INFO L231 Difference]: Finished difference. Result has 183 places, 550 transitions, 12321 flow [2023-08-30 20:17:43,831 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-08-30 20:17:43,831 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 145 predicate places. [2023-08-30 20:17:43,831 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 550 transitions, 12321 flow [2023-08-30 20:17:43,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:17:43,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:17:43,832 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-08-30 20:17:43,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-30 20:17:43,832 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-08-30 20:17:43,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:17:43,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1032574491, now seen corresponding path program 8 times [2023-08-30 20:17:43,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:17:43,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400243493] [2023-08-30 20:17:43,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:17:43,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:17:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:17:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:17:43,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:17:43,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400243493] [2023-08-30 20:17:43,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400243493] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:17:43,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:17:43,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:17:43,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578770077] [2023-08-30 20:17:43,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:17:43,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:17:43,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:17:43,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:17:43,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:17:43,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 202 [2023-08-30 20:17:43,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 550 transitions, 12321 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-08-30 20:17:43,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:17:43,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 202 [2023-08-30 20:17:43,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:17:49,003 INFO L130 PetriNetUnfolder]: 22334/31675 cut-off events. [2023-08-30 20:17:49,003 INFO L131 PetriNetUnfolder]: For 775607/778609 co-relation queries the response was YES. [2023-08-30 20:17:49,211 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-08-30 20:17:49,318 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 370 selfloop transitions, 183 changer transitions 93/692 dead transitions. [2023-08-30 20:17:49,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 692 transitions, 16016 flow [2023-08-30 20:17:49,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:17:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:17:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 545 transitions. [2023-08-30 20:17:49,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396039603960396 [2023-08-30 20:17:49,319 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 545 transitions. [2023-08-30 20:17:49,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 545 transitions. [2023-08-30 20:17:49,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:17:49,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 545 transitions. [2023-08-30 20:17:49,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 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-08-30 20:17:49,321 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-08-30 20:17:49,321 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-08-30 20:17:49,322 INFO L175 Difference]: Start difference. First operand has 183 places, 550 transitions, 12321 flow. Second operand 5 states and 545 transitions. [2023-08-30 20:17:49,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 692 transitions, 16016 flow [2023-08-30 20:17:52,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 692 transitions, 15511 flow, removed 76 selfloop flow, removed 6 redundant places. [2023-08-30 20:17:52,786 INFO L231 Difference]: Finished difference. Result has 180 places, 550 transitions, 12272 flow [2023-08-30 20:17:52,786 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-08-30 20:17:52,786 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 142 predicate places. [2023-08-30 20:17:52,787 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 550 transitions, 12272 flow [2023-08-30 20:17:52,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-08-30 20:17:52,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:17:52,787 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-08-30 20:17:52,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-30 20:17:52,788 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-08-30 20:17:52,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:17:52,788 INFO L85 PathProgramCache]: Analyzing trace with hash -481538739, now seen corresponding path program 8 times [2023-08-30 20:17:52,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:17:52,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106021063] [2023-08-30 20:17:52,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:17:52,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:17:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:17:52,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:17:52,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:17:52,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106021063] [2023-08-30 20:17:52,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106021063] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:17:52,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194016830] [2023-08-30 20:17:52,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 20:17:52,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:17:52,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:17:52,841 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-08-30 20:17:52,848 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-08-30 20:17:52,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:17:52,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:17:52,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 20:17:52,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:17:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:17:53,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:17:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:17:53,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194016830] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:17:53,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:17:53,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 20:17:53,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536428924] [2023-08-30 20:17:53,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:17:53,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 20:17:53,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:17:53,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 20:17:53,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 20:17:53,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-30 20:17:53,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 550 transitions, 12272 flow. Second operand has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 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-08-30 20:17:53,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:17:53,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-30 20:17:53,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:17:58,403 INFO L130 PetriNetUnfolder]: 22923/32314 cut-off events. [2023-08-30 20:17:58,403 INFO L131 PetriNetUnfolder]: For 737438/739982 co-relation queries the response was YES. [2023-08-30 20:17:58,648 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-08-30 20:17:58,761 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 497 selfloop transitions, 230 changer transitions 119/881 dead transitions. [2023-08-30 20:17:58,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 881 transitions, 19638 flow [2023-08-30 20:17:58,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 20:17:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 20:17:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 857 transitions. [2023-08-30 20:17:58,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5303217821782178 [2023-08-30 20:17:58,762 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 857 transitions. [2023-08-30 20:17:58,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 857 transitions. [2023-08-30 20:17:58,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:17:58,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 857 transitions. [2023-08-30 20:17:58,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.125) internal successors, (857), 8 states have internal predecessors, (857), 0 states have call successors, (0), 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-08-30 20:17:58,764 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-08-30 20:17:58,764 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-08-30 20:17:58,765 INFO L175 Difference]: Start difference. First operand has 180 places, 550 transitions, 12272 flow. Second operand 8 states and 857 transitions. [2023-08-30 20:17:58,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 881 transitions, 19638 flow [2023-08-30 20:18:03,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 881 transitions, 19252 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-08-30 20:18:03,056 INFO L231 Difference]: Finished difference. Result has 185 places, 560 transitions, 12698 flow [2023-08-30 20:18:03,056 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-08-30 20:18:03,057 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 147 predicate places. [2023-08-30 20:18:03,057 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 560 transitions, 12698 flow [2023-08-30 20:18:03,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 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-08-30 20:18:03,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:18:03,058 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-08-30 20:18:03,067 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-08-30 20:18:03,262 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-08-30 20:18:03,263 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-08-30 20:18:03,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:18:03,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2051744475, now seen corresponding path program 9 times [2023-08-30 20:18:03,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:18:03,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369339369] [2023-08-30 20:18:03,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:18:03,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:18:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:18:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:18:03,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:18:03,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369339369] [2023-08-30 20:18:03,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369339369] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:18:03,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334373893] [2023-08-30 20:18:03,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 20:18:03,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:18:03,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:18:03,322 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-08-30 20:18:03,348 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-08-30 20:18:03,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 20:18:03,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:18:03,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 20:18:03,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:18:03,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:18:03,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:18:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:18:03,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334373893] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:18:03,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:18:03,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 20:18:03,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221294570] [2023-08-30 20:18:03,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:18:03,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 20:18:03,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:18:03,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 20:18:03,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-30 20:18:03,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-30 20:18:03,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 560 transitions, 12698 flow. Second operand has 10 states, 10 states have (on average 95.4) internal successors, (954), 10 states have internal predecessors, (954), 0 states have call successors, (0), 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-08-30 20:18:03,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:18:03,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-30 20:18:03,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:18:08,402 INFO L130 PetriNetUnfolder]: 21401/29770 cut-off events. [2023-08-30 20:18:08,403 INFO L131 PetriNetUnfolder]: For 730383/733737 co-relation queries the response was YES. [2023-08-30 20:18:08,623 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-08-30 20:18:08,731 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 441 selfloop transitions, 154 changer transitions 51/679 dead transitions. [2023-08-30 20:18:08,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 679 transitions, 15822 flow [2023-08-30 20:18:08,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:18:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:18:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 537 transitions. [2023-08-30 20:18:08,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5316831683168317 [2023-08-30 20:18:08,733 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 537 transitions. [2023-08-30 20:18:08,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 537 transitions. [2023-08-30 20:18:08,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:18:08,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 537 transitions. [2023-08-30 20:18:08,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 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-08-30 20:18:08,734 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-08-30 20:18:08,734 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-08-30 20:18:08,734 INFO L175 Difference]: Start difference. First operand has 185 places, 560 transitions, 12698 flow. Second operand 5 states and 537 transitions. [2023-08-30 20:18:08,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 679 transitions, 15822 flow [2023-08-30 20:18:13,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 679 transitions, 15218 flow, removed 82 selfloop flow, removed 6 redundant places. [2023-08-30 20:18:13,141 INFO L231 Difference]: Finished difference. Result has 183 places, 541 transitions, 12100 flow [2023-08-30 20:18:13,142 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-08-30 20:18:13,142 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 145 predicate places. [2023-08-30 20:18:13,142 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 541 transitions, 12100 flow [2023-08-30 20:18:13,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.4) internal successors, (954), 10 states have internal predecessors, (954), 0 states have call successors, (0), 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-08-30 20:18:13,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:18:13,142 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-08-30 20:18:13,149 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-08-30 20:18:13,343 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-08-30 20:18:13,343 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-08-30 20:18:13,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:18:13,343 INFO L85 PathProgramCache]: Analyzing trace with hash -210520731, now seen corresponding path program 9 times [2023-08-30 20:18:13,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:18:13,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415675086] [2023-08-30 20:18:13,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:18:13,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:18:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:18:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:18:13,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:18:13,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415675086] [2023-08-30 20:18:13,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415675086] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:18:13,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:18:13,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:18:13,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030906428] [2023-08-30 20:18:13,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:18:13,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:18:13,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:18:13,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:18:13,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:18:13,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 20:18:13,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 541 transitions, 12100 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:18:13,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:18:13,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 20:18:13,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:18:17,126 INFO L130 PetriNetUnfolder]: 18175/24257 cut-off events. [2023-08-30 20:18:17,126 INFO L131 PetriNetUnfolder]: For 603230/605933 co-relation queries the response was YES. [2023-08-30 20:18:17,235 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-08-30 20:18:17,323 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 327 selfloop transitions, 195 changer transitions 61/613 dead transitions. [2023-08-30 20:18:17,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 613 transitions, 14273 flow [2023-08-30 20:18:17,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:18:17,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:18:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2023-08-30 20:18:17,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306930693069307 [2023-08-30 20:18:17,324 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 536 transitions. [2023-08-30 20:18:17,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 536 transitions. [2023-08-30 20:18:17,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:18:17,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 536 transitions. [2023-08-30 20:18:17,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 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-08-30 20:18:17,326 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-08-30 20:18:17,326 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-08-30 20:18:17,326 INFO L175 Difference]: Start difference. First operand has 183 places, 541 transitions, 12100 flow. Second operand 5 states and 536 transitions. [2023-08-30 20:18:17,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 613 transitions, 14273 flow [2023-08-30 20:18:20,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 613 transitions, 13631 flow, removed 142 selfloop flow, removed 8 redundant places. [2023-08-30 20:18:20,091 INFO L231 Difference]: Finished difference. Result has 175 places, 509 transitions, 11199 flow [2023-08-30 20:18:20,091 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-08-30 20:18:20,092 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 137 predicate places. [2023-08-30 20:18:20,092 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 509 transitions, 11199 flow [2023-08-30 20:18:20,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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-08-30 20:18:20,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:18:20,093 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-08-30 20:18:20,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-08-30 20:18:20,093 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-08-30 20:18:20,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:18:20,093 INFO L85 PathProgramCache]: Analyzing trace with hash -667345164, now seen corresponding path program 1 times [2023-08-30 20:18:20,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:18:20,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727470190] [2023-08-30 20:18:20,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:18:20,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:18:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:18:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:18:20,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:18:20,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727470190] [2023-08-30 20:18:20,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727470190] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:18:20,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753087753] [2023-08-30 20:18:20,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:18:20,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:18:20,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:18:20,145 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-08-30 20:18:20,149 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-08-30 20:18:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:18:20,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 20:18:20,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:18:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:18:20,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:18:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:18:20,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753087753] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:18:20,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:18:20,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-30 20:18:20,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633300208] [2023-08-30 20:18:20,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:18:20,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 20:18:20,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:18:20,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 20:18:20,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 20:18:20,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-30 20:18:20,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 509 transitions, 11199 flow. Second operand has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 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-08-30 20:18:20,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:18:20,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-30 20:18:20,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:18:23,373 INFO L130 PetriNetUnfolder]: 17052/22257 cut-off events. [2023-08-30 20:18:23,373 INFO L131 PetriNetUnfolder]: For 507950/509893 co-relation queries the response was YES. [2023-08-30 20:18:23,508 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-08-30 20:18:23,856 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 420 selfloop transitions, 169 changer transitions 1/620 dead transitions. [2023-08-30 20:18:23,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 620 transitions, 14088 flow [2023-08-30 20:18:23,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:18:23,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:18:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 531 transitions. [2023-08-30 20:18:23,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257425742574258 [2023-08-30 20:18:23,858 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 531 transitions. [2023-08-30 20:18:23,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 531 transitions. [2023-08-30 20:18:23,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:18:23,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 531 transitions. [2023-08-30 20:18:23,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 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-08-30 20:18:23,859 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-08-30 20:18:23,859 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-08-30 20:18:23,859 INFO L175 Difference]: Start difference. First operand has 175 places, 509 transitions, 11199 flow. Second operand 5 states and 531 transitions. [2023-08-30 20:18:23,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 620 transitions, 14088 flow [2023-08-30 20:18:26,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 620 transitions, 12458 flow, removed 172 selfloop flow, removed 22 redundant places. [2023-08-30 20:18:26,164 INFO L231 Difference]: Finished difference. Result has 143 places, 525 transitions, 10573 flow [2023-08-30 20:18:26,164 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-08-30 20:18:26,164 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 105 predicate places. [2023-08-30 20:18:26,164 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 525 transitions, 10573 flow [2023-08-30 20:18:26,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 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-08-30 20:18:26,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:18:26,165 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-08-30 20:18:26,169 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-08-30 20:18:26,365 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-08-30 20:18:26,365 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-08-30 20:18:26,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:18:26,366 INFO L85 PathProgramCache]: Analyzing trace with hash -65837510, now seen corresponding path program 2 times [2023-08-30 20:18:26,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:18:26,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865415203] [2023-08-30 20:18:26,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:18:26,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:18:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:18:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:18:26,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:18:26,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865415203] [2023-08-30 20:18:26,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865415203] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:18:26,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866841624] [2023-08-30 20:18:26,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 20:18:26,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:18:26,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:18:26,418 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-08-30 20:18:26,427 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-08-30 20:18:26,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:18:26,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:18:26,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 20:18:26,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:18:26,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:18:26,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:18:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:18:26,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866841624] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:18:26,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:18:26,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 20:18:26,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135578411] [2023-08-30 20:18:26,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:18:26,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 20:18:26,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:18:26,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 20:18:26,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-30 20:18:26,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 202 [2023-08-30 20:18:26,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 525 transitions, 10573 flow. Second operand has 10 states, 10 states have (on average 93.3) internal successors, (933), 10 states have internal predecessors, (933), 0 states have call successors, (0), 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-08-30 20:18:26,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:18:26,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 202 [2023-08-30 20:18:26,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:18:30,064 INFO L130 PetriNetUnfolder]: 19775/25806 cut-off events. [2023-08-30 20:18:30,064 INFO L131 PetriNetUnfolder]: For 471967/473084 co-relation queries the response was YES. [2023-08-30 20:18:30,182 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-08-30 20:18:30,298 INFO L137 encePairwiseOnDemand]: 195/202 looper letters, 443 selfloop transitions, 385 changer transitions 2/842 dead transitions. [2023-08-30 20:18:30,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 842 transitions, 16889 flow [2023-08-30 20:18:30,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-30 20:18:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-30 20:18:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1518 transitions. [2023-08-30 20:18:30,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500990099009901 [2023-08-30 20:18:30,300 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1518 transitions. [2023-08-30 20:18:30,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1518 transitions. [2023-08-30 20:18:30,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:18:30,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1518 transitions. [2023-08-30 20:18:30,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 101.2) internal successors, (1518), 15 states have internal predecessors, (1518), 0 states have call successors, (0), 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-08-30 20:18:30,303 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-08-30 20:18:30,303 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-08-30 20:18:30,304 INFO L175 Difference]: Start difference. First operand has 143 places, 525 transitions, 10573 flow. Second operand 15 states and 1518 transitions. [2023-08-30 20:18:30,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 842 transitions, 16889 flow [2023-08-30 20:18:32,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 842 transitions, 16574 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-30 20:18:32,529 INFO L231 Difference]: Finished difference. Result has 161 places, 620 transitions, 13397 flow [2023-08-30 20:18:32,529 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-08-30 20:18:32,529 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 123 predicate places. [2023-08-30 20:18:32,530 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 620 transitions, 13397 flow [2023-08-30 20:18:32,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.3) internal successors, (933), 10 states have internal predecessors, (933), 0 states have call successors, (0), 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-08-30 20:18:32,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:18:32,530 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-08-30 20:18:32,535 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-08-30 20:18:32,730 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-08-30 20:18:32,731 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-08-30 20:18:32,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:18:32,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1053393848, now seen corresponding path program 3 times [2023-08-30 20:18:32,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:18:32,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413845384] [2023-08-30 20:18:32,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:18:32,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:18:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:18:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 20:18:32,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:18:32,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413845384] [2023-08-30 20:18:32,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413845384] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:18:32,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342469083] [2023-08-30 20:18:32,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 20:18:32,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:18:32,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:18:32,779 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-08-30 20:18:32,806 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-08-30 20:18:32,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 20:18:32,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:18:32,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 20:18:32,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:18:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:18:32,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:18:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:18:32,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342469083] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:18:32,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:18:32,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 20:18:32,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359978333] [2023-08-30 20:18:32,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:18:32,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 20:18:32,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:18:32,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 20:18:32,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-30 20:18:33,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 202 [2023-08-30 20:18:33,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 620 transitions, 13397 flow. Second operand has 10 states, 10 states have (on average 93.2) internal successors, (932), 10 states have internal predecessors, (932), 0 states have call successors, (0), 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-08-30 20:18:33,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:18:33,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 202 [2023-08-30 20:18:33,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:18:37,990 INFO L130 PetriNetUnfolder]: 24929/32605 cut-off events. [2023-08-30 20:18:37,990 INFO L131 PetriNetUnfolder]: For 612389/612946 co-relation queries the response was YES. [2023-08-30 20:18:38,221 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-08-30 20:18:38,366 INFO L137 encePairwiseOnDemand]: 194/202 looper letters, 618 selfloop transitions, 358 changer transitions 1/1001 dead transitions. [2023-08-30 20:18:38,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 1001 transitions, 21666 flow [2023-08-30 20:18:38,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 20:18:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 20:18:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1425 transitions. [2023-08-30 20:18:38,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5038896746817539 [2023-08-30 20:18:38,368 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1425 transitions. [2023-08-30 20:18:38,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1425 transitions. [2023-08-30 20:18:38,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:18:38,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1425 transitions. [2023-08-30 20:18:38,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 101.78571428571429) internal successors, (1425), 14 states have internal predecessors, (1425), 0 states have call successors, (0), 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-08-30 20:18:38,371 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-08-30 20:18:38,372 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-08-30 20:18:38,372 INFO L175 Difference]: Start difference. First operand has 161 places, 620 transitions, 13397 flow. Second operand 14 states and 1425 transitions. [2023-08-30 20:18:38,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 1001 transitions, 21666 flow [2023-08-30 20:18:42,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 1001 transitions, 19189 flow, removed 283 selfloop flow, removed 10 redundant places. [2023-08-30 20:18:42,581 INFO L231 Difference]: Finished difference. Result has 166 places, 742 transitions, 15014 flow [2023-08-30 20:18:42,582 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-08-30 20:18:42,582 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 128 predicate places. [2023-08-30 20:18:42,582 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 742 transitions, 15014 flow [2023-08-30 20:18:42,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.2) internal successors, (932), 10 states have internal predecessors, (932), 0 states have call successors, (0), 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-08-30 20:18:42,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:18:42,582 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-08-30 20:18:42,587 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-08-30 20:18:42,783 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-08-30 20:18:42,783 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-08-30 20:18:42,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:18:42,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1871381985, now seen corresponding path program 1 times [2023-08-30 20:18:42,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:18:42,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083429914] [2023-08-30 20:18:42,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:18:42,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:18:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:18:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:18:43,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:18:43,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083429914] [2023-08-30 20:18:43,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083429914] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:18:43,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902254888] [2023-08-30 20:18:43,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:18:43,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:18:43,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:18:43,009 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-08-30 20:18:43,036 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-08-30 20:18:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:18:43,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 20:18:43,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:18:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:18:43,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:18:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:18:43,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902254888] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:18:43,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:18:43,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 7 [2023-08-30 20:18:43,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553455024] [2023-08-30 20:18:43,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:18:43,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 20:18:43,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:18:43,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 20:18:43,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-30 20:18:43,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 202 [2023-08-30 20:18:43,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 742 transitions, 15014 flow. Second operand has 9 states, 9 states have (on average 105.66666666666667) internal successors, (951), 9 states have internal predecessors, (951), 0 states have call successors, (0), 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-08-30 20:18:43,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:18:43,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 202 [2023-08-30 20:18:43,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:18:51,769 INFO L130 PetriNetUnfolder]: 40667/54062 cut-off events. [2023-08-30 20:18:51,769 INFO L131 PetriNetUnfolder]: For 970693/986750 co-relation queries the response was YES. [2023-08-30 20:18:52,154 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-08-30 20:18:52,406 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 482 selfloop transitions, 559 changer transitions 5/1125 dead transitions. [2023-08-30 20:18:52,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 1125 transitions, 23116 flow [2023-08-30 20:18:52,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 20:18:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 20:18:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1066 transitions. [2023-08-30 20:18:52,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5863586358635864 [2023-08-30 20:18:52,408 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1066 transitions. [2023-08-30 20:18:52,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1066 transitions. [2023-08-30 20:18:52,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:18:52,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1066 transitions. [2023-08-30 20:18:52,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.44444444444444) internal successors, (1066), 9 states have internal predecessors, (1066), 0 states have call successors, (0), 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-08-30 20:18:52,410 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-08-30 20:18:52,410 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-08-30 20:18:52,410 INFO L175 Difference]: Start difference. First operand has 166 places, 742 transitions, 15014 flow. Second operand 9 states and 1066 transitions. [2023-08-30 20:18:52,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 1125 transitions, 23116 flow [2023-08-30 20:18:57,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 1125 transitions, 21178 flow, removed 438 selfloop flow, removed 11 redundant places. [2023-08-30 20:18:57,323 INFO L231 Difference]: Finished difference. Result has 165 places, 1005 transitions, 21197 flow [2023-08-30 20:18:57,324 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-08-30 20:18:57,324 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 127 predicate places. [2023-08-30 20:18:57,325 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 1005 transitions, 21197 flow [2023-08-30 20:18:57,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.66666666666667) internal successors, (951), 9 states have internal predecessors, (951), 0 states have call successors, (0), 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-08-30 20:18:57,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:18:57,325 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-08-30 20:18:57,333 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-08-30 20:18:57,530 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-08-30 20:18:57,531 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-08-30 20:18:57,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:18:57,531 INFO L85 PathProgramCache]: Analyzing trace with hash 787534766, now seen corresponding path program 2 times [2023-08-30 20:18:57,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:18:57,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349237321] [2023-08-30 20:18:57,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:18:57,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:18:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:18:57,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:18:57,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:18:57,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349237321] [2023-08-30 20:18:57,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349237321] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:18:57,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065283380] [2023-08-30 20:18:57,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 20:18:57,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:18:57,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:18:57,609 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-08-30 20:18:57,611 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-08-30 20:18:57,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:18:57,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:18:57,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 20:18:57,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:18:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:18:57,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:18:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:18:57,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065283380] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:18:57,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:18:57,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-08-30 20:18:57,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709348839] [2023-08-30 20:18:57,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:18:57,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 20:18:57,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:18:57,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 20:18:57,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-08-30 20:18:57,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 202 [2023-08-30 20:18:57,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 1005 transitions, 21197 flow. Second operand has 12 states, 12 states have (on average 92.5) internal successors, (1110), 12 states have internal predecessors, (1110), 0 states have call successors, (0), 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-08-30 20:18:57,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:18:57,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 202 [2023-08-30 20:18:57,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:19:17,024 INFO L130 PetriNetUnfolder]: 78598/104797 cut-off events. [2023-08-30 20:19:17,024 INFO L131 PetriNetUnfolder]: For 1577870/1578845 co-relation queries the response was YES. [2023-08-30 20:19:17,682 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-08-30 20:19:18,148 INFO L137 encePairwiseOnDemand]: 194/202 looper letters, 1521 selfloop transitions, 456 changer transitions 0/1997 dead transitions. [2023-08-30 20:19:18,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1997 transitions, 42747 flow [2023-08-30 20:19:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 20:19:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 20:19:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1330 transitions. [2023-08-30 20:19:18,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064737242955065 [2023-08-30 20:19:18,150 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1330 transitions. [2023-08-30 20:19:18,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1330 transitions. [2023-08-30 20:19:18,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:19:18,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1330 transitions. [2023-08-30 20:19:18,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.3076923076923) internal successors, (1330), 13 states have internal predecessors, (1330), 0 states have call successors, (0), 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-08-30 20:19:18,154 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-08-30 20:19:18,155 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-08-30 20:19:18,155 INFO L175 Difference]: Start difference. First operand has 165 places, 1005 transitions, 21197 flow. Second operand 13 states and 1330 transitions. [2023-08-30 20:19:18,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 1997 transitions, 42747 flow [2023-08-30 20:20:30,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 1997 transitions, 40401 flow, removed 1173 selfloop flow, removed 0 redundant places. [2023-08-30 20:20:30,534 INFO L231 Difference]: Finished difference. Result has 187 places, 1278 transitions, 27482 flow [2023-08-30 20:20:30,535 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-08-30 20:20:30,535 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 149 predicate places. [2023-08-30 20:20:30,535 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 1278 transitions, 27482 flow [2023-08-30 20:20:30,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 92.5) internal successors, (1110), 12 states have internal predecessors, (1110), 0 states have call successors, (0), 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-08-30 20:20:30,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:20:30,536 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-08-30 20:20:30,545 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-08-30 20:20:30,741 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-08-30 20:20:30,741 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-08-30 20:20:30,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:20:30,742 INFO L85 PathProgramCache]: Analyzing trace with hash -926111482, now seen corresponding path program 3 times [2023-08-30 20:20:30,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:20:30,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853946593] [2023-08-30 20:20:30,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:20:30,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:20:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:20:30,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:20:30,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:20:30,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853946593] [2023-08-30 20:20:30,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853946593] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:20:30,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820520124] [2023-08-30 20:20:30,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 20:20:30,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:20:30,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:20:30,816 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-08-30 20:20:30,832 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-08-30 20:20:30,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 20:20:30,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:20:30,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 20:20:30,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:20:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:20:31,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:20:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:20:31,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820520124] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:20:31,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:20:31,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-08-30 20:20:31,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674803055] [2023-08-30 20:20:31,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:20:31,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 20:20:31,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:20:31,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 20:20:31,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-08-30 20:20:31,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 202 [2023-08-30 20:20:31,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 1278 transitions, 27482 flow. Second operand has 14 states, 14 states have (on average 91.5) internal successors, (1281), 14 states have internal predecessors, (1281), 0 states have call successors, (0), 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-08-30 20:20:31,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:20:31,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 202 [2023-08-30 20:20:31,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand