/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 13:32:34,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:32:34,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:32:34,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:32:34,635 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:32:34,636 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:32:34,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:32:34,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:32:34,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:32:34,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:32:34,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:32:34,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:32:34,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:32:34,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:32:34,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:32:34,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:32:34,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:32:34,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:32:34,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:32:34,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:32:34,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:32:34,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:32:34,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:32:34,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:32:34,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:32:34,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:32:34,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:32:34,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:32:34,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:32:34,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:32:34,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:32:34,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:32:34,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:32:34,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:32:34,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:32:34,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:32:34,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:32:34,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:32:34,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:32:34,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:32:34,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:32:34,666 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 13:32:34,689 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:32:34,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:32:34,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:32:34,691 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:32:34,691 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:32:34,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:32:34,691 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:32:34,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:32:34,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:32:34,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:32:34,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:32:34,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:32:34,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:32:34,693 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:32:34,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:32:34,693 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:32:34,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:32:34,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:32:34,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:32:34,693 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 13:32:34,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:32:34,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:32:34,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:32:34,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:32:34,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:32:34,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:32:34,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:32:34,694 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 13:32:34,694 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 13:32:34,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:32:34,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:32:34,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:32:34,967 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:32:34,967 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:32:34,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-12-13 13:32:36,028 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:32:36,199 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:32:36,199 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-12-13 13:32:36,225 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/291e2367a/f98a0d727bc54a018e28f5edec1c2422/FLAGacf078b0a [2022-12-13 13:32:36,237 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/291e2367a/f98a0d727bc54a018e28f5edec1c2422 [2022-12-13 13:32:36,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:32:36,240 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 13:32:36,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:32:36,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:32:36,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:32:36,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:32:36" (1/1) ... [2022-12-13 13:32:36,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0cd795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:36, skipping insertion in model container [2022-12-13 13:32:36,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:32:36" (1/1) ... [2022-12-13 13:32:36,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:32:36,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:32:36,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:32:36,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:32:36,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:32:36,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:32:36,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:32:36,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:32:36,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:32:36,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:32:36,405 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2022-12-13 13:32:36,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:32:36,418 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:32:36,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:32:36,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:32:36,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:32:36,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:32:36,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:32:36,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:32:36,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:32:36,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:32:36,451 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2022-12-13 13:32:36,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:32:36,463 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:32:36,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:36 WrapperNode [2022-12-13 13:32:36,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:32:36,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:32:36,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:32:36,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:32:36,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:36" (1/1) ... [2022-12-13 13:32:36,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:36" (1/1) ... [2022-12-13 13:32:36,505 INFO L138 Inliner]: procedures = 22, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 133 [2022-12-13 13:32:36,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:32:36,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:32:36,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:32:36,506 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:32:36,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:36" (1/1) ... [2022-12-13 13:32:36,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:36" (1/1) ... [2022-12-13 13:32:36,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:36" (1/1) ... [2022-12-13 13:32:36,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:36" (1/1) ... [2022-12-13 13:32:36,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:36" (1/1) ... [2022-12-13 13:32:36,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:36" (1/1) ... [2022-12-13 13:32:36,534 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:36" (1/1) ... [2022-12-13 13:32:36,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:36" (1/1) ... [2022-12-13 13:32:36,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:32:36,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:32:36,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:32:36,547 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:32:36,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:36" (1/1) ... [2022-12-13 13:32:36,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:32:36,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:32:36,608 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:32:36,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:32:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:32:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 13:32:36,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 13:32:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 13:32:36,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 13:32:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 13:32:36,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 13:32:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 13:32:36,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 13:32:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:32:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:32:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:32:36,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:32:36,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:32:36,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:32:36,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:32:36,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:32:36,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:32:36,685 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 13:32:36,812 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 13:32:36,824 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:32:37,051 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 13:32:37,107 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:32:37,107 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 13:32:37,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:32:37 BoogieIcfgContainer [2022-12-13 13:32:37,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:32:37,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:32:37,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:32:37,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:32:37,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:32:36" (1/3) ... [2022-12-13 13:32:37,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363ad839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:32:37, skipping insertion in model container [2022-12-13 13:32:37,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:36" (2/3) ... [2022-12-13 13:32:37,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363ad839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:32:37, skipping insertion in model container [2022-12-13 13:32:37,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:32:37" (3/3) ... [2022-12-13 13:32:37,115 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-12-13 13:32:37,127 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:32:37,127 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 13:32:37,127 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:32:37,203 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 13:32:37,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 124 transitions, 280 flow [2022-12-13 13:32:37,294 INFO L130 PetriNetUnfolder]: 10/120 cut-off events. [2022-12-13 13:32:37,295 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 13:32:37,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 120 events. 10/120 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-13 13:32:37,299 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 124 transitions, 280 flow [2022-12-13 13:32:37,302 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 108 transitions, 240 flow [2022-12-13 13:32:37,303 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:37,323 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 108 transitions, 240 flow [2022-12-13 13:32:37,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 108 transitions, 240 flow [2022-12-13 13:32:37,368 INFO L130 PetriNetUnfolder]: 10/108 cut-off events. [2022-12-13 13:32:37,368 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 13:32:37,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 108 events. 10/108 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-13 13:32:37,371 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 108 transitions, 240 flow [2022-12-13 13:32:37,371 INFO L226 LiptonReduction]: Number of co-enabled transitions 1224 [2022-12-13 13:32:40,680 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-13 13:32:40,696 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:32:40,700 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2ef96c32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 13:32:40,700 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 13:32:40,706 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-13 13:32:40,707 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 13:32:40,707 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:40,707 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:40,707 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:32:40,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:40,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2052267608, now seen corresponding path program 1 times [2022-12-13 13:32:40,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:40,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678682850] [2022-12-13 13:32:40,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:40,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:41,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:41,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:41,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678682850] [2022-12-13 13:32:41,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678682850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:41,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:41,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:32:41,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153691767] [2022-12-13 13:32:41,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:41,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:32:41,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:41,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:32:41,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:32:41,090 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 13:32:41,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:41,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:41,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 13:32:41,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:41,187 INFO L130 PetriNetUnfolder]: 431/611 cut-off events. [2022-12-13 13:32:41,187 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-13 13:32:41,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 611 events. 431/611 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1712 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 928. Up to 405 conditions per place. [2022-12-13 13:32:41,194 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 39 selfloop transitions, 3 changer transitions 3/45 dead transitions. [2022-12-13 13:32:41,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 225 flow [2022-12-13 13:32:41,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:32:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:32:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-13 13:32:41,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-13 13:32:41,205 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 74 flow. Second operand 3 states and 48 transitions. [2022-12-13 13:32:41,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 225 flow [2022-12-13 13:32:41,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 45 transitions, 195 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-13 13:32:41,210 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 81 flow [2022-12-13 13:32:41,211 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2022-12-13 13:32:41,213 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2022-12-13 13:32:41,213 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:41,214 INFO L89 Accepts]: Start accepts. Operand has 29 places, 27 transitions, 81 flow [2022-12-13 13:32:41,215 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:41,216 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:41,216 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 27 transitions, 81 flow [2022-12-13 13:32:41,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 27 transitions, 81 flow [2022-12-13 13:32:41,218 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([403] L79-->L79: Formula: (and (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (< 0 v_~counter~0_84) 1 0)) (< v_~j2~0_33 v_~M2~0_14) (= (+ v_~counter~0_83 1) v_~counter~0_84) (= (+ v_~j2~0_33 1) v_~j2~0_32) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|)) InVars {~counter~0=v_~counter~0_84, ~M2~0=v_~M2~0_14, ~j2~0=v_~j2~0_33} OutVars{~counter~0=v_~counter~0_83, ~M2~0=v_~M2~0_14, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_5|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_5|, ~j2~0=v_~j2~0_32, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][18], [130#true, 33#L67true, Black: 132#(= ~counter~0 0), 32#L56true, 45#L44true, 105#L79true, 68#L98-4true]) [2022-12-13 13:32:41,219 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-13 13:32:41,219 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-13 13:32:41,219 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 13:32:41,219 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 13:32:41,221 INFO L130 PetriNetUnfolder]: 17/53 cut-off events. [2022-12-13 13:32:41,221 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:32:41,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 53 events. 17/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 51. Up to 20 conditions per place. [2022-12-13 13:32:41,224 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 27 transitions, 81 flow [2022-12-13 13:32:41,224 INFO L226 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-13 13:32:41,224 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:32:41,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 13:32:41,225 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 81 flow [2022-12-13 13:32:41,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:41,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:41,226 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:41,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:32:41,226 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:32:41,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:41,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1346749667, now seen corresponding path program 1 times [2022-12-13 13:32:41,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:41,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87764956] [2022-12-13 13:32:41,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:41,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:41,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:41,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87764956] [2022-12-13 13:32:41,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87764956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:41,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:41,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:32:41,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329471771] [2022-12-13 13:32:41,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:41,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:32:41,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:41,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:32:41,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:32:41,431 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 13:32:41,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:41,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:41,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 13:32:41,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:41,543 INFO L130 PetriNetUnfolder]: 487/709 cut-off events. [2022-12-13 13:32:41,544 INFO L131 PetriNetUnfolder]: For 183/183 co-relation queries the response was YES. [2022-12-13 13:32:41,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1718 conditions, 709 events. 487/709 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2194 event pairs, 45 based on Foata normal form. 24/733 useless extension candidates. Maximal degree in co-relation 584. Up to 369 conditions per place. [2022-12-13 13:32:41,548 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 51 selfloop transitions, 4 changer transitions 6/61 dead transitions. [2022-12-13 13:32:41,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 61 transitions, 292 flow [2022-12-13 13:32:41,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:32:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:32:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-13 13:32:41,549 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-13 13:32:41,549 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 81 flow. Second operand 4 states and 61 transitions. [2022-12-13 13:32:41,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 61 transitions, 292 flow [2022-12-13 13:32:41,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 61 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:32:41,552 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 102 flow [2022-12-13 13:32:41,552 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2022-12-13 13:32:41,553 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-13 13:32:41,553 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:41,553 INFO L89 Accepts]: Start accepts. Operand has 32 places, 29 transitions, 102 flow [2022-12-13 13:32:41,554 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:41,554 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:41,554 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 29 transitions, 102 flow [2022-12-13 13:32:41,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 102 flow [2022-12-13 13:32:41,576 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([403] L79-->L79: Formula: (and (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (< 0 v_~counter~0_84) 1 0)) (< v_~j2~0_33 v_~M2~0_14) (= (+ v_~counter~0_83 1) v_~counter~0_84) (= (+ v_~j2~0_33 1) v_~j2~0_32) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|)) InVars {~counter~0=v_~counter~0_84, ~M2~0=v_~M2~0_14, ~j2~0=v_~j2~0_33} OutVars{~counter~0=v_~counter~0_83, ~M2~0=v_~M2~0_14, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_5|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_5|, ~j2~0=v_~j2~0_32, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][20], [33#L67true, Black: 132#(= ~counter~0 0), 32#L56true, 134#true, 45#L44true, Black: 136#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 105#L79true, 68#L98-4true]) [2022-12-13 13:32:41,576 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-13 13:32:41,576 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 13:32:41,576 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-13 13:32:41,576 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 13:32:41,580 INFO L130 PetriNetUnfolder]: 27/81 cut-off events. [2022-12-13 13:32:41,580 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 13:32:41,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 81 events. 27/81 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 170 event pairs, 1 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 82. Up to 28 conditions per place. [2022-12-13 13:32:41,581 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 29 transitions, 102 flow [2022-12-13 13:32:41,581 INFO L226 LiptonReduction]: Number of co-enabled transitions 194 [2022-12-13 13:32:41,582 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:32:41,583 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 13:32:41,584 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 102 flow [2022-12-13 13:32:41,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:41,584 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:41,584 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:41,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:32:41,584 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:32:41,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:41,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1500505410, now seen corresponding path program 1 times [2022-12-13 13:32:41,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:41,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923482847] [2022-12-13 13:32:41,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:41,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:41,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:41,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923482847] [2022-12-13 13:32:41,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923482847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:41,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:41,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:32:41,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377269029] [2022-12-13 13:32:41,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:41,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:32:41,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:41,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:32:41,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:32:41,751 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 13:32:41,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:41,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:41,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 13:32:41,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:41,868 INFO L130 PetriNetUnfolder]: 617/887 cut-off events. [2022-12-13 13:32:41,868 INFO L131 PetriNetUnfolder]: For 452/452 co-relation queries the response was YES. [2022-12-13 13:32:41,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2356 conditions, 887 events. 617/887 cut-off events. For 452/452 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2767 event pairs, 119 based on Foata normal form. 38/925 useless extension candidates. Maximal degree in co-relation 812. Up to 507 conditions per place. [2022-12-13 13:32:41,872 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 55 selfloop transitions, 7 changer transitions 1/63 dead transitions. [2022-12-13 13:32:41,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 63 transitions, 334 flow [2022-12-13 13:32:41,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:32:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:32:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-13 13:32:41,875 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.59 [2022-12-13 13:32:41,875 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 102 flow. Second operand 4 states and 59 transitions. [2022-12-13 13:32:41,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 63 transitions, 334 flow [2022-12-13 13:32:41,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 63 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:32:41,877 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 148 flow [2022-12-13 13:32:41,877 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2022-12-13 13:32:41,878 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-13 13:32:41,878 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:41,878 INFO L89 Accepts]: Start accepts. Operand has 36 places, 33 transitions, 148 flow [2022-12-13 13:32:41,880 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:41,880 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:41,880 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 33 transitions, 148 flow [2022-12-13 13:32:41,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 33 transitions, 148 flow [2022-12-13 13:32:41,884 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([403] L79-->L79: Formula: (and (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (< 0 v_~counter~0_84) 1 0)) (< v_~j2~0_33 v_~M2~0_14) (= (+ v_~counter~0_83 1) v_~counter~0_84) (= (+ v_~j2~0_33 1) v_~j2~0_32) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|)) InVars {~counter~0=v_~counter~0_84, ~M2~0=v_~M2~0_14, ~j2~0=v_~j2~0_33} OutVars{~counter~0=v_~counter~0_83, ~M2~0=v_~M2~0_14, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_5|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_5|, ~j2~0=v_~j2~0_32, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][24], [33#L67true, Black: 147#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 132#(= ~counter~0 0), Black: 143#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 141#true, 32#L56true, 45#L44true, Black: 136#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 105#L79true, 68#L98-4true]) [2022-12-13 13:32:41,884 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-13 13:32:41,885 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 13:32:41,885 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-13 13:32:41,885 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-13 13:32:41,885 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([403] L79-->L79: Formula: (and (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (< 0 v_~counter~0_84) 1 0)) (< v_~j2~0_33 v_~M2~0_14) (= (+ v_~counter~0_83 1) v_~counter~0_84) (= (+ v_~j2~0_33 1) v_~j2~0_32) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|)) InVars {~counter~0=v_~counter~0_84, ~M2~0=v_~M2~0_14, ~j2~0=v_~j2~0_33} OutVars{~counter~0=v_~counter~0_83, ~M2~0=v_~M2~0_14, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_5|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_5|, ~j2~0=v_~j2~0_32, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][24], [33#L67true, Black: 147#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 132#(= ~counter~0 0), 141#true, Black: 143#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 32#L56true, 66#thread1EXITtrue, 105#L79true, Black: 136#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 68#L98-4true]) [2022-12-13 13:32:41,886 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-13 13:32:41,886 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-13 13:32:41,889 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-13 13:32:41,905 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-13 13:32:41,909 INFO L130 PetriNetUnfolder]: 56/142 cut-off events. [2022-12-13 13:32:41,909 INFO L131 PetriNetUnfolder]: For 79/94 co-relation queries the response was YES. [2022-12-13 13:32:41,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 142 events. 56/142 cut-off events. For 79/94 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 483 event pairs, 10 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 239. Up to 56 conditions per place. [2022-12-13 13:32:41,910 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 33 transitions, 148 flow [2022-12-13 13:32:41,910 INFO L226 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-13 13:32:41,911 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:32:41,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 13:32:41,912 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 148 flow [2022-12-13 13:32:41,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:41,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:41,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:41,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:32:41,913 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:32:41,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:41,913 INFO L85 PathProgramCache]: Analyzing trace with hash 789454326, now seen corresponding path program 2 times [2022-12-13 13:32:41,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:41,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348477107] [2022-12-13 13:32:41,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:41,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:42,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:42,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348477107] [2022-12-13 13:32:42,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348477107] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:32:42,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343455424] [2022-12-13 13:32:42,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:32:42,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:32:42,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:32:42,046 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:32:42,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:32:42,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:32:42,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:32:42,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 13:32:42,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:32:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:42,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:32:42,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343455424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:42,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:32:42,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-13 13:32:42,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797256136] [2022-12-13 13:32:42,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:42,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:32:42,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:42,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:32:42,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:32:42,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 13:32:42,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:42,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:42,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 13:32:42,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:42,518 INFO L130 PetriNetUnfolder]: 1101/1577 cut-off events. [2022-12-13 13:32:42,518 INFO L131 PetriNetUnfolder]: For 2201/2201 co-relation queries the response was YES. [2022-12-13 13:32:42,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4884 conditions, 1577 events. 1101/1577 cut-off events. For 2201/2201 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6028 event pairs, 97 based on Foata normal form. 38/1615 useless extension candidates. Maximal degree in co-relation 2657. Up to 813 conditions per place. [2022-12-13 13:32:42,526 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 71 selfloop transitions, 3 changer transitions 1/75 dead transitions. [2022-12-13 13:32:42,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 75 transitions, 475 flow [2022-12-13 13:32:42,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:32:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:32:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-13 13:32:42,533 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.59 [2022-12-13 13:32:42,533 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 148 flow. Second operand 4 states and 59 transitions. [2022-12-13 13:32:42,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 75 transitions, 475 flow [2022-12-13 13:32:42,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 75 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:32:42,538 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 171 flow [2022-12-13 13:32:42,539 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2022-12-13 13:32:42,540 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2022-12-13 13:32:42,540 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:42,540 INFO L89 Accepts]: Start accepts. Operand has 40 places, 35 transitions, 171 flow [2022-12-13 13:32:42,541 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:42,541 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:42,541 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 35 transitions, 171 flow [2022-12-13 13:32:42,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 171 flow [2022-12-13 13:32:42,548 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([403] L79-->L79: Formula: (and (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (< 0 v_~counter~0_84) 1 0)) (< v_~j2~0_33 v_~M2~0_14) (= (+ v_~counter~0_83 1) v_~counter~0_84) (= (+ v_~j2~0_33 1) v_~j2~0_32) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|)) InVars {~counter~0=v_~counter~0_84, ~M2~0=v_~M2~0_14, ~j2~0=v_~j2~0_33} OutVars{~counter~0=v_~counter~0_83, ~M2~0=v_~M2~0_14, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_5|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_5|, ~j2~0=v_~j2~0_32, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][25], [Black: 147#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 33#L67true, Black: 132#(= ~counter~0 0), Black: 143#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 32#L56true, 66#thread1EXITtrue, 105#L79true, Black: 136#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 68#L98-4true, Black: 221#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~0) (= ~N2~0 ~N1~0)), 150#true, Black: 158#(and (<= ~i2~0 0) (<= 0 ~i1~0) (= ~N2~0 ~N1~0))]) [2022-12-13 13:32:42,550 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-13 13:32:42,551 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-13 13:32:42,551 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-13 13:32:42,551 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-13 13:32:42,559 INFO L130 PetriNetUnfolder]: 89/243 cut-off events. [2022-12-13 13:32:42,559 INFO L131 PetriNetUnfolder]: For 179/201 co-relation queries the response was YES. [2022-12-13 13:32:42,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 243 events. 89/243 cut-off events. For 179/201 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1096 event pairs, 17 based on Foata normal form. 5/209 useless extension candidates. Maximal degree in co-relation 433. Up to 84 conditions per place. [2022-12-13 13:32:42,561 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 35 transitions, 171 flow [2022-12-13 13:32:42,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 272 [2022-12-13 13:32:42,563 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:32:42,566 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 13:32:42,566 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 171 flow [2022-12-13 13:32:42,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:42,566 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:42,566 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:42,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:32:42,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:32:42,772 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:32:42,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:42,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1115988494, now seen corresponding path program 3 times [2022-12-13 13:32:42,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:42,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814743044] [2022-12-13 13:32:42,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:42,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:42,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:42,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814743044] [2022-12-13 13:32:42,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814743044] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:32:42,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248834573] [2022-12-13 13:32:42,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:32:42,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:32:42,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:32:42,911 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:32:42,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:32:42,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 13:32:42,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:32:42,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 13:32:42,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:32:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:43,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:32:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:43,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248834573] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 13:32:43,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:32:43,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 8 [2022-12-13 13:32:43,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375745862] [2022-12-13 13:32:43,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:43,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:32:43,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:43,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:32:43,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:32:43,097 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 13:32:43,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:43,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:43,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 13:32:43,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:43,321 INFO L130 PetriNetUnfolder]: 1627/2339 cut-off events. [2022-12-13 13:32:43,321 INFO L131 PetriNetUnfolder]: For 3772/3772 co-relation queries the response was YES. [2022-12-13 13:32:43,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8153 conditions, 2339 events. 1627/2339 cut-off events. For 3772/3772 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9272 event pairs, 429 based on Foata normal form. 92/2431 useless extension candidates. Maximal degree in co-relation 2038. Up to 1045 conditions per place. [2022-12-13 13:32:43,333 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 67 selfloop transitions, 8 changer transitions 0/75 dead transitions. [2022-12-13 13:32:43,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 75 transitions, 481 flow [2022-12-13 13:32:43,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:32:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:32:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-13 13:32:43,336 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.63 [2022-12-13 13:32:43,336 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 171 flow. Second operand 4 states and 63 transitions. [2022-12-13 13:32:43,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 75 transitions, 481 flow [2022-12-13 13:32:43,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 75 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:32:43,341 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 222 flow [2022-12-13 13:32:43,341 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2022-12-13 13:32:43,343 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2022-12-13 13:32:43,343 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:43,343 INFO L89 Accepts]: Start accepts. Operand has 44 places, 38 transitions, 222 flow [2022-12-13 13:32:43,344 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:43,344 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:43,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 222 flow [2022-12-13 13:32:43,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 222 flow [2022-12-13 13:32:43,359 INFO L130 PetriNetUnfolder]: 78/277 cut-off events. [2022-12-13 13:32:43,359 INFO L131 PetriNetUnfolder]: For 351/386 co-relation queries the response was YES. [2022-12-13 13:32:43,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 277 events. 78/277 cut-off events. For 351/386 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1500 event pairs, 16 based on Foata normal form. 9/251 useless extension candidates. Maximal degree in co-relation 512. Up to 91 conditions per place. [2022-12-13 13:32:43,361 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 222 flow [2022-12-13 13:32:43,361 INFO L226 LiptonReduction]: Number of co-enabled transitions 324 [2022-12-13 13:32:43,363 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:32:43,364 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 13:32:43,364 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 222 flow [2022-12-13 13:32:43,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:43,364 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:43,364 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:43,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 13:32:43,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:32:43,571 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:32:43,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1067262371, now seen corresponding path program 2 times [2022-12-13 13:32:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:43,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264926972] [2022-12-13 13:32:43,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:43,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:43,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:43,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264926972] [2022-12-13 13:32:43,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264926972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:43,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:43,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:32:43,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381235688] [2022-12-13 13:32:43,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:43,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:32:43,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:43,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:32:43,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:32:43,736 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 13:32:43,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:43,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:43,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 13:32:43,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:44,028 INFO L130 PetriNetUnfolder]: 2139/3089 cut-off events. [2022-12-13 13:32:44,028 INFO L131 PetriNetUnfolder]: For 9457/9457 co-relation queries the response was YES. [2022-12-13 13:32:44,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11756 conditions, 3089 events. 2139/3089 cut-off events. For 9457/9457 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13432 event pairs, 357 based on Foata normal form. 46/3135 useless extension candidates. Maximal degree in co-relation 4347. Up to 1783 conditions per place. [2022-12-13 13:32:44,043 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 92 selfloop transitions, 8 changer transitions 3/103 dead transitions. [2022-12-13 13:32:44,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 103 transitions, 777 flow [2022-12-13 13:32:44,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:32:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:32:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-12-13 13:32:44,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.624 [2022-12-13 13:32:44,044 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 222 flow. Second operand 5 states and 78 transitions. [2022-12-13 13:32:44,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 103 transitions, 777 flow [2022-12-13 13:32:44,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 103 transitions, 777 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 13:32:44,050 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 285 flow [2022-12-13 13:32:44,051 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2022-12-13 13:32:44,052 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2022-12-13 13:32:44,052 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:44,053 INFO L89 Accepts]: Start accepts. Operand has 50 places, 43 transitions, 285 flow [2022-12-13 13:32:44,056 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:44,056 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:44,056 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 43 transitions, 285 flow [2022-12-13 13:32:44,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 43 transitions, 285 flow [2022-12-13 13:32:44,078 INFO L130 PetriNetUnfolder]: 134/438 cut-off events. [2022-12-13 13:32:44,078 INFO L131 PetriNetUnfolder]: For 644/705 co-relation queries the response was YES. [2022-12-13 13:32:44,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 438 events. 134/438 cut-off events. For 644/705 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2773 event pairs, 36 based on Foata normal form. 10/391 useless extension candidates. Maximal degree in co-relation 981. Up to 136 conditions per place. [2022-12-13 13:32:44,081 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 43 transitions, 285 flow [2022-12-13 13:32:44,082 INFO L226 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-13 13:32:44,099 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:32:44,101 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-13 13:32:44,101 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 285 flow [2022-12-13 13:32:44,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:44,101 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:44,101 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:44,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:32:44,101 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:32:44,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:44,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1458812427, now seen corresponding path program 3 times [2022-12-13 13:32:44,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:44,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288221816] [2022-12-13 13:32:44,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:44,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:44,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:44,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288221816] [2022-12-13 13:32:44,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288221816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:44,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:44,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:32:44,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418345392] [2022-12-13 13:32:44,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:44,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:32:44,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:44,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:32:44,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:32:44,214 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 13:32:44,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:44,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:44,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 13:32:44,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:44,511 INFO L130 PetriNetUnfolder]: 2645/3915 cut-off events. [2022-12-13 13:32:44,511 INFO L131 PetriNetUnfolder]: For 13271/13271 co-relation queries the response was YES. [2022-12-13 13:32:44,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16446 conditions, 3915 events. 2645/3915 cut-off events. For 13271/13271 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 18255 event pairs, 667 based on Foata normal form. 2/3917 useless extension candidates. Maximal degree in co-relation 7513. Up to 2347 conditions per place. [2022-12-13 13:32:44,532 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 86 selfloop transitions, 9 changer transitions 7/102 dead transitions. [2022-12-13 13:32:44,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 102 transitions, 818 flow [2022-12-13 13:32:44,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:32:44,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:32:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-13 13:32:44,533 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.584 [2022-12-13 13:32:44,533 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 285 flow. Second operand 5 states and 73 transitions. [2022-12-13 13:32:44,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 102 transitions, 818 flow [2022-12-13 13:32:44,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 102 transitions, 818 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 13:32:44,539 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 376 flow [2022-12-13 13:32:44,539 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=376, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2022-12-13 13:32:44,539 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2022-12-13 13:32:44,540 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:44,540 INFO L89 Accepts]: Start accepts. Operand has 56 places, 49 transitions, 376 flow [2022-12-13 13:32:44,541 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:44,541 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:44,541 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 49 transitions, 376 flow [2022-12-13 13:32:44,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 49 transitions, 376 flow [2022-12-13 13:32:44,570 INFO L130 PetriNetUnfolder]: 164/570 cut-off events. [2022-12-13 13:32:44,570 INFO L131 PetriNetUnfolder]: For 1042/1139 co-relation queries the response was YES. [2022-12-13 13:32:44,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1677 conditions, 570 events. 164/570 cut-off events. For 1042/1139 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4010 event pairs, 40 based on Foata normal form. 14/521 useless extension candidates. Maximal degree in co-relation 1355. Up to 180 conditions per place. [2022-12-13 13:32:44,574 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 49 transitions, 376 flow [2022-12-13 13:32:44,574 INFO L226 LiptonReduction]: Number of co-enabled transitions 478 [2022-12-13 13:32:44,575 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:32:44,576 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 13:32:44,576 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 376 flow [2022-12-13 13:32:44,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:44,576 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:44,576 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:44,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:32:44,576 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:32:44,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:44,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1327461455, now seen corresponding path program 4 times [2022-12-13 13:32:44,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:44,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986550909] [2022-12-13 13:32:44,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:44,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:44,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:44,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986550909] [2022-12-13 13:32:44,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986550909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:44,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:44,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:32:44,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802735444] [2022-12-13 13:32:44,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:44,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:32:44,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:44,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:32:44,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:32:44,664 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 13:32:44,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 376 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:44,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:44,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 13:32:44,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:44,981 INFO L130 PetriNetUnfolder]: 2491/3681 cut-off events. [2022-12-13 13:32:44,982 INFO L131 PetriNetUnfolder]: For 15942/15942 co-relation queries the response was YES. [2022-12-13 13:32:44,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16461 conditions, 3681 events. 2491/3681 cut-off events. For 15942/15942 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 16627 event pairs, 1059 based on Foata normal form. 80/3761 useless extension candidates. Maximal degree in co-relation 7250. Up to 3305 conditions per place. [2022-12-13 13:32:45,016 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 59 selfloop transitions, 6 changer transitions 15/80 dead transitions. [2022-12-13 13:32:45,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 80 transitions, 688 flow [2022-12-13 13:32:45,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:32:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:32:45,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-13 13:32:45,018 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-13 13:32:45,018 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 376 flow. Second operand 4 states and 56 transitions. [2022-12-13 13:32:45,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 80 transitions, 688 flow [2022-12-13 13:32:45,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 80 transitions, 688 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 13:32:45,027 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 391 flow [2022-12-13 13:32:45,027 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2022-12-13 13:32:45,028 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 26 predicate places. [2022-12-13 13:32:45,028 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:45,028 INFO L89 Accepts]: Start accepts. Operand has 60 places, 48 transitions, 391 flow [2022-12-13 13:32:45,029 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:45,029 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:45,029 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 48 transitions, 391 flow [2022-12-13 13:32:45,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 48 transitions, 391 flow [2022-12-13 13:32:45,055 INFO L130 PetriNetUnfolder]: 157/515 cut-off events. [2022-12-13 13:32:45,055 INFO L131 PetriNetUnfolder]: For 1225/1328 co-relation queries the response was YES. [2022-12-13 13:32:45,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 515 events. 157/515 cut-off events. For 1225/1328 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3387 event pairs, 33 based on Foata normal form. 13/476 useless extension candidates. Maximal degree in co-relation 1379. Up to 186 conditions per place. [2022-12-13 13:32:45,059 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 48 transitions, 391 flow [2022-12-13 13:32:45,059 INFO L226 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-13 13:32:45,060 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:32:45,062 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 13:32:45,062 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 391 flow [2022-12-13 13:32:45,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:45,062 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:45,062 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:45,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:32:45,062 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:32:45,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:45,062 INFO L85 PathProgramCache]: Analyzing trace with hash -813951195, now seen corresponding path program 1 times [2022-12-13 13:32:45,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:45,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198835079] [2022-12-13 13:32:45,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:45,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:32:45,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:45,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198835079] [2022-12-13 13:32:45,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198835079] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:32:45,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352325278] [2022-12-13 13:32:45,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:45,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:32:45,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:32:45,172 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:32:45,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:32:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:45,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 13:32:45,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:32:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:45,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:32:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:45,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352325278] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:32:45,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:32:45,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 2, 2] total 6 [2022-12-13 13:32:45,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435493112] [2022-12-13 13:32:45,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:32:45,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:32:45,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:45,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:32:45,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:32:45,320 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 13:32:45,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 391 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:45,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:45,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 13:32:45,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:45,873 INFO L130 PetriNetUnfolder]: 4103/5960 cut-off events. [2022-12-13 13:32:45,873 INFO L131 PetriNetUnfolder]: For 29843/29843 co-relation queries the response was YES. [2022-12-13 13:32:45,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27630 conditions, 5960 events. 4103/5960 cut-off events. For 29843/29843 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 29233 event pairs, 853 based on Foata normal form. 886/6846 useless extension candidates. Maximal degree in co-relation 11835. Up to 2331 conditions per place. [2022-12-13 13:32:45,895 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 127 selfloop transitions, 38 changer transitions 12/177 dead transitions. [2022-12-13 13:32:45,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 177 transitions, 1506 flow [2022-12-13 13:32:45,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:32:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:32:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2022-12-13 13:32:45,896 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.685 [2022-12-13 13:32:45,896 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 391 flow. Second operand 8 states and 137 transitions. [2022-12-13 13:32:45,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 177 transitions, 1506 flow [2022-12-13 13:32:45,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 177 transitions, 1427 flow, removed 33 selfloop flow, removed 3 redundant places. [2022-12-13 13:32:45,915 INFO L231 Difference]: Finished difference. Result has 68 places, 76 transitions, 835 flow [2022-12-13 13:32:45,915 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=835, PETRI_PLACES=68, PETRI_TRANSITIONS=76} [2022-12-13 13:32:45,916 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2022-12-13 13:32:45,916 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:45,916 INFO L89 Accepts]: Start accepts. Operand has 68 places, 76 transitions, 835 flow [2022-12-13 13:32:45,917 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:45,917 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:45,917 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 76 transitions, 835 flow [2022-12-13 13:32:45,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 76 transitions, 835 flow [2022-12-13 13:32:45,958 INFO L130 PetriNetUnfolder]: 281/817 cut-off events. [2022-12-13 13:32:45,959 INFO L131 PetriNetUnfolder]: For 3269/3825 co-relation queries the response was YES. [2022-12-13 13:32:45,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3356 conditions, 817 events. 281/817 cut-off events. For 3269/3825 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5774 event pairs, 63 based on Foata normal form. 22/752 useless extension candidates. Maximal degree in co-relation 2970. Up to 298 conditions per place. [2022-12-13 13:32:45,965 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 76 transitions, 835 flow [2022-12-13 13:32:45,965 INFO L226 LiptonReduction]: Number of co-enabled transitions 838 [2022-12-13 13:32:45,966 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:32:45,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 13:32:45,967 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 76 transitions, 835 flow [2022-12-13 13:32:45,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:45,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:45,967 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:45,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 13:32:46,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:32:46,172 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:32:46,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:46,173 INFO L85 PathProgramCache]: Analyzing trace with hash -740443594, now seen corresponding path program 1 times [2022-12-13 13:32:46,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:46,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824685414] [2022-12-13 13:32:46,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:46,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:32:46,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:46,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824685414] [2022-12-13 13:32:46,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824685414] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:32:46,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185948647] [2022-12-13 13:32:46,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:46,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:32:46,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:32:46,307 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:32:46,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 13:32:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:46,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 13:32:46,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:32:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:32:46,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:32:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:32:46,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185948647] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 13:32:46,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:32:46,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 8 [2022-12-13 13:32:46,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475841918] [2022-12-13 13:32:46,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:46,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:32:46,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:46,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:32:46,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:32:46,473 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 13:32:46,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 76 transitions, 835 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:46,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:46,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 13:32:46,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:46,989 INFO L130 PetriNetUnfolder]: 4330/6290 cut-off events. [2022-12-13 13:32:46,989 INFO L131 PetriNetUnfolder]: For 49110/49110 co-relation queries the response was YES. [2022-12-13 13:32:46,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34652 conditions, 6290 events. 4330/6290 cut-off events. For 49110/49110 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 31295 event pairs, 1033 based on Foata normal form. 212/6502 useless extension candidates. Maximal degree in co-relation 16501. Up to 3186 conditions per place. [2022-12-13 13:32:47,016 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 133 selfloop transitions, 21 changer transitions 2/156 dead transitions. [2022-12-13 13:32:47,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 156 transitions, 1975 flow [2022-12-13 13:32:47,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:32:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:32:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-13 13:32:47,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-13 13:32:47,017 INFO L175 Difference]: Start difference. First operand has 67 places, 76 transitions, 835 flow. Second operand 4 states and 62 transitions. [2022-12-13 13:32:47,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 156 transitions, 1975 flow [2022-12-13 13:32:47,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 156 transitions, 1784 flow, removed 92 selfloop flow, removed 2 redundant places. [2022-12-13 13:32:47,116 INFO L231 Difference]: Finished difference. Result has 70 places, 87 transitions, 946 flow [2022-12-13 13:32:47,116 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=946, PETRI_PLACES=70, PETRI_TRANSITIONS=87} [2022-12-13 13:32:47,117 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 36 predicate places. [2022-12-13 13:32:47,117 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:47,117 INFO L89 Accepts]: Start accepts. Operand has 70 places, 87 transitions, 946 flow [2022-12-13 13:32:47,118 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:47,118 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:47,118 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 87 transitions, 946 flow [2022-12-13 13:32:47,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 87 transitions, 946 flow [2022-12-13 13:32:47,162 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([489] L44-->thread1EXIT: Formula: (and (not (< v_~i1~0_In_1 v_~N1~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~i1~0=v_~i1~0_In_1, ~N1~0=v_~N1~0_In_1} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~i1~0=v_~i1~0_In_1, ~N1~0=v_~N1~0_In_1, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][56], [361#true, 370#true, Black: 132#(= ~counter~0 0), 32#L56true, 91#thread4EXITtrue, 66#thread1EXITtrue, 118#thread3EXITtrue, Black: 136#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 526#(and (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 418#(= ~counter~0 1), Black: 390#(= ~counter~0 0), Black: 528#(and (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~counter~0 0) (= ~N2~0 ~N1~0)), Black: 143#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 524#(and (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (= ~counter~0 1)), 656#(or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))), 68#L98-4true, Black: 221#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~0) (= ~N2~0 ~N1~0)), Black: 158#(and (<= ~i2~0 0) (<= 0 ~i1~0) (= ~N2~0 ~N1~0)), Black: 324#(< ~j2~0 ~M2~0), Black: 224#true, Black: 534#true, Black: 363#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 382#true, Black: 372#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 380#(<= (+ ~i1~0 1) ~N1~0), 355#(or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0)))]) [2022-12-13 13:32:47,163 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-13 13:32:47,163 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 13:32:47,163 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 13:32:47,163 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 13:32:47,178 INFO L130 PetriNetUnfolder]: 313/877 cut-off events. [2022-12-13 13:32:47,178 INFO L131 PetriNetUnfolder]: For 4159/4703 co-relation queries the response was YES. [2022-12-13 13:32:47,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3787 conditions, 877 events. 313/877 cut-off events. For 4159/4703 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6170 event pairs, 51 based on Foata normal form. 16/831 useless extension candidates. Maximal degree in co-relation 3418. Up to 311 conditions per place. [2022-12-13 13:32:47,186 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 87 transitions, 946 flow [2022-12-13 13:32:47,186 INFO L226 LiptonReduction]: Number of co-enabled transitions 872 [2022-12-13 13:32:47,188 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [425] L67-->L67: Formula: (and (= (+ v_~counter~0_92 1) v_~counter~0_91) (< v_~j1~0_23 v_~M1~0_14) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_92, ~j1~0=v_~j1~0_23, ~M1~0=v_~M1~0_14} OutVars{~counter~0=v_~counter~0_91, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_5|, ~M1~0=v_~M1~0_14, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:32:47,216 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:32:47,216 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 13:32:47,216 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 87 transitions, 958 flow [2022-12-13 13:32:47,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:47,216 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:47,217 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:47,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 13:32:47,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:32:47,422 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:32:47,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:47,422 INFO L85 PathProgramCache]: Analyzing trace with hash 631955691, now seen corresponding path program 1 times [2022-12-13 13:32:47,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:47,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439523314] [2022-12-13 13:32:47,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:47,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:47,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:47,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439523314] [2022-12-13 13:32:47,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439523314] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:32:47,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260809303] [2022-12-13 13:32:47,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:47,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:32:47,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:32:47,526 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:32:47,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 13:32:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:47,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 13:32:47,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:32:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:47,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:32:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:47,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260809303] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:32:47,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:32:47,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-12-13 13:32:47,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937059164] [2022-12-13 13:32:47,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:32:47,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:32:47,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:47,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:32:47,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:32:47,685 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 13:32:47,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 87 transitions, 958 flow. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:47,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:47,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 13:32:47,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:48,725 INFO L130 PetriNetUnfolder]: 8317/12099 cut-off events. [2022-12-13 13:32:48,725 INFO L131 PetriNetUnfolder]: For 110715/110715 co-relation queries the response was YES. [2022-12-13 13:32:48,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65979 conditions, 12099 events. 8317/12099 cut-off events. For 110715/110715 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 67624 event pairs, 1781 based on Foata normal form. 682/12781 useless extension candidates. Maximal degree in co-relation 28813. Up to 3939 conditions per place. [2022-12-13 13:32:48,814 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 108 selfloop transitions, 93 changer transitions 3/204 dead transitions. [2022-12-13 13:32:48,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 204 transitions, 2437 flow [2022-12-13 13:32:48,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:32:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:32:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-13 13:32:48,819 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2022-12-13 13:32:48,819 INFO L175 Difference]: Start difference. First operand has 69 places, 87 transitions, 958 flow. Second operand 5 states and 95 transitions. [2022-12-13 13:32:48,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 204 transitions, 2437 flow [2022-12-13 13:32:48,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 204 transitions, 2369 flow, removed 34 selfloop flow, removed 1 redundant places. [2022-12-13 13:32:48,896 INFO L231 Difference]: Finished difference. Result has 74 places, 140 transitions, 1950 flow [2022-12-13 13:32:48,896 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1950, PETRI_PLACES=74, PETRI_TRANSITIONS=140} [2022-12-13 13:32:48,898 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2022-12-13 13:32:48,898 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:48,898 INFO L89 Accepts]: Start accepts. Operand has 74 places, 140 transitions, 1950 flow [2022-12-13 13:32:48,900 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:48,900 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:48,900 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 140 transitions, 1950 flow [2022-12-13 13:32:48,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 140 transitions, 1950 flow [2022-12-13 13:32:49,004 INFO L130 PetriNetUnfolder]: 638/1772 cut-off events. [2022-12-13 13:32:49,004 INFO L131 PetriNetUnfolder]: For 11857/14148 co-relation queries the response was YES. [2022-12-13 13:32:49,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8701 conditions, 1772 events. 638/1772 cut-off events. For 11857/14148 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 14799 event pairs, 105 based on Foata normal form. 27/1680 useless extension candidates. Maximal degree in co-relation 7967. Up to 641 conditions per place. [2022-12-13 13:32:49,021 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 140 transitions, 1950 flow [2022-12-13 13:32:49,021 INFO L226 LiptonReduction]: Number of co-enabled transitions 1542 [2022-12-13 13:32:49,022 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:32:49,023 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 13:32:49,023 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 140 transitions, 1950 flow [2022-12-13 13:32:49,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:49,023 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:49,023 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:49,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 13:32:49,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 13:32:49,242 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:32:49,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:49,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2097253589, now seen corresponding path program 1 times [2022-12-13 13:32:49,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:49,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240716945] [2022-12-13 13:32:49,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:49,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:32:49,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:49,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240716945] [2022-12-13 13:32:49,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240716945] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:32:49,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413000734] [2022-12-13 13:32:49,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:49,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:32:49,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:32:49,431 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:32:49,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 13:32:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:49,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 13:32:49,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:32:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:32:49,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:32:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:32:49,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413000734] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 13:32:49,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:32:49,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 9 [2022-12-13 13:32:49,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076398618] [2022-12-13 13:32:49,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:49,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:32:49,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:49,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:32:49,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:32:49,691 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 13:32:49,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 140 transitions, 1950 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:49,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:49,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 13:32:49,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:50,937 INFO L130 PetriNetUnfolder]: 9687/13963 cut-off events. [2022-12-13 13:32:50,937 INFO L131 PetriNetUnfolder]: For 158627/158627 co-relation queries the response was YES. [2022-12-13 13:32:50,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84165 conditions, 13963 events. 9687/13963 cut-off events. For 158627/158627 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 78178 event pairs, 2131 based on Foata normal form. 406/14369 useless extension candidates. Maximal degree in co-relation 34608. Up to 7299 conditions per place. [2022-12-13 13:32:50,999 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 235 selfloop transitions, 35 changer transitions 6/276 dead transitions. [2022-12-13 13:32:51,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 276 transitions, 4309 flow [2022-12-13 13:32:51,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:32:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:32:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-13 13:32:51,001 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2022-12-13 13:32:51,001 INFO L175 Difference]: Start difference. First operand has 74 places, 140 transitions, 1950 flow. Second operand 5 states and 66 transitions. [2022-12-13 13:32:51,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 276 transitions, 4309 flow [2022-12-13 13:32:51,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 276 transitions, 4043 flow, removed 133 selfloop flow, removed 0 redundant places. [2022-12-13 13:32:51,123 INFO L231 Difference]: Finished difference. Result has 81 places, 171 transitions, 2421 flow [2022-12-13 13:32:51,124 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1830, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2421, PETRI_PLACES=81, PETRI_TRANSITIONS=171} [2022-12-13 13:32:51,125 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 47 predicate places. [2022-12-13 13:32:51,125 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:51,125 INFO L89 Accepts]: Start accepts. Operand has 81 places, 171 transitions, 2421 flow [2022-12-13 13:32:51,128 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:51,128 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:51,128 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 171 transitions, 2421 flow [2022-12-13 13:32:51,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 171 transitions, 2421 flow [2022-12-13 13:32:51,255 INFO L130 PetriNetUnfolder]: 780/2085 cut-off events. [2022-12-13 13:32:51,256 INFO L131 PetriNetUnfolder]: For 15064/16965 co-relation queries the response was YES. [2022-12-13 13:32:51,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10277 conditions, 2085 events. 780/2085 cut-off events. For 15064/16965 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 17724 event pairs, 103 based on Foata normal form. 37/2008 useless extension candidates. Maximal degree in co-relation 9449. Up to 771 conditions per place. [2022-12-13 13:32:51,277 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 171 transitions, 2421 flow [2022-12-13 13:32:51,277 INFO L226 LiptonReduction]: Number of co-enabled transitions 1716 [2022-12-13 13:32:51,279 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:32:51,279 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-13 13:32:51,279 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 171 transitions, 2421 flow [2022-12-13 13:32:51,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:51,279 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:51,279 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:51,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 13:32:51,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:32:51,485 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:32:51,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:51,486 INFO L85 PathProgramCache]: Analyzing trace with hash 198548764, now seen corresponding path program 1 times [2022-12-13 13:32:51,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:51,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931569003] [2022-12-13 13:32:51,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:51,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:32:51,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:51,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931569003] [2022-12-13 13:32:51,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931569003] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:32:51,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30021986] [2022-12-13 13:32:51,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:51,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:32:51,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:32:51,700 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:32:51,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 13:32:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:51,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 13:32:51,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:32:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:32:51,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:32:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:32:51,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30021986] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:32:51,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:32:51,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 13:32:51,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200292340] [2022-12-13 13:32:51,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:32:51,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:32:51,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:51,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:32:51,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:32:51,943 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 13:32:51,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 171 transitions, 2421 flow. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:51,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:51,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 13:32:51,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:57,270 INFO L130 PetriNetUnfolder]: 31332/45358 cut-off events. [2022-12-13 13:32:57,270 INFO L131 PetriNetUnfolder]: For 523735/523735 co-relation queries the response was YES. [2022-12-13 13:32:57,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281609 conditions, 45358 events. 31332/45358 cut-off events. For 523735/523735 co-relation queries the response was YES. Maximal size of possible extension queue 1962. Compared 305798 event pairs, 3085 based on Foata normal form. 6748/52106 useless extension candidates. Maximal degree in co-relation 137257. Up to 15861 conditions per place. [2022-12-13 13:32:57,609 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 1005 selfloop transitions, 529 changer transitions 36/1570 dead transitions. [2022-12-13 13:32:57,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 1570 transitions, 22222 flow [2022-12-13 13:32:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-13 13:32:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-13 13:32:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 637 transitions. [2022-12-13 13:32:57,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.532608695652174 [2022-12-13 13:32:57,612 INFO L175 Difference]: Start difference. First operand has 81 places, 171 transitions, 2421 flow. Second operand 46 states and 637 transitions. [2022-12-13 13:32:57,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 1570 transitions, 22222 flow [2022-12-13 13:32:58,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 1570 transitions, 22046 flow, removed 88 selfloop flow, removed 0 redundant places. [2022-12-13 13:32:58,333 INFO L231 Difference]: Finished difference. Result has 163 places, 749 transitions, 13126 flow [2022-12-13 13:32:58,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2379, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=13126, PETRI_PLACES=163, PETRI_TRANSITIONS=749} [2022-12-13 13:32:58,334 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 129 predicate places. [2022-12-13 13:32:58,334 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:58,334 INFO L89 Accepts]: Start accepts. Operand has 163 places, 749 transitions, 13126 flow [2022-12-13 13:32:58,338 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:58,338 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:58,338 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 749 transitions, 13126 flow [2022-12-13 13:32:58,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 749 transitions, 13126 flow [2022-12-13 13:32:59,310 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][384], [Black: 132#(= ~counter~0 0), 91#thread4EXITtrue, 118#thread3EXITtrue, Black: 136#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 526#(and (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 418#(= ~counter~0 1), Black: 390#(= ~counter~0 0), 534#true, Black: 528#(and (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~counter~0 0) (= ~N2~0 ~N1~0)), Black: 143#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 524#(and (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (= ~counter~0 1)), 45#L44true, 6#thread2EXITtrue, Black: 656#(or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))), 382#true, Black: 687#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 685#(= ~counter~0 0), 370#true, 361#true, Black: 1218#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1122#(or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))), Black: 1198#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 683#true, Black: 1208#(and (<= 2 ~N2~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1204#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1154#(and (<= ~i2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1212#(and (<= 2 ~N2~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1)), Black: 996#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0)), Black: 1178#(and (<= ~i2~0 0) (< ~i2~0 ~N2~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1160#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1202#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 838#(<= ~M1~0 ~j1~0), Black: 1226#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 ~N2~0)), Black: 1186#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1210#(and (<= 2 ~N2~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1115#(< (+ ~i2~0 1) ~N2~0), Black: 1196#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1206#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1184#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (= ~N2~0 ~N1~0)), Black: 1126#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), 68#L98-4true, Black: 1168#(and (<= ~i2~0 0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 989#(and (or (< ~i1~0 ~N1~0) (<= ~M1~0 ~j1~0)) (or (< (+ ~i1~0 1) ~N1~0) (< ~M1~0 (+ 2 ~j1~0)))), Black: 1162#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 158#(and (<= ~i2~0 0) (<= 0 ~i1~0) (= ~N2~0 ~N1~0)), Black: 959#(or (< ~i1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 1224#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1111#(< ~i2~0 ~N2~0), Black: 1192#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1182#(and (<= 2 ~N2~0) (<= ~i2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1194#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0)), Black: 997#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), 224#true, Black: 1188#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 324#(< ~j2~0 ~M2~0), Black: 1180#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1176#(and (<= ~i2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1216#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1214#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1222#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1200#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1220#(and (<= 2 ~N2~0) (<= ~i2~0 1) (< (+ ~i2~0 1) ~N2~0)), Black: 1174#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1172#(and (<= 2 ~N2~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 363#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 993#true, Black: 372#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 380#(<= (+ ~i1~0 1) ~N1~0)]) [2022-12-13 13:32:59,310 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is not cut-off event [2022-12-13 13:32:59,310 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2022-12-13 13:32:59,310 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2022-12-13 13:32:59,310 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2022-12-13 13:32:59,310 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][384], [Black: 132#(= ~counter~0 0), 91#thread4EXITtrue, 118#thread3EXITtrue, Black: 136#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 526#(and (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 418#(= ~counter~0 1), Black: 390#(= ~counter~0 0), 534#true, Black: 528#(and (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~counter~0 0) (= ~N2~0 ~N1~0)), Black: 143#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 524#(and (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (= ~counter~0 1)), 45#L44true, 6#thread2EXITtrue, Black: 656#(or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))), 382#true, Black: 687#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 685#(= ~counter~0 0), 370#true, 361#true, Black: 1218#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1122#(or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))), Black: 1198#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1208#(and (<= 2 ~N2~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), 683#true, Black: 1204#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1154#(and (<= ~i2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1212#(and (<= 2 ~N2~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1)), Black: 996#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0)), Black: 1178#(and (<= ~i2~0 0) (< ~i2~0 ~N2~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1160#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1202#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 838#(<= ~M1~0 ~j1~0), Black: 1226#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 ~N2~0)), Black: 1186#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1210#(and (<= 2 ~N2~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1115#(< (+ ~i2~0 1) ~N2~0), Black: 1196#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1206#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1184#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (= ~N2~0 ~N1~0)), Black: 1126#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), 68#L98-4true, Black: 1168#(and (<= ~i2~0 0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 989#(and (or (< ~i1~0 ~N1~0) (<= ~M1~0 ~j1~0)) (or (< (+ ~i1~0 1) ~N1~0) (< ~M1~0 (+ 2 ~j1~0)))), Black: 1162#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 158#(and (<= ~i2~0 0) (<= 0 ~i1~0) (= ~N2~0 ~N1~0)), Black: 959#(or (< ~i1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 1224#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1111#(< ~i2~0 ~N2~0), Black: 1192#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1182#(and (<= 2 ~N2~0) (<= ~i2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1194#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0)), Black: 997#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), 224#true, Black: 1188#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 324#(< ~j2~0 ~M2~0), Black: 1180#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1176#(and (<= ~i2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1216#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1214#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1222#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1200#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1220#(and (<= 2 ~N2~0) (<= ~i2~0 1) (< (+ ~i2~0 1) ~N2~0)), Black: 1174#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1172#(and (<= 2 ~N2~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 363#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 993#true, Black: 372#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 380#(<= (+ ~i1~0 1) ~N1~0)]) [2022-12-13 13:32:59,310 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-13 13:32:59,311 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 13:32:59,311 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 13:32:59,311 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 13:32:59,311 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 13:32:59,670 INFO L130 PetriNetUnfolder]: 4214/9424 cut-off events. [2022-12-13 13:32:59,670 INFO L131 PetriNetUnfolder]: For 273638/277801 co-relation queries the response was YES. [2022-12-13 13:32:59,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74081 conditions, 9424 events. 4214/9424 cut-off events. For 273638/277801 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 94404 event pairs, 595 based on Foata normal form. 95/9004 useless extension candidates. Maximal degree in co-relation 71432. Up to 4183 conditions per place. [2022-12-13 13:32:59,834 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 749 transitions, 13126 flow [2022-12-13 13:32:59,834 INFO L226 LiptonReduction]: Number of co-enabled transitions 6418 [2022-12-13 13:32:59,890 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] L56-->L56: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= v_~counter~0_110 (+ v_~counter~0_109 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (< 0 v_~counter~0_110) 1 0)) (< v_~i2~0_37 v_~N2~0_40) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|)) (= (+ v_~i2~0_37 1) v_~i2~0_36)) InVars {~counter~0=v_~counter~0_110, ~i2~0=v_~i2~0_37, ~N2~0=v_~N2~0_40} OutVars{~counter~0=v_~counter~0_109, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~i2~0=v_~i2~0_36, ~N2~0=v_~N2~0_40} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:33:00,028 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L67-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork3_#res.base_Out_2| 0) (not (< v_~j1~0_In_1 v_~M1~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1, thread3Thread1of1ForFork3_#res.offset=|v_thread3Thread1of1ForFork3_#res.offset_Out_2|, thread3Thread1of1ForFork3_#res.base=|v_thread3Thread1of1ForFork3_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res.base, thread3Thread1of1ForFork3_#res.offset] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:33:00,085 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L67-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork3_#res.base_Out_2| 0) (not (< v_~j1~0_In_1 v_~M1~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1, thread3Thread1of1ForFork3_#res.offset=|v_thread3Thread1of1ForFork3_#res.offset_Out_2|, thread3Thread1of1ForFork3_#res.base=|v_thread3Thread1of1ForFork3_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res.base, thread3Thread1of1ForFork3_#res.offset] and [493] L44-->L44: Formula: (and (< (+ v_~i1~0_66 1) v_~N1~0_56) (= (+ v_~counter~0_163 2) v_~counter~0_161) (= v_~i1~0_64 (+ v_~i1~0_66 2))) InVars {~counter~0=v_~counter~0_163, ~i1~0=v_~i1~0_66, ~N1~0=v_~N1~0_56} OutVars{~counter~0=v_~counter~0_161, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~i1~0=v_~i1~0_64, ~N1~0=v_~N1~0_56} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:33:00,137 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 13:33:00,138 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1804 [2022-12-13 13:33:00,138 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 747 transitions, 13176 flow [2022-12-13 13:33:00,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:33:00,138 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:00,138 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:00,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 13:33:00,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:00,344 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:33:00,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:00,345 INFO L85 PathProgramCache]: Analyzing trace with hash -136066633, now seen corresponding path program 2 times [2022-12-13 13:33:00,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:00,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808976436] [2022-12-13 13:33:00,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:00,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:33:00,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:00,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808976436] [2022-12-13 13:33:00,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808976436] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:00,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789762007] [2022-12-13 13:33:00,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:33:00,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:00,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:00,476 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:33:00,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 13:33:00,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:33:00,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:33:00,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 13:33:00,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:33:00,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:33:00,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789762007] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:00,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:00,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 13:33:00,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111838552] [2022-12-13 13:33:00,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:00,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:33:00,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:00,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:33:00,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:33:00,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 13:33:00,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 747 transitions, 13176 flow. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:33:00,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:00,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 13:33:00,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:12,945 INFO L130 PetriNetUnfolder]: 38449/56508 cut-off events. [2022-12-13 13:33:12,946 INFO L131 PetriNetUnfolder]: For 2620218/2620218 co-relation queries the response was YES. [2022-12-13 13:33:13,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536709 conditions, 56508 events. 38449/56508 cut-off events. For 2620218/2620218 co-relation queries the response was YES. Maximal size of possible extension queue 2372. Compared 403096 event pairs, 8637 based on Foata normal form. 500/57008 useless extension candidates. Maximal degree in co-relation 506576. Up to 35805 conditions per place. [2022-12-13 13:33:13,733 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 899 selfloop transitions, 176 changer transitions 43/1118 dead transitions. [2022-12-13 13:33:13,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 1118 transitions, 21544 flow [2022-12-13 13:33:13,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:33:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:33:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2022-12-13 13:33:13,734 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5040322580645161 [2022-12-13 13:33:13,734 INFO L175 Difference]: Start difference. First operand has 161 places, 747 transitions, 13176 flow. Second operand 8 states and 125 transitions. [2022-12-13 13:33:13,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 1118 transitions, 21544 flow [2022-12-13 13:33:25,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 1118 transitions, 19163 flow, removed 1113 selfloop flow, removed 6 redundant places. [2022-12-13 13:33:25,093 INFO L231 Difference]: Finished difference. Result has 168 places, 846 transitions, 13914 flow [2022-12-13 13:33:25,093 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=11256, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13914, PETRI_PLACES=168, PETRI_TRANSITIONS=846} [2022-12-13 13:33:25,094 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 134 predicate places. [2022-12-13 13:33:25,094 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:25,094 INFO L89 Accepts]: Start accepts. Operand has 168 places, 846 transitions, 13914 flow [2022-12-13 13:33:25,103 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:25,103 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:25,103 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 846 transitions, 13914 flow [2022-12-13 13:33:25,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 846 transitions, 13914 flow [2022-12-13 13:33:26,460 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][47], [Black: 132#(= ~counter~0 0), 91#thread4EXITtrue, 118#thread3EXITtrue, Black: 136#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 526#(and (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 418#(= ~counter~0 1), Black: 390#(= ~counter~0 0), 534#true, Black: 528#(and (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~counter~0 0) (= ~N2~0 ~N1~0)), Black: 143#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 1424#(and (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= 2 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 524#(and (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (= ~counter~0 1)), Black: 1422#(and (<= 1 ~j1~0) (<= (+ ~i1~0 1) ~N1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 1428#(and (or (< (+ ~i1~0 1) ~N1~0) (< ~M1~0 (+ 2 ~j1~0))) (or (< ~i1~0 ~N1~0) (not (< ~j1~0 ~M1~0)))), Black: 1266#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 1420#(and (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 45#L44true, 1264#true, 6#thread2EXITtrue, Black: 656#(or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))), 382#true, Black: 687#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 685#(= ~counter~0 0), 370#true, Black: 1218#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1122#(or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))), Black: 1198#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 683#true, Black: 1208#(and (<= 2 ~N2~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1204#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1154#(and (<= ~i2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1212#(and (<= 2 ~N2~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1)), Black: 996#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0)), Black: 1178#(and (<= ~i2~0 0) (< ~i2~0 ~N2~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1160#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1202#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 838#(<= ~M1~0 ~j1~0), Black: 1226#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 ~N2~0)), Black: 1186#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1210#(and (<= 2 ~N2~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1115#(< (+ ~i2~0 1) ~N2~0), Black: 1196#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1206#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1184#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (= ~N2~0 ~N1~0)), Black: 1126#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), 68#L98-4true, Black: 1168#(and (<= ~i2~0 0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1162#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 158#(and (<= ~i2~0 0) (<= 0 ~i1~0) (= ~N2~0 ~N1~0)), Black: 989#(and (or (< ~i1~0 ~N1~0) (<= ~M1~0 ~j1~0)) (or (< (+ ~i1~0 1) ~N1~0) (< ~M1~0 (+ 2 ~j1~0)))), Black: 959#(or (< ~i1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 1224#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1111#(< ~i2~0 ~N2~0), Black: 1192#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1182#(and (<= 2 ~N2~0) (<= ~i2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1194#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0)), Black: 997#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), 224#true, Black: 1180#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 324#(< ~j2~0 ~M2~0), Black: 1176#(and (<= ~i2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1216#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1214#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1222#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1200#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1220#(and (<= 2 ~N2~0) (<= ~i2~0 1) (< (+ ~i2~0 1) ~N2~0)), Black: 1174#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1172#(and (<= 2 ~N2~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 363#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 993#true, Black: 372#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 380#(<= (+ ~i1~0 1) ~N1~0)]) [2022-12-13 13:33:26,460 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 13:33:26,460 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 13:33:26,460 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 13:33:26,460 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 13:33:26,702 INFO L130 PetriNetUnfolder]: 5127/11714 cut-off events. [2022-12-13 13:33:26,702 INFO L131 PetriNetUnfolder]: For 393458/403201 co-relation queries the response was YES. [2022-12-13 13:33:26,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93003 conditions, 11714 events. 5127/11714 cut-off events. For 393458/403201 co-relation queries the response was YES. Maximal size of possible extension queue 1105. Compared 121979 event pairs, 851 based on Foata normal form. 49/11015 useless extension candidates. Maximal degree in co-relation 90690. Up to 4970 conditions per place. [2022-12-13 13:33:26,903 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 846 transitions, 13914 flow [2022-12-13 13:33:26,903 INFO L226 LiptonReduction]: Number of co-enabled transitions 6830 [2022-12-13 13:33:26,906 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [495] L67-->L44: Formula: (and (not (< v_~j1~0_52 v_~M1~0_54)) (= v_~i1~0_76 (+ v_~i1~0_77 1)) (= v_~counter~0_173 (+ v_~counter~0_174 1)) (= |v_thread3Thread1of1ForFork3_#res.offset_23| 0) (= |v_thread3Thread1of1ForFork3_#res.base_23| 0) (< v_~i1~0_77 v_~N1~0_60)) InVars {~counter~0=v_~counter~0_174, ~j1~0=v_~j1~0_52, ~M1~0=v_~M1~0_54, ~i1~0=v_~i1~0_77, ~N1~0=v_~N1~0_60} OutVars{~counter~0=v_~counter~0_173, thread3Thread1of1ForFork3_#res.base=|v_thread3Thread1of1ForFork3_#res.base_23|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_36|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_36|, ~j1~0=v_~j1~0_52, ~M1~0=v_~M1~0_54, ~i1~0=v_~i1~0_76, ~N1~0=v_~N1~0_60, thread3Thread1of1ForFork3_#res.offset=|v_thread3Thread1of1ForFork3_#res.offset_23|} AuxVars[] AssignedVars[~counter~0, thread3Thread1of1ForFork3_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0, thread3Thread1of1ForFork3_#res.offset] and [492] L56-->L44: Formula: (and (= (+ v_~i2~0_51 1) v_~i2~0_50) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_16| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_16|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_16| (ite (< 0 v_~counter~0_157) 1 0)) (< v_~i2~0_51 v_~N2~0_52) (< v_~i1~0_61 v_~N1~0_54) (= v_~i1~0_60 (+ v_~i1~0_61 1)) (= v_~counter~0_157 v_~counter~0_155) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_16| 0))) InVars {~counter~0=v_~counter~0_157, ~i2~0=v_~i2~0_51, ~i1~0=v_~i1~0_61, ~N1~0=v_~N1~0_54, ~N2~0=v_~N2~0_52} OutVars{~counter~0=v_~counter~0_155, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_16|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_16|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_26|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_16|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_26|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_16|, ~i2~0=v_~i2~0_50, ~i1~0=v_~i1~0_60, ~N1~0=v_~N1~0_54, ~N2~0=v_~N2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post1, thread2Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0, ~i1~0] [2022-12-13 13:33:27,062 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:33:27,063 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1969 [2022-12-13 13:33:27,063 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 846 transitions, 13942 flow [2022-12-13 13:33:27,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:33:27,063 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:27,063 INFO L214 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] [2022-12-13 13:33:27,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 13:33:27,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 13:33:27,268 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:33:27,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:27,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1006873416, now seen corresponding path program 1 times [2022-12-13 13:33:27,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:27,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884161503] [2022-12-13 13:33:27,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:27,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:33:27,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:27,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884161503] [2022-12-13 13:33:27,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884161503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:27,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:27,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:33:27,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195202557] [2022-12-13 13:33:27,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:27,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:33:27,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:27,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:33:27,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:33:27,347 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 13:33:27,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 846 transitions, 13942 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:33:27,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:27,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 13:33:27,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:37,860 INFO L130 PetriNetUnfolder]: 36038/52402 cut-off events. [2022-12-13 13:33:37,860 INFO L131 PetriNetUnfolder]: For 2593068/2593068 co-relation queries the response was YES. [2022-12-13 13:33:38,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491932 conditions, 52402 events. 36038/52402 cut-off events. For 2593068/2593068 co-relation queries the response was YES. Maximal size of possible extension queue 2144. Compared 359312 event pairs, 13384 based on Foata normal form. 12/52414 useless extension candidates. Maximal degree in co-relation 491382. Up to 52394 conditions per place. [2022-12-13 13:33:38,598 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 826 selfloop transitions, 7 changer transitions 0/833 dead transitions. [2022-12-13 13:33:38,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 833 transitions, 15231 flow [2022-12-13 13:33:38,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:33:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:33:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-13 13:33:38,599 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2022-12-13 13:33:38,599 INFO L175 Difference]: Start difference. First operand has 168 places, 846 transitions, 13942 flow. Second operand 3 states and 41 transitions. [2022-12-13 13:33:38,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 833 transitions, 15231 flow [2022-12-13 13:33:47,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 833 transitions, 14865 flow, removed 139 selfloop flow, removed 6 redundant places. [2022-12-13 13:33:47,625 INFO L231 Difference]: Finished difference. Result has 158 places, 826 transitions, 13196 flow [2022-12-13 13:33:47,626 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=13182, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=826, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=819, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=13196, PETRI_PLACES=158, PETRI_TRANSITIONS=826} [2022-12-13 13:33:47,626 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 124 predicate places. [2022-12-13 13:33:47,626 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:47,626 INFO L89 Accepts]: Start accepts. Operand has 158 places, 826 transitions, 13196 flow [2022-12-13 13:33:47,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:47,639 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:47,639 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 826 transitions, 13196 flow [2022-12-13 13:33:47,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 826 transitions, 13196 flow [2022-12-13 13:33:49,035 INFO L130 PetriNetUnfolder]: 4756/10587 cut-off events. [2022-12-13 13:33:49,036 INFO L131 PetriNetUnfolder]: For 342901/351000 co-relation queries the response was YES. [2022-12-13 13:33:49,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84808 conditions, 10587 events. 4756/10587 cut-off events. For 342901/351000 co-relation queries the response was YES. Maximal size of possible extension queue 986. Compared 106464 event pairs, 784 based on Foata normal form. 39/9900 useless extension candidates. Maximal degree in co-relation 81877. Up to 4428 conditions per place. [2022-12-13 13:33:49,214 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 826 transitions, 13196 flow [2022-12-13 13:33:49,214 INFO L226 LiptonReduction]: Number of co-enabled transitions 6666 [2022-12-13 13:33:49,230 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:33:49,230 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1604 [2022-12-13 13:33:49,231 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 826 transitions, 13196 flow [2022-12-13 13:33:49,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:33:49,231 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:49,231 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:49,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 13:33:49,231 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)] === [2022-12-13 13:33:49,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:49,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1475120374, now seen corresponding path program 2 times [2022-12-13 13:33:49,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:49,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965479734] [2022-12-13 13:33:49,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:49,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:49,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:33:49,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:49,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965479734] [2022-12-13 13:33:49,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965479734] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:49,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482075878] [2022-12-13 13:33:49,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:33:49,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:49,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:49,332 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:33:49,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 13:33:49,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:33:49,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:33:49,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 13:33:49,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:33:49,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:33:49,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482075878] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:49,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:49,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 11 [2022-12-13 13:33:49,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393862662] [2022-12-13 13:33:49,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:49,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:33:49,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:49,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:33:49,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:33:49,553 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:33:49,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 826 transitions, 13196 flow. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:33:49,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:49,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:33:49,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:02,730 INFO L130 PetriNetUnfolder]: 41323/59694 cut-off events. [2022-12-13 13:34:02,730 INFO L131 PetriNetUnfolder]: For 3087339/3087339 co-relation queries the response was YES. [2022-12-13 13:34:03,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576891 conditions, 59694 events. 41323/59694 cut-off events. For 3087339/3087339 co-relation queries the response was YES. Maximal size of possible extension queue 2461. Compared 411849 event pairs, 4118 based on Foata normal form. 764/60458 useless extension candidates. Maximal degree in co-relation 543153. Up to 21195 conditions per place. [2022-12-13 13:34:03,639 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 974 selfloop transitions, 653 changer transitions 76/1703 dead transitions. [2022-12-13 13:34:03,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 1703 transitions, 29724 flow [2022-12-13 13:34:03,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 13:34:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 13:34:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 296 transitions. [2022-12-13 13:34:03,640 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906 [2022-12-13 13:34:03,640 INFO L175 Difference]: Start difference. First operand has 158 places, 826 transitions, 13196 flow. Second operand 24 states and 296 transitions. [2022-12-13 13:34:03,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 1703 transitions, 29724 flow [2022-12-13 13:34:14,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 1703 transitions, 29434 flow, removed 138 selfloop flow, removed 2 redundant places. [2022-12-13 13:34:14,246 INFO L231 Difference]: Finished difference. Result has 194 places, 1115 transitions, 20144 flow [2022-12-13 13:34:14,246 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=12651, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=806, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=347, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=20144, PETRI_PLACES=194, PETRI_TRANSITIONS=1115} [2022-12-13 13:34:14,247 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 160 predicate places. [2022-12-13 13:34:14,247 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:14,247 INFO L89 Accepts]: Start accepts. Operand has 194 places, 1115 transitions, 20144 flow [2022-12-13 13:34:14,252 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:14,253 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:14,253 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 1115 transitions, 20144 flow [2022-12-13 13:34:14,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 1115 transitions, 20144 flow [2022-12-13 13:34:16,103 INFO L130 PetriNetUnfolder]: 5258/11456 cut-off events. [2022-12-13 13:34:16,103 INFO L131 PetriNetUnfolder]: For 563916/572728 co-relation queries the response was YES. [2022-12-13 13:34:16,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107953 conditions, 11456 events. 5258/11456 cut-off events. For 563916/572728 co-relation queries the response was YES. Maximal size of possible extension queue 1093. Compared 114772 event pairs, 867 based on Foata normal form. 106/10875 useless extension candidates. Maximal degree in co-relation 104901. Up to 4382 conditions per place. [2022-12-13 13:34:16,328 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 1115 transitions, 20144 flow [2022-12-13 13:34:16,329 INFO L226 LiptonReduction]: Number of co-enabled transitions 8578 [2022-12-13 13:34:16,333 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] and [425] L67-->L67: Formula: (and (= (+ v_~counter~0_92 1) v_~counter~0_91) (< v_~j1~0_23 v_~M1~0_14) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_92, ~j1~0=v_~j1~0_23, ~M1~0=v_~M1~0_14} OutVars{~counter~0=v_~counter~0_91, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_5|, ~M1~0=v_~M1~0_14, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5] [2022-12-13 13:34:16,358 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] and [477] L56-->L56: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= v_~counter~0_110 (+ v_~counter~0_109 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (< 0 v_~counter~0_110) 1 0)) (< v_~i2~0_37 v_~N2~0_40) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|)) (= (+ v_~i2~0_37 1) v_~i2~0_36)) InVars {~counter~0=v_~counter~0_110, ~i2~0=v_~i2~0_37, ~N2~0=v_~N2~0_40} OutVars{~counter~0=v_~counter~0_109, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~i2~0=v_~i2~0_36, ~N2~0=v_~N2~0_40} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0] [2022-12-13 13:34:16,413 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:34:16,414 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2167 [2022-12-13 13:34:16,414 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 1115 transitions, 20178 flow [2022-12-13 13:34:16,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:34:16,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:16,414 INFO L214 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] [2022-12-13 13:34:16,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 13:34:16,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 13:34:16,615 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)] === [2022-12-13 13:34:16,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:16,615 INFO L85 PathProgramCache]: Analyzing trace with hash 291712536, now seen corresponding path program 2 times [2022-12-13 13:34:16,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:16,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025166984] [2022-12-13 13:34:16,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:16,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:34:16,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:16,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025166984] [2022-12-13 13:34:16,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025166984] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:34:16,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160778542] [2022-12-13 13:34:16,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:34:16,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:16,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:34:16,931 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:34:16,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 13:34:17,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:34:17,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:34:17,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 13:34:17,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:34:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:34:17,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:34:17,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:34:17,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160778542] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:34:17,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:34:17,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-13 13:34:17,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92848442] [2022-12-13 13:34:17,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:34:17,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 13:34:17,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:17,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 13:34:17,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:34:17,190 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 13:34:17,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 1115 transitions, 20178 flow. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:34:17,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:17,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 13:34:17,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:39,290 INFO L130 PetriNetUnfolder]: 54170/78027 cut-off events. [2022-12-13 13:34:39,290 INFO L131 PetriNetUnfolder]: For 6501579/6501579 co-relation queries the response was YES. [2022-12-13 13:34:40,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 907579 conditions, 78027 events. 54170/78027 cut-off events. For 6501579/6501579 co-relation queries the response was YES. Maximal size of possible extension queue 3384. Compared 558828 event pairs, 8826 based on Foata normal form. 2762/80789 useless extension candidates. Maximal degree in co-relation 858755. Up to 24252 conditions per place. [2022-12-13 13:34:40,530 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 1398 selfloop transitions, 384 changer transitions 127/1909 dead transitions. [2022-12-13 13:34:40,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 1909 transitions, 38900 flow [2022-12-13 13:34:40,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 13:34:40,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 13:34:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 202 transitions. [2022-12-13 13:34:40,537 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40725806451612906 [2022-12-13 13:34:40,537 INFO L175 Difference]: Start difference. First operand has 193 places, 1115 transitions, 20178 flow. Second operand 16 states and 202 transitions. [2022-12-13 13:34:40,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 1909 transitions, 38900 flow [2022-12-13 13:35:34,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 1909 transitions, 36795 flow, removed 837 selfloop flow, removed 4 redundant places. [2022-12-13 13:35:34,317 INFO L231 Difference]: Finished difference. Result has 213 places, 1321 transitions, 25346 flow [2022-12-13 13:35:34,317 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=18981, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=829, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=25346, PETRI_PLACES=213, PETRI_TRANSITIONS=1321} [2022-12-13 13:35:34,318 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 179 predicate places. [2022-12-13 13:35:34,318 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:34,318 INFO L89 Accepts]: Start accepts. Operand has 213 places, 1321 transitions, 25346 flow [2022-12-13 13:35:34,324 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:34,324 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:34,324 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 1321 transitions, 25346 flow [2022-12-13 13:35:34,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 212 places, 1321 transitions, 25346 flow [2022-12-13 13:35:36,148 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][437], [Black: 132#(= ~counter~0 0), 91#thread4EXITtrue, 118#thread3EXITtrue, Black: 136#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 526#(and (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 418#(= ~counter~0 1), 1439#true, 534#true, Black: 390#(= ~counter~0 0), Black: 528#(and (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~counter~0 0) (= ~N2~0 ~N1~0)), Black: 524#(and (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (= ~counter~0 1)), Black: 143#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 1424#(and (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= 2 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 1422#(and (<= 1 ~j1~0) (<= (+ ~i1~0 1) ~N1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 1428#(and (or (< (+ ~i1~0 1) ~N1~0) (< ~M1~0 (+ 2 ~j1~0))) (or (< ~i1~0 ~N1~0) (not (< ~j1~0 ~M1~0)))), Black: 1420#(and (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 45#L44true, Black: 1681#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 1810#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (or (< (+ ~i1~0 1) ~N1~0) (< ~M1~0 (+ 2 ~j1~0)))), Black: 1647#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 1818#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 1814#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 1816#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 1756#(< ~M1~0 (+ 2 ~j1~0)), 1264#true, Black: 1778#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i1~0 ~N1~0)), 6#thread2EXITtrue, Black: 656#(or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))), 382#true, Black: 687#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 685#(= ~counter~0 0), 370#true, Black: 1218#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1122#(or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))), 1649#(<= ~M1~0 ~j1~0), Black: 1198#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 683#true, Black: 1208#(and (<= 2 ~N2~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1204#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1154#(and (<= ~i2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1212#(and (<= 2 ~N2~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1)), Black: 996#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0)), Black: 1178#(and (<= ~i2~0 0) (< ~i2~0 ~N2~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1160#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 838#(<= ~M1~0 ~j1~0), Black: 1202#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1226#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 ~N2~0)), Black: 1186#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1210#(and (<= 2 ~N2~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1115#(< (+ ~i2~0 1) ~N2~0), Black: 1196#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 1206#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1184#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (= ~N2~0 ~N1~0)), Black: 1626#(and (= ~M1~0 ~N1~0) (<= 1 ~i1~0) (<= ~N1~0 ~i1~0) (<= ~j1~0 1)), 68#L98-4true, Black: 1126#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 1604#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (<= 1 ~i1~0) (<= ~N1~0 ~i1~0) (<= ~j1~0 0)), Black: 1168#(and (<= ~i2~0 0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1628#(and (= ~M1~0 ~N1~0) (<= ~N1~0 1) (<= 1 ~i1~0) (<= ~j1~0 1)), Black: 1162#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 989#(and (or (< ~i1~0 ~N1~0) (<= ~M1~0 ~j1~0)) (or (< (+ ~i1~0 1) ~N1~0) (< ~M1~0 (+ 2 ~j1~0)))), Black: 158#(and (<= ~i2~0 0) (<= 0 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1224#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 959#(or (< ~i1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 1612#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (<= 1 ~i1~0) (<= ~j1~0 1)), Black: 1620#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (<= 1 ~i1~0) (<= ~N1~0 ~i1~0) (<= ~j1~0 1)), Black: 1111#(< ~i2~0 ~N2~0), Black: 1192#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1444#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 1610#(and (= ~M1~0 ~N1~0) (<= 1 ~i1~0) (<= ~N1~0 ~i1~0) (<= ~j1~0 0)), Black: 1182#(and (<= 2 ~N2~0) (<= ~i2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1614#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= ~N1~0 ~i1~0) (<= ~j1~0 1)), Black: 997#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1602#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (<= 1 ~i1~0) (<= ~j1~0 0)), 224#true, Black: 1622#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (<= ~N1~0 1) (<= 1 ~i1~0) (<= ~j1~0 1)), Black: 1180#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 324#(< ~j2~0 ~M2~0), Black: 1445#(<= ~N1~0 ~i1~0), Black: 1624#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= ~N1~0 ~i1~0)), Black: 1216#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1608#(and (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= ~j1~0 1)), Black: 1214#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1477#(and (= ~M1~0 ~N1~0) (<= 1 ~i1~0) (<= ~j1~0 1)), Black: 1222#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1200#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1220#(and (<= 2 ~N2~0) (<= ~i2~0 1) (< (+ ~i2~0 1) ~N2~0)), Black: 1174#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (< (+ ~i2~0 1) ~N2~0) (= ~N2~0 ~N1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 1172#(and (<= 2 ~N2~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 363#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 993#true, Black: 372#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 380#(<= (+ ~i1~0 1) ~N1~0)]) [2022-12-13 13:35:36,149 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-13 13:35:36,149 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 13:35:36,149 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 13:35:36,149 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 13:35:37,449 INFO L130 PetriNetUnfolder]: 6457/14331 cut-off events. [2022-12-13 13:35:37,449 INFO L131 PetriNetUnfolder]: For 905340/917379 co-relation queries the response was YES. [2022-12-13 13:35:37,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144761 conditions, 14331 events. 6457/14331 cut-off events. For 905340/917379 co-relation queries the response was YES. Maximal size of possible extension queue 1433. Compared 152070 event pairs, 926 based on Foata normal form. 139/13560 useless extension candidates. Maximal degree in co-relation 140797. Up to 5262 conditions per place. [2022-12-13 13:35:37,704 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 212 places, 1321 transitions, 25346 flow [2022-12-13 13:35:37,704 INFO L226 LiptonReduction]: Number of co-enabled transitions 10160 [2022-12-13 13:35:38,024 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] L56-->L56: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= v_~counter~0_110 (+ v_~counter~0_109 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (< 0 v_~counter~0_110) 1 0)) (< v_~i2~0_37 v_~N2~0_40) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|)) (= (+ v_~i2~0_37 1) v_~i2~0_36)) InVars {~counter~0=v_~counter~0_110, ~i2~0=v_~i2~0_37, ~N2~0=v_~N2~0_40} OutVars{~counter~0=v_~counter~0_109, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~i2~0=v_~i2~0_36, ~N2~0=v_~N2~0_40} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0] and [425] L67-->L67: Formula: (and (= (+ v_~counter~0_92 1) v_~counter~0_91) (< v_~j1~0_23 v_~M1~0_14) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_92, ~j1~0=v_~j1~0_23, ~M1~0=v_~M1~0_14} OutVars{~counter~0=v_~counter~0_91, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_5|, ~M1~0=v_~M1~0_14, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5] [2022-12-13 13:35:38,070 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] L56-->L56: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= v_~counter~0_110 (+ v_~counter~0_109 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (< 0 v_~counter~0_110) 1 0)) (< v_~i2~0_37 v_~N2~0_40) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|)) (= (+ v_~i2~0_37 1) v_~i2~0_36)) InVars {~counter~0=v_~counter~0_110, ~i2~0=v_~i2~0_37, ~N2~0=v_~N2~0_40} OutVars{~counter~0=v_~counter~0_109, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~i2~0=v_~i2~0_36, ~N2~0=v_~N2~0_40} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:35:38,115 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] L56-->L56: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= v_~counter~0_110 (+ v_~counter~0_109 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (< 0 v_~counter~0_110) 1 0)) (< v_~i2~0_37 v_~N2~0_40) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|)) (= (+ v_~i2~0_37 1) v_~i2~0_36)) InVars {~counter~0=v_~counter~0_110, ~i2~0=v_~i2~0_37, ~N2~0=v_~N2~0_40} OutVars{~counter~0=v_~counter~0_109, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~i2~0=v_~i2~0_36, ~N2~0=v_~N2~0_40} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:35:38,158 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] L56-->L56: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= v_~counter~0_110 (+ v_~counter~0_109 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (< 0 v_~counter~0_110) 1 0)) (< v_~i2~0_37 v_~N2~0_40) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|)) (= (+ v_~i2~0_37 1) v_~i2~0_36)) InVars {~counter~0=v_~counter~0_110, ~i2~0=v_~i2~0_37, ~N2~0=v_~N2~0_40} OutVars{~counter~0=v_~counter~0_109, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~i2~0=v_~i2~0_36, ~N2~0=v_~N2~0_40} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0] and [425] L67-->L67: Formula: (and (= (+ v_~counter~0_92 1) v_~counter~0_91) (< v_~j1~0_23 v_~M1~0_14) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_92, ~j1~0=v_~j1~0_23, ~M1~0=v_~M1~0_14} OutVars{~counter~0=v_~counter~0_91, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_5|, ~M1~0=v_~M1~0_14, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5] [2022-12-13 13:35:38,203 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] L44-->L56: Formula: (and (< v_~i1~0_100 v_~N1~0_68) (= v_~counter~0_209 v_~counter~0_207) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_24| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_24| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_24|) (= (ite (< 0 (+ v_~counter~0_209 1)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_24|) (= v_~i2~0_60 (+ v_~i2~0_61 1)) (< v_~i2~0_61 v_~N2~0_56) (= (+ v_~i1~0_100 1) v_~i1~0_99)) InVars {~counter~0=v_~counter~0_209, ~i2~0=v_~i2~0_61, ~N2~0=v_~N2~0_56, ~i1~0=v_~i1~0_100, ~N1~0=v_~N1~0_68} OutVars{~counter~0=v_~counter~0_207, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_24|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_24|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_24|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_51|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_51|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_24|, ~i2~0=v_~i2~0_60, ~N2~0=v_~N2~0_56, ~i1~0=v_~i1~0_99, ~N1~0=v_~N1~0_68} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0, ~i1~0] and [425] L67-->L67: Formula: (and (= (+ v_~counter~0_92 1) v_~counter~0_91) (< v_~j1~0_23 v_~M1~0_14) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_92, ~j1~0=v_~j1~0_23, ~M1~0=v_~M1~0_14} OutVars{~counter~0=v_~counter~0_91, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_5|, ~M1~0=v_~M1~0_14, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5] [2022-12-13 13:35:38,257 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] L44-->L56: Formula: (and (< v_~i1~0_100 v_~N1~0_68) (= v_~counter~0_209 v_~counter~0_207) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_24| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_24| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_24|) (= (ite (< 0 (+ v_~counter~0_209 1)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_24|) (= v_~i2~0_60 (+ v_~i2~0_61 1)) (< v_~i2~0_61 v_~N2~0_56) (= (+ v_~i1~0_100 1) v_~i1~0_99)) InVars {~counter~0=v_~counter~0_209, ~i2~0=v_~i2~0_61, ~N2~0=v_~N2~0_56, ~i1~0=v_~i1~0_100, ~N1~0=v_~N1~0_68} OutVars{~counter~0=v_~counter~0_207, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_24|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_24|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_24|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_51|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_51|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_24|, ~i2~0=v_~i2~0_60, ~N2~0=v_~N2~0_56, ~i1~0=v_~i1~0_99, ~N1~0=v_~N1~0_68} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0, ~i1~0] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:35:38,333 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L67-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork3_#res.base_Out_2| 0) (not (< v_~j1~0_In_1 v_~M1~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1, thread3Thread1of1ForFork3_#res.offset=|v_thread3Thread1of1ForFork3_#res.offset_Out_2|, thread3Thread1of1ForFork3_#res.base=|v_thread3Thread1of1ForFork3_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res.base, thread3Thread1of1ForFork3_#res.offset] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:35:38,374 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L67-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork3_#res.base_Out_2| 0) (not (< v_~j1~0_In_1 v_~M1~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1, thread3Thread1of1ForFork3_#res.offset=|v_thread3Thread1of1ForFork3_#res.offset_Out_2|, thread3Thread1of1ForFork3_#res.base=|v_thread3Thread1of1ForFork3_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res.base, thread3Thread1of1ForFork3_#res.offset] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:35:38,417 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L67-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork3_#res.base_Out_2| 0) (not (< v_~j1~0_In_1 v_~M1~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1, thread3Thread1of1ForFork3_#res.offset=|v_thread3Thread1of1ForFork3_#res.offset_Out_2|, thread3Thread1of1ForFork3_#res.base=|v_thread3Thread1of1ForFork3_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res.base, thread3Thread1of1ForFork3_#res.offset] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:35:38,458 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L67-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork3_#res.base_Out_2| 0) (not (< v_~j1~0_In_1 v_~M1~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1, thread3Thread1of1ForFork3_#res.offset=|v_thread3Thread1of1ForFork3_#res.offset_Out_2|, thread3Thread1of1ForFork3_#res.base=|v_thread3Thread1of1ForFork3_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res.base, thread3Thread1of1ForFork3_#res.offset] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:35:38,498 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L67-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork3_#res.base_Out_2| 0) (not (< v_~j1~0_In_1 v_~M1~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1, thread3Thread1of1ForFork3_#res.offset=|v_thread3Thread1of1ForFork3_#res.offset_Out_2|, thread3Thread1of1ForFork3_#res.base=|v_thread3Thread1of1ForFork3_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res.base, thread3Thread1of1ForFork3_#res.offset] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:35:38,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L67-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork3_#res.base_Out_2| 0) (not (< v_~j1~0_In_1 v_~M1~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1, thread3Thread1of1ForFork3_#res.offset=|v_thread3Thread1of1ForFork3_#res.offset_Out_2|, thread3Thread1of1ForFork3_#res.base=|v_thread3Thread1of1ForFork3_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res.base, thread3Thread1of1ForFork3_#res.offset] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:35:38,581 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L67-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork3_#res.base_Out_2| 0) (not (< v_~j1~0_In_1 v_~M1~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1, thread3Thread1of1ForFork3_#res.offset=|v_thread3Thread1of1ForFork3_#res.offset_Out_2|, thread3Thread1of1ForFork3_#res.base=|v_thread3Thread1of1ForFork3_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res.base, thread3Thread1of1ForFork3_#res.offset] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:35:38,622 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L67-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork3_#res.base_Out_2| 0) (not (< v_~j1~0_In_1 v_~M1~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1, thread3Thread1of1ForFork3_#res.offset=|v_thread3Thread1of1ForFork3_#res.offset_Out_2|, thread3Thread1of1ForFork3_#res.base=|v_thread3Thread1of1ForFork3_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res.base, thread3Thread1of1ForFork3_#res.offset] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:35:38,665 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L67-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork3_#res.base_Out_2| 0) (not (< v_~j1~0_In_1 v_~M1~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1, thread3Thread1of1ForFork3_#res.offset=|v_thread3Thread1of1ForFork3_#res.offset_Out_2|, thread3Thread1of1ForFork3_#res.base=|v_thread3Thread1of1ForFork3_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res.base, thread3Thread1of1ForFork3_#res.offset] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:35:38,705 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L67-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork3_#res.base_Out_2| 0) (not (< v_~j1~0_In_1 v_~M1~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1, thread3Thread1of1ForFork3_#res.offset=|v_thread3Thread1of1ForFork3_#res.offset_Out_2|, thread3Thread1of1ForFork3_#res.base=|v_thread3Thread1of1ForFork3_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res.base, thread3Thread1of1ForFork3_#res.offset] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:35:38,746 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L67-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork3_#res.base_Out_2| 0) (not (< v_~j1~0_In_1 v_~M1~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1, thread3Thread1of1ForFork3_#res.offset=|v_thread3Thread1of1ForFork3_#res.offset_Out_2|, thread3Thread1of1ForFork3_#res.base=|v_thread3Thread1of1ForFork3_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res.base, thread3Thread1of1ForFork3_#res.offset] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:35:38,787 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L67-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork3_#res.base_Out_2| 0) (not (< v_~j1~0_In_1 v_~M1~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1, thread3Thread1of1ForFork3_#res.offset=|v_thread3Thread1of1ForFork3_#res.offset_Out_2|, thread3Thread1of1ForFork3_#res.base=|v_thread3Thread1of1ForFork3_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res.base, thread3Thread1of1ForFork3_#res.offset] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:35:38,828 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L67-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork3_#res.base_Out_2| 0) (not (< v_~j1~0_In_1 v_~M1~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~M1~0=v_~M1~0_In_1, thread3Thread1of1ForFork3_#res.offset=|v_thread3Thread1of1ForFork3_#res.offset_Out_2|, thread3Thread1of1ForFork3_#res.base=|v_thread3Thread1of1ForFork3_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res.base, thread3Thread1of1ForFork3_#res.offset] and [438] L44-->L44: Formula: (and (= v_~i1~0_26 (+ v_~i1~0_27 1)) (< v_~i1~0_27 v_~N1~0_12) (= (+ v_~counter~0_96 1) v_~counter~0_95)) InVars {~counter~0=v_~counter~0_96, ~i1~0=v_~i1~0_27, ~N1~0=v_~N1~0_12} OutVars{~counter~0=v_~counter~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|, ~i1~0=v_~i1~0_26, ~N1~0=v_~N1~0_12} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0] [2022-12-13 13:35:38,878 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:35:38,879 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4561 [2022-12-13 13:35:38,879 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 1321 transitions, 25599 flow [2022-12-13 13:35:38,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:38,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:38,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:38,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 13:35:39,080 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,SelfDestructingSolverStorable16 [2022-12-13 13:35:39,080 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)] === [2022-12-13 13:35:39,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:39,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1233998690, now seen corresponding path program 1 times [2022-12-13 13:35:39,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:39,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143461967] [2022-12-13 13:35:39,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:39,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:39,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:39,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143461967] [2022-12-13 13:35:39,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143461967] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:39,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405264195] [2022-12-13 13:35:39,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:39,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:39,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:39,202 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:35:39,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 13:35:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:39,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 13:35:39,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:35:39,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:35:39,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405264195] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:39,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:39,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-13 13:35:39,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700919293] [2022-12-13 13:35:39,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:39,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:35:39,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:39,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:35:39,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:35:39,431 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 13:35:39,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 1321 transitions, 25599 flow. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:39,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:39,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 13:35:39,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand