/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 17:47:25,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 17:47:25,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 17:47:25,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 17:47:25,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 17:47:25,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 17:47:25,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 17:47:25,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 17:47:25,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 17:47:25,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 17:47:25,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 17:47:25,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 17:47:25,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 17:47:25,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 17:47:25,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 17:47:25,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 17:47:25,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 17:47:25,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 17:47:25,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 17:47:25,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 17:47:25,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 17:47:26,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 17:47:26,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 17:47:26,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 17:47:26,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 17:47:26,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 17:47:26,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 17:47:26,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 17:47:26,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 17:47:26,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 17:47:26,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 17:47:26,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 17:47:26,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 17:47:26,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 17:47:26,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 17:47:26,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 17:47:26,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 17:47:26,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 17:47:26,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 17:47:26,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 17:47:26,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 17:47:26,028 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-NoLbe.epf [2022-12-06 17:47:26,059 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 17:47:26,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 17:47:26,061 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 17:47:26,061 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 17:47:26,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 17:47:26,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 17:47:26,062 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 17:47:26,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 17:47:26,063 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 17:47:26,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 17:47:26,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 17:47:26,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 17:47:26,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 17:47:26,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 17:47:26,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 17:47:26,064 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 17:47:26,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 17:47:26,064 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 17:47:26,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 17:47:26,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 17:47:26,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 17:47:26,065 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 17:47:26,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 17:47:26,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:47:26,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 17:47:26,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 17:47:26,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 17:47:26,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 17:47:26,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 17:47:26,066 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 17:47:26,066 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 17:47:26,066 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 17:47:26,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 17:47:26,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 17:47:26,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 17:47:26,413 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 17:47:26,413 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 17:47:26,415 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2022-12-06 17:47:27,446 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 17:47:27,677 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 17:47:27,678 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2022-12-06 17:47:27,685 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845ce09bb/f793fc8719ce49aa8bad93734346c67e/FLAG1e5b26dca [2022-12-06 17:47:27,696 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845ce09bb/f793fc8719ce49aa8bad93734346c67e [2022-12-06 17:47:27,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 17:47:27,700 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 17:47:27,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 17:47:27,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 17:47:27,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 17:47:27,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:47:27" (1/1) ... [2022-12-06 17:47:27,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6303615b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:47:27, skipping insertion in model container [2022-12-06 17:47:27,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:47:27" (1/1) ... [2022-12-06 17:47:27,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 17:47:27,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 17:47:27,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:47:27,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:47:27,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:47:27,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:47:27,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:47:27,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:47:27,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:47:27,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:47:27,924 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-counter-determinism.wvr.c[2476,2489] [2022-12-06 17:47:27,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:47:27,944 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 17:47:27,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:47:27,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:47:27,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:47:27,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:47:27,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:47:27,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:47:27,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:47:27,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:47:27,985 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-counter-determinism.wvr.c[2476,2489] [2022-12-06 17:47:27,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:47:27,998 INFO L208 MainTranslator]: Completed translation [2022-12-06 17:47:27,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:47:27 WrapperNode [2022-12-06 17:47:27,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 17:47:28,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 17:47:28,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 17:47:28,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 17:47:28,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:47:27" (1/1) ... [2022-12-06 17:47:28,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:47:27" (1/1) ... [2022-12-06 17:47:28,050 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2022-12-06 17:47:28,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 17:47:28,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 17:47:28,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 17:47:28,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 17:47:28,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:47:27" (1/1) ... [2022-12-06 17:47:28,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:47:27" (1/1) ... [2022-12-06 17:47:28,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:47:27" (1/1) ... [2022-12-06 17:47:28,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:47:27" (1/1) ... [2022-12-06 17:47:28,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:47:27" (1/1) ... [2022-12-06 17:47:28,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:47:27" (1/1) ... [2022-12-06 17:47:28,082 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:47:27" (1/1) ... [2022-12-06 17:47:28,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:47:27" (1/1) ... [2022-12-06 17:47:28,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 17:47:28,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 17:47:28,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 17:47:28,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 17:47:28,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:47:27" (1/1) ... [2022-12-06 17:47:28,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:47:28,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:47:28,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 17:47:28,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 17:47:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 17:47:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 17:47:28,173 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 17:47:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 17:47:28,173 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 17:47:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 17:47:28,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 17:47:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 17:47:28,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 17:47:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 17:47:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 17:47:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 17:47:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 17:47:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 17:47:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 17:47:28,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 17:47:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 17:47:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 17:47:28,176 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 17:47:28,307 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 17:47:28,309 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 17:47:28,534 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 17:47:28,578 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 17:47:28,578 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 17:47:28,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:47:28 BoogieIcfgContainer [2022-12-06 17:47:28,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 17:47:28,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 17:47:28,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 17:47:28,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 17:47:28,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:47:27" (1/3) ... [2022-12-06 17:47:28,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec2e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:47:28, skipping insertion in model container [2022-12-06 17:47:28,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:47:27" (2/3) ... [2022-12-06 17:47:28,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec2e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:47:28, skipping insertion in model container [2022-12-06 17:47:28,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:47:28" (3/3) ... [2022-12-06 17:47:28,587 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2022-12-06 17:47:28,602 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 17:47:28,602 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 17:47:28,602 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 17:47:28,672 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 17:47:28,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 119 transitions, 270 flow [2022-12-06 17:47:28,764 INFO L130 PetriNetUnfolder]: 9/115 cut-off events. [2022-12-06 17:47:28,764 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 17:47:28,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 115 events. 9/115 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-12-06 17:47:28,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 119 transitions, 270 flow [2022-12-06 17:47:28,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 103 transitions, 230 flow [2022-12-06 17:47:28,790 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 17:47:28,795 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@100ffbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 17:47:28,795 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 17:47:28,823 INFO L130 PetriNetUnfolder]: 9/102 cut-off events. [2022-12-06 17:47:28,823 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 17:47:28,823 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:47:28,824 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:47:28,824 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-06 17:47:28,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:47:28,829 INFO L85 PathProgramCache]: Analyzing trace with hash 360089710, now seen corresponding path program 1 times [2022-12-06 17:47:28,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:47:28,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135460282] [2022-12-06 17:47:28,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:47:28,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:47:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:47:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:47:29,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:47:29,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135460282] [2022-12-06 17:47:29,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135460282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:47:29,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:47:29,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 17:47:29,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182784027] [2022-12-06 17:47:29,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:47:29,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 17:47:29,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:47:29,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 17:47:29,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 17:47:29,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 119 [2022-12-06 17:47:29,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 103 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:47:29,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:47:29,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 119 [2022-12-06 17:47:29,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:47:29,926 INFO L130 PetriNetUnfolder]: 107/474 cut-off events. [2022-12-06 17:47:29,926 INFO L131 PetriNetUnfolder]: For 115/116 co-relation queries the response was YES. [2022-12-06 17:47:29,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 474 events. 107/474 cut-off events. For 115/116 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2087 event pairs, 26 based on Foata normal form. 135/549 useless extension candidates. Maximal degree in co-relation 510. Up to 124 conditions per place. [2022-12-06 17:47:29,943 INFO L137 encePairwiseOnDemand]: 104/119 looper letters, 32 selfloop transitions, 5 changer transitions 8/124 dead transitions. [2022-12-06 17:47:29,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 124 transitions, 398 flow [2022-12-06 17:47:29,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 17:47:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 17:47:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 816 transitions. [2022-12-06 17:47:29,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-12-06 17:47:29,983 INFO L294 CegarLoopForPetriNet]: 107 programPoint places, 7 predicate places. [2022-12-06 17:47:29,983 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 124 transitions, 398 flow [2022-12-06 17:47:29,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:47:29,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:47:29,984 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:47:29,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 17:47:29,984 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-06 17:47:29,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:47:29,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1134279214, now seen corresponding path program 1 times [2022-12-06 17:47:29,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:47:29,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540832680] [2022-12-06 17:47:29,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:47:29,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:47:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:47:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:47:30,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:47:30,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540832680] [2022-12-06 17:47:30,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540832680] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:47:30,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243986099] [2022-12-06 17:47:30,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:47:30,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:47:30,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:47:30,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 17:47:30,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 17:47:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:47:30,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 17:47:30,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:47:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:47:30,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:47:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:47:30,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243986099] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:47:30,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:47:30,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-12-06 17:47:30,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644241656] [2022-12-06 17:47:30,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:47:30,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:47:30,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:47:30,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:47:30,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:47:30,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-06 17:47:30,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 124 transitions, 398 flow. Second operand has 9 states, 9 states have (on average 88.22222222222223) internal successors, (794), 9 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:47:30,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:47:30,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-06 17:47:30,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:47:32,051 INFO L130 PetriNetUnfolder]: 6950/10646 cut-off events. [2022-12-06 17:47:32,051 INFO L131 PetriNetUnfolder]: For 4036/4639 co-relation queries the response was YES. [2022-12-06 17:47:32,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23988 conditions, 10646 events. 6950/10646 cut-off events. For 4036/4639 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 72707 event pairs, 282 based on Foata normal form. 17/8290 useless extension candidates. Maximal degree in co-relation 23354. Up to 2111 conditions per place. [2022-12-06 17:47:32,154 INFO L137 encePairwiseOnDemand]: 111/119 looper letters, 198 selfloop transitions, 24 changer transitions 8/303 dead transitions. [2022-12-06 17:47:32,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 303 transitions, 1504 flow [2022-12-06 17:47:32,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 17:47:32,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 17:47:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1382 transitions. [2022-12-06 17:47:32,162 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.82953181272509 [2022-12-06 17:47:32,163 INFO L294 CegarLoopForPetriNet]: 107 programPoint places, 20 predicate places. [2022-12-06 17:47:32,164 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 303 transitions, 1504 flow [2022-12-06 17:47:32,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.22222222222223) internal successors, (794), 9 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:47:32,165 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:47:32,165 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:47:32,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 17:47:32,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:47:32,372 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-06 17:47:32,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:47:32,373 INFO L85 PathProgramCache]: Analyzing trace with hash 615070774, now seen corresponding path program 2 times [2022-12-06 17:47:32,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:47:32,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174895342] [2022-12-06 17:47:32,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:47:32,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:47:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:47:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:47:32,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:47:32,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174895342] [2022-12-06 17:47:32,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174895342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:47:32,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:47:32,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:47:32,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715113647] [2022-12-06 17:47:32,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:47:32,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:47:32,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:47:32,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:47:32,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:47:32,494 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-06 17:47:32,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 303 transitions, 1504 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:47:32,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:47:32,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-06 17:47:32,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:47:34,902 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][524], [65#L73true, 4#L51-2true, 652#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0)), 44#L92-2true, thread2Thread1of1ForFork1InUse, 658#(= thread3Thread1of1ForFork2_~i~2 0), thread4Thread1of1ForFork0InUse, 66#L62-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-06 17:47:34,902 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-06 17:47:34,903 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-06 17:47:34,903 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:47:34,903 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-06 17:47:34,903 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][525], [4#L51-2true, 652#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0)), 44#L92-2true, 658#(= thread3Thread1of1ForFork2_~i~2 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 41#L72-5true, 66#L62-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-06 17:47:34,903 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-06 17:47:34,903 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-06 17:47:34,903 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:47:34,903 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-06 17:47:35,267 INFO L130 PetriNetUnfolder]: 17609/28801 cut-off events. [2022-12-06 17:47:35,267 INFO L131 PetriNetUnfolder]: For 18452/30278 co-relation queries the response was YES. [2022-12-06 17:47:35,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80294 conditions, 28801 events. 17609/28801 cut-off events. For 18452/30278 co-relation queries the response was YES. Maximal size of possible extension queue 1478. Compared 237954 event pairs, 2724 based on Foata normal form. 141/23627 useless extension candidates. Maximal degree in co-relation 78821. Up to 11917 conditions per place. [2022-12-06 17:47:35,536 INFO L137 encePairwiseOnDemand]: 112/119 looper letters, 443 selfloop transitions, 15 changer transitions 46/591 dead transitions. [2022-12-06 17:47:35,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 591 transitions, 4095 flow [2022-12-06 17:47:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:47:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:47:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 586 transitions. [2022-12-06 17:47:35,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8207282913165266 [2022-12-06 17:47:35,542 INFO L294 CegarLoopForPetriNet]: 107 programPoint places, 25 predicate places. [2022-12-06 17:47:35,543 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 591 transitions, 4095 flow [2022-12-06 17:47:35,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:47:35,543 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:47:35,544 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:47:35,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 17:47:35,545 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-06 17:47:35,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:47:35,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1754070172, now seen corresponding path program 3 times [2022-12-06 17:47:35,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:47:35,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512311304] [2022-12-06 17:47:35,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:47:35,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:47:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:47:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:47:35,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:47:35,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512311304] [2022-12-06 17:47:35,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512311304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:47:35,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:47:35,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:47:35,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572135825] [2022-12-06 17:47:35,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:47:35,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:47:35,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:47:35,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:47:35,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:47:35,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-06 17:47:35,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 591 transitions, 4095 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:47:35,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:47:35,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-06 17:47:35,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:47:38,944 INFO L130 PetriNetUnfolder]: 23736/38125 cut-off events. [2022-12-06 17:47:38,944 INFO L131 PetriNetUnfolder]: For 44648/103288 co-relation queries the response was YES. [2022-12-06 17:47:39,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136247 conditions, 38125 events. 23736/38125 cut-off events. For 44648/103288 co-relation queries the response was YES. Maximal size of possible extension queue 1780. Compared 317453 event pairs, 3107 based on Foata normal form. 503/31346 useless extension candidates. Maximal degree in co-relation 116874. Up to 16235 conditions per place. [2022-12-06 17:47:39,234 INFO L137 encePairwiseOnDemand]: 112/119 looper letters, 876 selfloop transitions, 29 changer transitions 87/1067 dead transitions. [2022-12-06 17:47:39,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 1067 transitions, 9748 flow [2022-12-06 17:47:39,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:47:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:47:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 590 transitions. [2022-12-06 17:47:39,237 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8263305322128851 [2022-12-06 17:47:39,237 INFO L294 CegarLoopForPetriNet]: 107 programPoint places, 30 predicate places. [2022-12-06 17:47:39,237 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 1067 transitions, 9748 flow [2022-12-06 17:47:39,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:47:39,238 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:47:39,238 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:47:39,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 17:47:39,239 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-06 17:47:39,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:47:39,239 INFO L85 PathProgramCache]: Analyzing trace with hash 849048160, now seen corresponding path program 1 times [2022-12-06 17:47:39,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:47:39,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007384413] [2022-12-06 17:47:39,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:47:39,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:47:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:47:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:47:39,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:47:39,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007384413] [2022-12-06 17:47:39,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007384413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:47:39,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:47:39,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:47:39,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47817628] [2022-12-06 17:47:39,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:47:39,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:47:39,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:47:39,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:47:39,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:47:39,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-06 17:47:39,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 1067 transitions, 9748 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:47:39,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:47:39,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-06 17:47:39,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:47:45,448 INFO L130 PetriNetUnfolder]: 38748/59048 cut-off events. [2022-12-06 17:47:45,449 INFO L131 PetriNetUnfolder]: For 114638/308599 co-relation queries the response was YES. [2022-12-06 17:47:45,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245451 conditions, 59048 events. 38748/59048 cut-off events. For 114638/308599 co-relation queries the response was YES. Maximal size of possible extension queue 2610. Compared 482848 event pairs, 5657 based on Foata normal form. 1471/50961 useless extension candidates. Maximal degree in co-relation 206310. Up to 21744 conditions per place. [2022-12-06 17:47:45,978 INFO L137 encePairwiseOnDemand]: 113/119 looper letters, 1142 selfloop transitions, 32 changer transitions 90/1434 dead transitions. [2022-12-06 17:47:45,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 1434 transitions, 15735 flow [2022-12-06 17:47:45,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 17:47:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 17:47:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2022-12-06 17:47:45,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8504201680672269 [2022-12-06 17:47:45,981 INFO L294 CegarLoopForPetriNet]: 107 programPoint places, 34 predicate places. [2022-12-06 17:47:45,981 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 1434 transitions, 15735 flow [2022-12-06 17:47:45,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:47:45,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:47:45,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:47:45,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 17:47:45,982 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-06 17:47:45,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:47:45,983 INFO L85 PathProgramCache]: Analyzing trace with hash 654909144, now seen corresponding path program 2 times [2022-12-06 17:47:45,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:47:45,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320768751] [2022-12-06 17:47:45,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:47:45,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:47:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:47:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:47:46,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:47:46,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320768751] [2022-12-06 17:47:46,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320768751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:47:46,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:47:46,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:47:46,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975657422] [2022-12-06 17:47:46,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:47:46,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:47:46,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:47:46,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:47:46,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:47:46,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-06 17:47:46,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 1434 transitions, 15735 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:47:46,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:47:46,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-06 17:47:46,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:47:49,210 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][760], [33#L51-3true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 79#L41-2true, 66#L62-4true, 665#true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 65#L73true, 681#(= thread1Thread1of1ForFork3_~i~0 0), 143#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= (+ thread1Thread1of1ForFork3_~i~0 1) ~N~0)), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-06 17:47:49,210 INFO L382 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2022-12-06 17:47:49,210 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:47:49,210 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:47:49,210 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:47:49,211 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][761], [33#L51-3true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 79#L41-2true, 41#L72-5true, 66#L62-4true, 665#true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 681#(= thread1Thread1of1ForFork3_~i~0 0), 143#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= (+ thread1Thread1of1ForFork3_~i~0 1) ~N~0)), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-06 17:47:49,211 INFO L382 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2022-12-06 17:47:49,211 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:47:49,211 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:47:49,211 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:47:52,949 INFO L130 PetriNetUnfolder]: 38978/59550 cut-off events. [2022-12-06 17:47:52,950 INFO L131 PetriNetUnfolder]: For 163829/323924 co-relation queries the response was YES. [2022-12-06 17:47:53,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291706 conditions, 59550 events. 38978/59550 cut-off events. For 163829/323924 co-relation queries the response was YES. Maximal size of possible extension queue 2594. Compared 488512 event pairs, 5510 based on Foata normal form. 1474/51494 useless extension candidates. Maximal degree in co-relation 273321. Up to 29954 conditions per place. [2022-12-06 17:47:53,438 INFO L137 encePairwiseOnDemand]: 112/119 looper letters, 1315 selfloop transitions, 48 changer transitions 199/1663 dead transitions. [2022-12-06 17:47:53,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 1663 transitions, 21486 flow [2022-12-06 17:47:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:47:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:47:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 587 transitions. [2022-12-06 17:47:53,440 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8221288515406162 [2022-12-06 17:47:53,441 INFO L294 CegarLoopForPetriNet]: 107 programPoint places, 39 predicate places. [2022-12-06 17:47:53,441 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 1663 transitions, 21486 flow [2022-12-06 17:47:53,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:47:53,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:47:53,442 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:47:53,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 17:47:53,442 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-06 17:47:53,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:47:53,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1986351146, now seen corresponding path program 3 times [2022-12-06 17:47:53,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:47:53,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75147796] [2022-12-06 17:47:53,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:47:53,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:47:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:47:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:47:53,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:47:53,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75147796] [2022-12-06 17:47:53,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75147796] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:47:53,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401165796] [2022-12-06 17:47:53,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 17:47:53,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:47:53,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:47:53,536 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 17:47:53,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 17:47:53,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 17:47:53,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:47:53,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 17:47:53,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:47:53,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:47:53,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:47:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:47:53,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401165796] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:47:53,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:47:53,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-12-06 17:47:53,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893364048] [2022-12-06 17:47:53,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:47:53,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:47:53,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:47:53,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:47:53,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:47:53,708 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-06 17:47:53,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 1663 transitions, 21486 flow. Second operand has 9 states, 9 states have (on average 88.11111111111111) internal successors, (793), 9 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:47:53,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:47:53,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-06 17:47:53,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:48:00,851 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][1726], [1189#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0)), 44#L92-2true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 65#L73true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-06 17:48:00,852 INFO L382 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-12-06 17:48:00,852 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:48:00,852 INFO L385 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-06 17:48:00,852 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:48:00,852 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][1727], [690#(= thread3Thread1of1ForFork2_~i~2 0), 44#L92-2true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 41#L72-5true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-06 17:48:00,852 INFO L382 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-12-06 17:48:00,852 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:48:00,852 INFO L385 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-06 17:48:00,852 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:48:02,372 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][2164], [691#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 44#L92-2true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 41#L72-5true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 677#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true, 23#L62-2true]) [2022-12-06 17:48:02,372 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-06 17:48:02,372 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:48:02,373 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-06 17:48:02,373 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-06 17:48:02,373 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][2165], [44#L92-2true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 65#L73true, 679#true, 1191#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 677#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true, 23#L62-2true]) [2022-12-06 17:48:02,373 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-06 17:48:02,373 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:48:02,373 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-06 17:48:02,373 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-06 17:48:02,687 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][2534], [99#L62-3true, 44#L92-2true, 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 1195#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (<= 1 ~N~0)), 65#L73true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 674#true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 656#true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-06 17:48:02,687 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-06 17:48:02,687 INFO L385 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-06 17:48:02,687 INFO L385 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-06 17:48:02,687 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 17:48:02,687 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][2535], [99#L62-3true, 44#L92-2true, 692#(<= 1 ~N~0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 41#L72-5true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 674#true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 656#true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-06 17:48:02,687 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-06 17:48:02,687 INFO L385 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-06 17:48:02,688 INFO L385 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-06 17:48:02,688 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 17:48:03,896 INFO L130 PetriNetUnfolder]: 45970/69444 cut-off events. [2022-12-06 17:48:03,897 INFO L131 PetriNetUnfolder]: For 178490/313668 co-relation queries the response was YES. [2022-12-06 17:48:04,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397809 conditions, 69444 events. 45970/69444 cut-off events. For 178490/313668 co-relation queries the response was YES. Maximal size of possible extension queue 2941. Compared 564278 event pairs, 2279 based on Foata normal form. 1751/60956 useless extension candidates. Maximal degree in co-relation 332356. Up to 35489 conditions per place. [2022-12-06 17:48:04,711 INFO L137 encePairwiseOnDemand]: 111/119 looper letters, 2364 selfloop transitions, 361 changer transitions 303/3198 dead transitions. [2022-12-06 17:48:04,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 3198 transitions, 47868 flow [2022-12-06 17:48:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 17:48:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 17:48:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1385 transitions. [2022-12-06 17:48:04,715 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8313325330132053 [2022-12-06 17:48:04,715 INFO L294 CegarLoopForPetriNet]: 107 programPoint places, 52 predicate places. [2022-12-06 17:48:04,716 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 3198 transitions, 47868 flow [2022-12-06 17:48:04,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.11111111111111) internal successors, (793), 9 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:48:04,716 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:48:04,716 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:48:04,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 17:48:04,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-06 17:48:04,917 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-06 17:48:04,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:48:04,918 INFO L85 PathProgramCache]: Analyzing trace with hash 752981516, now seen corresponding path program 4 times [2022-12-06 17:48:04,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:48:04,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721179784] [2022-12-06 17:48:04,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:48:04,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:48:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:48:05,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:48:05,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:48:05,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721179784] [2022-12-06 17:48:05,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721179784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:48:05,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:48:05,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:48:05,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278410102] [2022-12-06 17:48:05,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:48:05,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:48:05,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:48:05,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:48:05,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:48:05,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-06 17:48:05,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 3198 transitions, 47868 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:48:05,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:48:05,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-06 17:48:05,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:48:11,040 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][1761], [690#(= thread3Thread1of1ForFork2_~i~2 0), 83#L42true, 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 145#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 41#L72-5true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-06 17:48:11,040 INFO L382 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2022-12-06 17:48:11,040 INFO L385 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2022-12-06 17:48:11,040 INFO L385 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2022-12-06 17:48:11,040 INFO L385 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-12-06 17:48:11,041 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][1762], [1189#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0)), 83#L42true, 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 145#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 65#L73true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-06 17:48:11,041 INFO L382 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2022-12-06 17:48:11,041 INFO L385 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2022-12-06 17:48:11,041 INFO L385 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2022-12-06 17:48:11,041 INFO L385 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-12-06 17:48:12,067 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][1761], [690#(= thread3Thread1of1ForFork2_~i~2 0), 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 145#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 63#L44true, 41#L72-5true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, 98#L51-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-06 17:48:12,067 INFO L382 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2022-12-06 17:48:12,068 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:48:12,068 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:48:12,068 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:48:12,068 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][1762], [1189#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0)), 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 145#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 63#L44true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 65#L73true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, 98#L51-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-06 17:48:12,068 INFO L382 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2022-12-06 17:48:12,068 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:48:12,068 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:48:12,068 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:48:12,222 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][1079], [33#L51-3true, 690#(= thread3Thread1of1ForFork2_~i~2 0), 658#(= thread3Thread1of1ForFork2_~i~2 0), 41#L72-5true, 79#L41-2true, 66#L62-4true, 665#true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 681#(= thread1Thread1of1ForFork3_~i~0 0), 1200#(= thread1Thread1of1ForFork3_~i~0 0), 143#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= (+ thread1Thread1of1ForFork3_~i~0 1) ~N~0)), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-06 17:48:12,223 INFO L382 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2022-12-06 17:48:12,223 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:48:12,223 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:48:12,223 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:48:12,223 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][1080], [1189#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0)), 33#L51-3true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 79#L41-2true, 66#L62-4true, 665#true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 65#L73true, 681#(= thread1Thread1of1ForFork3_~i~0 0), 1200#(= thread1Thread1of1ForFork3_~i~0 0), 143#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= (+ thread1Thread1of1ForFork3_~i~0 1) ~N~0)), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-06 17:48:12,223 INFO L382 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2022-12-06 17:48:12,223 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:48:12,223 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:48:12,223 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:48:12,223 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][1241], [111#L41-3true, 33#L51-3true, 1198#true, 1035#(< |thread4Thread1of1ForFork0_~i~3#1| ~N~0), 665#true, 10#$Ultimate##0true, 65#L73true, 679#true, 674#true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 656#true, 7#L91-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true, 144#(<= 1 ~N~0)]) [2022-12-06 17:48:12,223 INFO L382 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2022-12-06 17:48:12,224 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:48:12,224 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:48:12,224 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:48:12,224 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][1242], [111#L41-3true, 33#L51-3true, 1198#true, 41#L72-5true, 688#true, 665#true, 10#$Ultimate##0true, 679#true, 674#true, thread2Thread1of1ForFork1InUse, 656#true, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 144#(<= 1 ~N~0), 126#true]) [2022-12-06 17:48:12,224 INFO L382 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2022-12-06 17:48:12,224 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:48:12,224 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:48:12,224 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-06 17:48:12,835 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][1468], [111#L41-3true, 1198#true, 145#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 688#true, 41#L72-5true, 10#$Ultimate##0true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 674#true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 656#true, 7#L91-4true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-06 17:48:12,835 INFO L382 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2022-12-06 17:48:12,836 INFO L385 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-06 17:48:12,836 INFO L385 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-06 17:48:12,836 INFO L385 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-06 17:48:12,836 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][1469], [111#L41-3true, 1198#true, 145#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 1035#(< |thread4Thread1of1ForFork0_~i~3#1| ~N~0), 10#$Ultimate##0true, 65#L73true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 674#true, thread2Thread1of1ForFork1InUse, 656#true, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-06 17:48:12,836 INFO L382 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2022-12-06 17:48:12,836 INFO L385 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-06 17:48:12,836 INFO L385 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-06 17:48:12,836 INFO L385 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-06 17:48:13,062 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][1761], [690#(= thread3Thread1of1ForFork2_~i~2 0), 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 145#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 79#L41-2true, 41#L72-5true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, 98#L51-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-06 17:48:13,063 INFO L382 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2022-12-06 17:48:13,063 INFO L385 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-06 17:48:13,063 INFO L385 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-12-06 17:48:13,063 INFO L385 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-06 17:48:13,063 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][1762], [1189#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0)), 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 145#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 79#L41-2true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 65#L73true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, 98#L51-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-06 17:48:13,063 INFO L382 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2022-12-06 17:48:13,063 INFO L385 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-06 17:48:13,063 INFO L385 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-12-06 17:48:13,064 INFO L385 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-06 17:48:18,863 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][2327], [1189#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0)), 1198#true, 44#L92-2true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 65#L73true, 679#true, 4#L51-2true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-06 17:48:18,863 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-06 17:48:18,863 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-06 17:48:18,863 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-06 17:48:18,863 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:48:18,864 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][2328], [690#(= thread3Thread1of1ForFork2_~i~2 0), 44#L92-2true, 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 41#L72-5true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 679#true, 4#L51-2true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-06 17:48:18,864 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-06 17:48:18,864 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:48:18,864 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-06 17:48:18,864 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-06 17:48:18,882 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][2867], [691#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 1198#true, 44#L92-2true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 41#L72-5true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 677#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true, 23#L62-2true]) [2022-12-06 17:48:18,883 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-06 17:48:18,883 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-06 17:48:18,883 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-06 17:48:18,883 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:48:18,883 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][2868], [44#L92-2true, 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 65#L73true, 679#true, 1191#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 677#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true, 23#L62-2true]) [2022-12-06 17:48:18,883 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-06 17:48:18,884 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-06 17:48:18,884 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-06 17:48:18,884 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:48:19,326 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][3346], [99#L62-3true, 44#L92-2true, 1198#true, 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 1195#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (<= 1 ~N~0)), 65#L73true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 674#true, thread2Thread1of1ForFork1InUse, 656#true, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-06 17:48:19,326 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-06 17:48:19,326 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 17:48:19,327 INFO L385 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-06 17:48:19,327 INFO L385 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-06 17:48:19,327 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][3347], [99#L62-3true, 44#L92-2true, 1198#true, 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 692#(<= 1 ~N~0), 41#L72-5true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 674#true, thread2Thread1of1ForFork1InUse, 656#true, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-06 17:48:19,327 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-06 17:48:19,327 INFO L385 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-06 17:48:19,327 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 17:48:19,327 INFO L385 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-06 17:48:20,586 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][3727], [1189#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0)), 652#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0)), 44#L92-2true, 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 665#true, 65#L73true, 679#true, 4#L51-2true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-06 17:48:20,587 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 17:48:20,587 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:48:20,587 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 17:48:20,587 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:48:20,587 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][3728], [652#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0)), 690#(= thread3Thread1of1ForFork2_~i~2 0), 44#L92-2true, 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 41#L72-5true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 665#true, 679#true, 4#L51-2true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-06 17:48:20,587 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 17:48:20,587 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:48:20,587 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 17:48:20,587 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:48:21,201 INFO L130 PetriNetUnfolder]: 54070/80993 cut-off events. [2022-12-06 17:48:21,201 INFO L131 PetriNetUnfolder]: For 325279/1429253 co-relation queries the response was YES. [2022-12-06 17:48:21,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525372 conditions, 80993 events. 54070/80993 cut-off events. For 325279/1429253 co-relation queries the response was YES. Maximal size of possible extension queue 3338. Compared 659132 event pairs, 2356 based on Foata normal form. 3217/71703 useless extension candidates. Maximal degree in co-relation 440643. Up to 37365 conditions per place. [2022-12-06 17:48:21,976 INFO L137 encePairwiseOnDemand]: 111/119 looper letters, 3339 selfloop transitions, 145 changer transitions 464/4076 dead transitions. [2022-12-06 17:48:21,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 4076 transitions, 69458 flow [2022-12-06 17:48:21,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:48:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:48:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2022-12-06 17:48:21,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8557422969187675 [2022-12-06 17:48:21,979 INFO L294 CegarLoopForPetriNet]: 107 programPoint places, 57 predicate places. [2022-12-06 17:48:21,979 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 4076 transitions, 69458 flow [2022-12-06 17:48:21,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:48:21,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:48:21,980 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:48:21,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 17:48:21,980 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-06 17:48:21,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:48:21,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1647996698, now seen corresponding path program 5 times [2022-12-06 17:48:21,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:48:21,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268377889] [2022-12-06 17:48:21,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:48:21,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:48:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:48:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:48:22,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:48:22,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268377889] [2022-12-06 17:48:22,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268377889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:48:22,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:48:22,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:48:22,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21907532] [2022-12-06 17:48:22,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:48:22,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:48:22,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:48:22,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:48:22,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:48:22,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-06 17:48:22,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 4076 transitions, 69458 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:48:22,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:48:22,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-06 17:48:22,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:48:54,420 INFO L130 PetriNetUnfolder]: 70052/109283 cut-off events. [2022-12-06 17:48:54,421 INFO L131 PetriNetUnfolder]: For 530208/1071813 co-relation queries the response was YES. [2022-12-06 17:48:54,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755995 conditions, 109283 events. 70052/109283 cut-off events. For 530208/1071813 co-relation queries the response was YES. Maximal size of possible extension queue 4631. Compared 969816 event pairs, 3152 based on Foata normal form. 2352/97145 useless extension candidates. Maximal degree in co-relation 638156. Up to 46964 conditions per place. [2022-12-06 17:48:55,864 INFO L137 encePairwiseOnDemand]: 111/119 looper letters, 5134 selfloop transitions, 361 changer transitions 947/6575 dead transitions. [2022-12-06 17:48:55,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 6575 transitions, 124247 flow [2022-12-06 17:48:55,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:48:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:48:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 612 transitions. [2022-12-06 17:48:55,866 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-12-06 17:48:55,867 INFO L294 CegarLoopForPetriNet]: 107 programPoint places, 62 predicate places. [2022-12-06 17:48:55,867 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 6575 transitions, 124247 flow [2022-12-06 17:48:55,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:48:55,868 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:48:55,868 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:48:55,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 17:48:55,868 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-06 17:48:55,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:48:55,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1053780422, now seen corresponding path program 6 times [2022-12-06 17:48:55,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:48:55,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658315182] [2022-12-06 17:48:55,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:48:55,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:48:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:48:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:48:55,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:48:55,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658315182] [2022-12-06 17:48:55,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658315182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:48:55,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:48:55,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 17:48:55,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912308501] [2022-12-06 17:48:55,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:48:55,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 17:48:55,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:48:55,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 17:48:55,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 17:48:55,963 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-06 17:48:55,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 6575 transitions, 124247 flow. Second operand has 6 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:48:55,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:48:55,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-06 17:48:55,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:49:46,379 INFO L130 PetriNetUnfolder]: 81028/125015 cut-off events. [2022-12-06 17:49:46,380 INFO L131 PetriNetUnfolder]: For 768697/1589231 co-relation queries the response was YES. [2022-12-06 17:49:46,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 954915 conditions, 125015 events. 81028/125015 cut-off events. For 768697/1589231 co-relation queries the response was YES. Maximal size of possible extension queue 5330. Compared 1115922 event pairs, 3542 based on Foata normal form. 3135/112616 useless extension candidates. Maximal degree in co-relation 806296. Up to 53562 conditions per place. [2022-12-06 17:49:47,720 INFO L137 encePairwiseOnDemand]: 111/119 looper letters, 5703 selfloop transitions, 194 changer transitions 852/6939 dead transitions. [2022-12-06 17:49:47,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 6939 transitions, 144603 flow [2022-12-06 17:49:47,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:49:47,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:49:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 618 transitions. [2022-12-06 17:49:47,722 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.865546218487395 [2022-12-06 17:49:47,723 INFO L294 CegarLoopForPetriNet]: 107 programPoint places, 67 predicate places. [2022-12-06 17:49:47,723 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 6939 transitions, 144603 flow [2022-12-06 17:49:47,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:49:47,724 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:49:47,724 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:49:47,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 17:49:47,724 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-06 17:49:47,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:49:47,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1656331686, now seen corresponding path program 4 times [2022-12-06 17:49:47,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:49:47,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670809633] [2022-12-06 17:49:47,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:49:47,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:49:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:49:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:49:47,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:49:47,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670809633] [2022-12-06 17:49:47,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670809633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:49:47,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:49:47,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:49:47,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230965282] [2022-12-06 17:49:47,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:49:47,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:49:47,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:49:47,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:49:47,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:49:47,799 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-06 17:49:47,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 6939 transitions, 144603 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:49:47,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:49:47,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-06 17:49:47,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand