/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:44:42,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:44:42,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:44:42,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:44:42,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:44:42,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:44:42,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:44:42,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:44:42,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:44:42,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:44:42,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:44:42,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:44:42,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:44:42,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:44:42,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:44:42,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:44:42,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:44:42,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:44:42,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:44:42,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:44:42,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:44:42,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:44:42,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:44:42,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:44:42,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:44:42,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:44:42,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:44:42,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:44:42,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:44:42,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:44:42,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:44:42,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:44:42,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:44:42,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:44:42,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:44:42,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:44:42,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:44:42,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:44:42,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:44:42,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:44:42,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:44:42,989 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-SemanticLbe.epf [2022-12-05 20:44:43,011 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:44:43,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:44:43,013 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:44:43,013 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:44:43,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:44:43,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:44:43,014 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:44:43,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:44:43,014 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:44:43,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:44:43,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:44:43,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:44:43,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:44:43,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:44:43,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:44:43,015 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:44:43,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:44:43,015 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:44:43,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:44:43,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:44:43,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:44:43,016 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:44:43,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:44:43,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:44:43,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:44:43,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:44:43,016 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:44:43,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:44:43,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:44:43,017 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:44:43,017 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 20:44:43,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:44:43,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:44:43,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:44:43,287 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:44:43,287 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:44:43,288 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i [2022-12-05 20:44:44,269 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:44:44,496 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:44:44,496 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i [2022-12-05 20:44:44,509 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acac62e15/d76a0d91725e48768da509034039d66a/FLAG6207dbac1 [2022-12-05 20:44:44,519 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acac62e15/d76a0d91725e48768da509034039d66a [2022-12-05 20:44:44,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:44:44,521 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:44:44,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:44:44,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:44:44,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:44:44,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:44:44" (1/1) ... [2022-12-05 20:44:44,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@752e2619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:44:44, skipping insertion in model container [2022-12-05 20:44:44,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:44:44" (1/1) ... [2022-12-05 20:44:44,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:44:44,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:44:44,661 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i[1087,1100] [2022-12-05 20:44:44,812 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-05 20:44:44,816 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-05 20:44:44,822 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-05 20:44:44,827 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-05 20:44:44,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:44:44,838 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:44:44,845 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i[1087,1100] [2022-12-05 20:44:44,870 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-05 20:44:44,874 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-05 20:44:44,879 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-05 20:44:44,887 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-05 20:44:44,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:44:44,939 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:44:44,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:44:44 WrapperNode [2022-12-05 20:44:44,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:44:44,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:44:44,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:44:44,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:44:44,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:44:44" (1/1) ... [2022-12-05 20:44:44,972 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:44:44" (1/1) ... [2022-12-05 20:44:45,001 INFO L138 Inliner]: procedures = 271, calls = 45, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 105 [2022-12-05 20:44:45,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:44:45,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:44:45,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:44:45,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:44:45,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:44:44" (1/1) ... [2022-12-05 20:44:45,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:44:44" (1/1) ... [2022-12-05 20:44:45,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:44:44" (1/1) ... [2022-12-05 20:44:45,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:44:44" (1/1) ... [2022-12-05 20:44:45,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:44:44" (1/1) ... [2022-12-05 20:44:45,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:44:44" (1/1) ... [2022-12-05 20:44:45,038 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:44:44" (1/1) ... [2022-12-05 20:44:45,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:44:44" (1/1) ... [2022-12-05 20:44:45,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:44:45,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:44:45,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:44:45,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:44:45,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:44:44" (1/1) ... [2022-12-05 20:44:45,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:44:45,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:44:45,079 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-05 20:44:45,082 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-05 20:44:45,105 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2022-12-05 20:44:45,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:44:45,105 INFO L130 BoogieDeclarations]: Found specification of procedure generate [2022-12-05 20:44:45,105 INFO L138 BoogieDeclarations]: Found implementation of procedure generate [2022-12-05 20:44:45,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:44:45,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:44:45,105 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 20:44:45,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:44:45,106 INFO L130 BoogieDeclarations]: Found specification of procedure dispose [2022-12-05 20:44:45,106 INFO L138 BoogieDeclarations]: Found implementation of procedure dispose [2022-12-05 20:44:45,106 INFO L130 BoogieDeclarations]: Found specification of procedure process [2022-12-05 20:44:45,106 INFO L138 BoogieDeclarations]: Found implementation of procedure process [2022-12-05 20:44:45,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:44:45,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:44:45,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:44:45,107 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:44:45,313 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:44:45,314 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:44:45,454 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:44:45,460 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:44:45,460 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-05 20:44:45,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:44:45 BoogieIcfgContainer [2022-12-05 20:44:45,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:44:45,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:44:45,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:44:45,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:44:45,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:44:44" (1/3) ... [2022-12-05 20:44:45,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c72a90a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:44:45, skipping insertion in model container [2022-12-05 20:44:45,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:44:44" (2/3) ... [2022-12-05 20:44:45,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c72a90a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:44:45, skipping insertion in model container [2022-12-05 20:44:45,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:44:45" (3/3) ... [2022-12-05 20:44:45,466 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_04-priv_multi_true.i [2022-12-05 20:44:45,478 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:44:45,478 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:44:45,478 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:44:45,533 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:44:45,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 152 transitions, 319 flow [2022-12-05 20:44:45,626 INFO L130 PetriNetUnfolder]: 12/149 cut-off events. [2022-12-05 20:44:45,626 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:44:45,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 149 events. 12/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 313 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-12-05 20:44:45,632 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 152 transitions, 319 flow [2022-12-05 20:44:45,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 149 transitions, 307 flow [2022-12-05 20:44:45,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:44:45,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 149 transitions, 307 flow [2022-12-05 20:44:45,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 149 transitions, 307 flow [2022-12-05 20:44:45,712 INFO L130 PetriNetUnfolder]: 12/149 cut-off events. [2022-12-05 20:44:45,712 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:44:45,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 149 events. 12/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 314 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-12-05 20:44:45,718 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 149 transitions, 307 flow [2022-12-05 20:44:45,718 INFO L188 LiptonReduction]: Number of co-enabled transitions 8738 [2022-12-05 20:44:49,935 INFO L203 LiptonReduction]: Total number of compositions: 111 [2022-12-05 20:44:49,945 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:44:49,949 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;@be5dafa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:44:49,949 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 20:44:49,953 INFO L130 PetriNetUnfolder]: 4/38 cut-off events. [2022-12-05 20:44:49,953 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:44:49,953 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:44:49,954 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:44:49,954 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 3 more)] === [2022-12-05 20:44:49,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:44:49,957 INFO L85 PathProgramCache]: Analyzing trace with hash 972956223, now seen corresponding path program 1 times [2022-12-05 20:44:49,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:44:49,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428855946] [2022-12-05 20:44:49,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:44:49,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:44:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:44:50,379 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-05 20:44:50,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:44:50,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428855946] [2022-12-05 20:44:50,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428855946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:44:50,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:44:50,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:44:50,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043131543] [2022-12-05 20:44:50,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:44:50,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:44:50,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:44:50,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:44:50,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:44:50,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2022-12-05 20:44:50,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-05 20:44:50,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:44:50,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2022-12-05 20:44:50,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:44:51,470 INFO L130 PetriNetUnfolder]: 15726/21468 cut-off events. [2022-12-05 20:44:51,471 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-05 20:44:51,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42368 conditions, 21468 events. 15726/21468 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 115312 event pairs, 3672 based on Foata normal form. 0/17457 useless extension candidates. Maximal degree in co-relation 42357. Up to 15501 conditions per place. [2022-12-05 20:44:51,636 INFO L137 encePairwiseOnDemand]: 39/51 looper letters, 64 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2022-12-05 20:44:51,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 309 flow [2022-12-05 20:44:51,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:44:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:44:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2022-12-05 20:44:51,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-05 20:44:51,646 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 111 flow. Second operand 3 states and 102 transitions. [2022-12-05 20:44:51,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 309 flow [2022-12-05 20:44:51,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 77 transitions, 304 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:44:51,651 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 134 flow [2022-12-05 20:44:51,652 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2022-12-05 20:44:51,654 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2022-12-05 20:44:51,654 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 134 flow [2022-12-05 20:44:51,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-05 20:44:51,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:44:51,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:44:51,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:44:51,655 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:44:51,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:44:51,655 INFO L85 PathProgramCache]: Analyzing trace with hash 148386387, now seen corresponding path program 1 times [2022-12-05 20:44:51,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:44:51,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348069347] [2022-12-05 20:44:51,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:44:51,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:44:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:44:51,772 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-05 20:44:51,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:44:51,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348069347] [2022-12-05 20:44:51,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348069347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:44:51,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:44:51,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:44:51,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724259060] [2022-12-05 20:44:51,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:44:51,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:44:51,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:44:51,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:44:51,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:44:51,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2022-12-05 20:44:51,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-05 20:44:51,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:44:51,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2022-12-05 20:44:51,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:44:53,507 INFO L130 PetriNetUnfolder]: 24641/34744 cut-off events. [2022-12-05 20:44:53,508 INFO L131 PetriNetUnfolder]: For 5075/5075 co-relation queries the response was YES. [2022-12-05 20:44:53,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74026 conditions, 34744 events. 24641/34744 cut-off events. For 5075/5075 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 205937 event pairs, 4890 based on Foata normal form. 0/29431 useless extension candidates. Maximal degree in co-relation 74015. Up to 12076 conditions per place. [2022-12-05 20:44:53,653 INFO L137 encePairwiseOnDemand]: 45/51 looper letters, 114 selfloop transitions, 6 changer transitions 0/131 dead transitions. [2022-12-05 20:44:53,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 131 transitions, 582 flow [2022-12-05 20:44:53,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:44:53,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:44:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2022-12-05 20:44:53,655 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6509803921568628 [2022-12-05 20:44:53,655 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 134 flow. Second operand 5 states and 166 transitions. [2022-12-05 20:44:53,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 131 transitions, 582 flow [2022-12-05 20:44:53,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 131 transitions, 568 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:44:53,666 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 184 flow [2022-12-05 20:44:53,666 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2022-12-05 20:44:53,667 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2022-12-05 20:44:53,667 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 184 flow [2022-12-05 20:44:53,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-05 20:44:53,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:44:53,667 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:44:53,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:44:53,668 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 3 more)] === [2022-12-05 20:44:53,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:44:53,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1897073623, now seen corresponding path program 1 times [2022-12-05 20:44:53,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:44:53,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720757776] [2022-12-05 20:44:53,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:44:53,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:44:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:44:53,794 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-05 20:44:53,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:44:53,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720757776] [2022-12-05 20:44:53,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720757776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:44:53,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:44:53,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:44:53,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136205135] [2022-12-05 20:44:53,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:44:53,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:44:53,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:44:53,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:44:53,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:44:53,796 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2022-12-05 20:44:53,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:44:53,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:44:53,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2022-12-05 20:44:53,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:44:54,870 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([558] L1190-->L1186-2: Formula: (and (not (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_6| 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_4| |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_6|) (= |v_#pthreadsMutex_Out_14| (store |v_#pthreadsMutex_In_6| |v_~#mutex_B~0.base_In_8| (store (select |v_#pthreadsMutex_In_6| |v_~#mutex_B~0.base_In_8|) |v_~#mutex_B~0.offset_In_8| 0))) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_4| (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_2| 5) 1 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_6|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_2|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_8|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_8|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_6|, #pthreadsMutex=|v_#pthreadsMutex_Out_14|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_2|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_8|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_8|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_4|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_10|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][82], [18#L1186-2true, 161#(= ~B~0 ~A~0), Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), 62#$Ultimate##0true, 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, Black: 163#true, 173#true, 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse]) [2022-12-05 20:44:54,871 INFO L382 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-05 20:44:54,871 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-05 20:44:54,871 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:44:54,871 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:54,871 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([544] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_51|) 1 0) |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= (store |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166| (store (select |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166|) |v_~#mutex_B~0.offset_166| 0)) |v_#pthreadsMutex_591|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_592|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53|, #pthreadsMutex=|v_#pthreadsMutex_591|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][83], [161#(= ~B~0 ~A~0), 59#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), 62#$Ultimate##0true, Black: 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 173#true, 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 163#true]) [2022-12-05 20:44:54,871 INFO L382 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-05 20:44:54,871 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-05 20:44:54,871 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:44:54,871 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:54,969 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([558] L1190-->L1186-2: Formula: (and (not (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_6| 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_4| |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_6|) (= |v_#pthreadsMutex_Out_14| (store |v_#pthreadsMutex_In_6| |v_~#mutex_B~0.base_In_8| (store (select |v_#pthreadsMutex_In_6| |v_~#mutex_B~0.base_In_8|) |v_~#mutex_B~0.offset_In_8| 0))) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_4| (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_2| 5) 1 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_6|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_2|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_8|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_8|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_6|, #pthreadsMutex=|v_#pthreadsMutex_Out_14|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_2|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_8|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_8|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_4|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_10|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][82], [18#L1186-2true, 161#(= ~B~0 ~A~0), Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, Black: 163#true, 173#true, 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 12#L1157-6true]) [2022-12-05 20:44:54,970 INFO L382 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-05 20:44:54,970 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:44:54,970 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:54,970 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-05 20:44:54,970 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([544] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_51|) 1 0) |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= (store |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166| (store (select |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166|) |v_~#mutex_B~0.offset_166| 0)) |v_#pthreadsMutex_591|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_592|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53|, #pthreadsMutex=|v_#pthreadsMutex_591|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][83], [161#(= ~B~0 ~A~0), 59#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, 173#true, 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 12#L1157-6true, 163#true]) [2022-12-05 20:44:54,970 INFO L382 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-05 20:44:54,970 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:54,970 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-05 20:44:54,971 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:44:55,082 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([558] L1190-->L1186-2: Formula: (and (not (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_6| 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_4| |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_6|) (= |v_#pthreadsMutex_Out_14| (store |v_#pthreadsMutex_In_6| |v_~#mutex_B~0.base_In_8| (store (select |v_#pthreadsMutex_In_6| |v_~#mutex_B~0.base_In_8|) |v_~#mutex_B~0.offset_In_8| 0))) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_4| (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_2| 5) 1 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_6|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_2|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_8|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_8|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_6|, #pthreadsMutex=|v_#pthreadsMutex_Out_14|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_2|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_8|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_8|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_4|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_10|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][82], [18#L1186-2true, 161#(= ~B~0 ~A~0), 88#generateEXITtrue, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, Black: 163#true, 173#true, 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse]) [2022-12-05 20:44:55,082 INFO L382 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-05 20:44:55,082 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-05 20:44:55,082 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-05 20:44:55,082 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:55,082 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([544] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_51|) 1 0) |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= (store |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166| (store (select |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166|) |v_~#mutex_B~0.offset_166| 0)) |v_#pthreadsMutex_591|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_592|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53|, #pthreadsMutex=|v_#pthreadsMutex_591|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][83], [161#(= ~B~0 ~A~0), 59#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 88#generateEXITtrue, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, 173#true, 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 163#true]) [2022-12-05 20:44:55,082 INFO L382 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-05 20:44:55,082 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-05 20:44:55,082 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:55,082 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-05 20:44:55,665 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([544] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_51|) 1 0) |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= (store |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166| (store (select |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166|) |v_~#mutex_B~0.offset_166| 0)) |v_#pthreadsMutex_591|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_592|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53|, #pthreadsMutex=|v_#pthreadsMutex_591|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][76], [161#(= ~B~0 ~A~0), 33#L19true, 59#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), 62#$Ultimate##0true, Black: 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, 173#true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 163#true]) [2022-12-05 20:44:55,665 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-05 20:44:55,665 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:44:55,665 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-05 20:44:55,665 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-05 20:44:55,665 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([544] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_51|) 1 0) |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= (store |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166| (store (select |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166|) |v_~#mutex_B~0.offset_166| 0)) |v_#pthreadsMutex_591|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_592|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53|, #pthreadsMutex=|v_#pthreadsMutex_591|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][83], [161#(= ~B~0 ~A~0), 59#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), 62#$Ultimate##0true, Black: 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, 173#true, 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 163#true]) [2022-12-05 20:44:55,665 INFO L382 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-05 20:44:55,665 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:44:55,666 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-05 20:44:55,666 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:44:55,666 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:55,735 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([544] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_51|) 1 0) |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= (store |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166| (store (select |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166|) |v_~#mutex_B~0.offset_166| 0)) |v_#pthreadsMutex_591|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_592|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53|, #pthreadsMutex=|v_#pthreadsMutex_591|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][76], [161#(= ~B~0 ~A~0), 33#L19true, 59#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 173#true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 12#L1157-6true, 163#true]) [2022-12-05 20:44:55,736 INFO L382 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-05 20:44:55,736 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-05 20:44:55,736 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:55,736 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:44:55,736 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([544] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_51|) 1 0) |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= (store |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166| (store (select |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166|) |v_~#mutex_B~0.offset_166| 0)) |v_#pthreadsMutex_591|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_592|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53|, #pthreadsMutex=|v_#pthreadsMutex_591|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][83], [161#(= ~B~0 ~A~0), 59#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, 173#true, 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 12#L1157-6true, 163#true]) [2022-12-05 20:44:55,736 INFO L382 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-05 20:44:55,736 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:55,736 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-05 20:44:55,736 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:44:55,736 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:55,789 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([544] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_51|) 1 0) |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= (store |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166| (store (select |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166|) |v_~#mutex_B~0.offset_166| 0)) |v_#pthreadsMutex_591|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_592|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53|, #pthreadsMutex=|v_#pthreadsMutex_591|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][76], [33#L19true, 161#(= ~B~0 ~A~0), 59#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 88#generateEXITtrue, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 173#true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 163#true]) [2022-12-05 20:44:55,789 INFO L382 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-05 20:44:55,789 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-05 20:44:55,789 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:44:55,790 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:55,790 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([544] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_51|) 1 0) |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= (store |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166| (store (select |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166|) |v_~#mutex_B~0.offset_166| 0)) |v_#pthreadsMutex_591|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_592|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53|, #pthreadsMutex=|v_#pthreadsMutex_591|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][83], [161#(= ~B~0 ~A~0), 59#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 88#generateEXITtrue, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 173#true, 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 163#true]) [2022-12-05 20:44:55,790 INFO L382 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-05 20:44:55,790 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-05 20:44:55,790 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-05 20:44:55,790 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:55,790 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-05 20:44:55,796 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([544] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_51|) 1 0) |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= (store |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166| (store (select |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166|) |v_~#mutex_B~0.offset_166| 0)) |v_#pthreadsMutex_591|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_592|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53|, #pthreadsMutex=|v_#pthreadsMutex_591|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][76], [161#(= ~B~0 ~A~0), 33#L19true, 59#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), 62#$Ultimate##0true, Black: 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 173#true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 163#true]) [2022-12-05 20:44:55,796 INFO L382 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-05 20:44:55,796 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-05 20:44:55,796 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:44:55,797 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-05 20:44:55,797 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-05 20:44:55,797 INFO L380 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([544] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_51|) 1 0) |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= (store |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166| (store (select |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166|) |v_~#mutex_B~0.offset_166| 0)) |v_#pthreadsMutex_591|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_592|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53|, #pthreadsMutex=|v_#pthreadsMutex_591|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][83], [161#(= ~B~0 ~A~0), 59#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), 62#$Ultimate##0true, Black: 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, 173#true, 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 163#true]) [2022-12-05 20:44:55,797 INFO L382 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-05 20:44:55,797 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:44:55,797 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-05 20:44:55,797 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-05 20:44:55,797 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:44:55,797 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:55,840 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([544] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_51|) 1 0) |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= (store |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166| (store (select |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166|) |v_~#mutex_B~0.offset_166| 0)) |v_#pthreadsMutex_591|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_592|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53|, #pthreadsMutex=|v_#pthreadsMutex_591|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][76], [161#(= ~B~0 ~A~0), 33#L19true, 59#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, 173#true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 12#L1157-6true, 163#true]) [2022-12-05 20:44:55,840 INFO L382 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-05 20:44:55,840 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-05 20:44:55,840 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:55,840 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-05 20:44:55,840 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:44:55,840 INFO L380 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([544] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_51|) 1 0) |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= (store |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166| (store (select |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166|) |v_~#mutex_B~0.offset_166| 0)) |v_#pthreadsMutex_591|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_592|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53|, #pthreadsMutex=|v_#pthreadsMutex_591|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][83], [161#(= ~B~0 ~A~0), 59#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, 173#true, 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 12#L1157-6true, 163#true]) [2022-12-05 20:44:55,840 INFO L382 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-05 20:44:55,840 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:55,840 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-05 20:44:55,840 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:44:55,841 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:55,841 INFO L385 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-05 20:44:55,873 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([544] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_51|) 1 0) |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= (store |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166| (store (select |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166|) |v_~#mutex_B~0.offset_166| 0)) |v_#pthreadsMutex_591|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_592|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53|, #pthreadsMutex=|v_#pthreadsMutex_591|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][76], [33#L19true, 161#(= ~B~0 ~A~0), 59#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 88#generateEXITtrue, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 173#true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 163#true]) [2022-12-05 20:44:55,873 INFO L382 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-05 20:44:55,873 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-05 20:44:55,873 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:44:55,873 INFO L385 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-05 20:44:55,874 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:55,874 INFO L380 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([544] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_51|) 1 0) |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= (store |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166| (store (select |v_#pthreadsMutex_592| |v_~#mutex_B~0.base_166|) |v_~#mutex_B~0.offset_166| 0)) |v_#pthreadsMutex_591|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_592|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_53|, #pthreadsMutex=|v_#pthreadsMutex_591|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_51|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_166|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_166|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][83], [161#(= ~B~0 ~A~0), 59#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 88#generateEXITtrue, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 173#true, 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 163#true]) [2022-12-05 20:44:55,874 INFO L382 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-05 20:44:55,874 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-05 20:44:55,874 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-05 20:44:55,874 INFO L385 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-05 20:44:55,874 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 20:44:55,874 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-05 20:44:56,043 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([467] L1173-->L1174: Formula: (= (+ v_~B~0_14 1) v_~B~0_15) InVars {~B~0=v_~B~0_15} OutVars{~B~0=v_~B~0_14, processThread1of1ForFork2_#t~post7=|v_processThread1of1ForFork2_#t~post7_15|} AuxVars[] AssignedVars[~B~0, processThread1of1ForFork2_#t~post7][74], [Black: 161#(= ~B~0 ~A~0), 18#L1186-2true, 33#L19true, 14#L1161true, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 173#true, Black: 163#true, 65#L1174true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse]) [2022-12-05 20:44:56,044 INFO L382 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-05 20:44:56,044 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-05 20:44:56,044 INFO L385 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-05 20:44:56,044 INFO L385 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-05 20:44:56,057 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([467] L1173-->L1174: Formula: (= (+ v_~B~0_14 1) v_~B~0_15) InVars {~B~0=v_~B~0_15} OutVars{~B~0=v_~B~0_14, processThread1of1ForFork2_#t~post7=|v_processThread1of1ForFork2_#t~post7_15|} AuxVars[] AssignedVars[~B~0, processThread1of1ForFork2_#t~post7][74], [Black: 161#(= ~B~0 ~A~0), 33#L19true, 14#L1161true, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 109#L1188true, 173#true, Black: 163#true, 65#L1174true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse]) [2022-12-05 20:44:56,057 INFO L382 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-05 20:44:56,057 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-05 20:44:56,057 INFO L385 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-05 20:44:56,057 INFO L385 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-05 20:44:56,057 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L1188-->L1194: Formula: (not (< 0 v_~B~0_8)) InVars {~B~0=v_~B~0_8} OutVars{~B~0=v_~B~0_8} AuxVars[] AssignedVars[][67], [161#(= ~B~0 ~A~0), 99#L1194true, 33#L19true, 14#L1161true, Black: 165#(and (<= ~B~0 5) (<= 5 ~B~0)), 166#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 71#L1173true, Black: 168#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 173#true, Black: 163#true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse]) [2022-12-05 20:44:56,057 INFO L382 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-05 20:44:56,058 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-05 20:44:56,058 INFO L385 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-05 20:44:56,058 INFO L385 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-05 20:44:56,156 INFO L130 PetriNetUnfolder]: 32096/48198 cut-off events. [2022-12-05 20:44:56,156 INFO L131 PetriNetUnfolder]: For 19787/22896 co-relation queries the response was YES. [2022-12-05 20:44:56,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110980 conditions, 48198 events. 32096/48198 cut-off events. For 19787/22896 co-relation queries the response was YES. Maximal size of possible extension queue 1497. Compared 334003 event pairs, 7223 based on Foata normal form. 1635/45510 useless extension candidates. Maximal degree in co-relation 110964. Up to 26037 conditions per place. [2022-12-05 20:44:56,408 INFO L137 encePairwiseOnDemand]: 39/51 looper letters, 58 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2022-12-05 20:44:56,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 88 transitions, 420 flow [2022-12-05 20:44:56,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:44:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:44:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2022-12-05 20:44:56,409 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-05 20:44:56,410 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 184 flow. Second operand 3 states and 102 transitions. [2022-12-05 20:44:56,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 88 transitions, 420 flow [2022-12-05 20:44:56,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 420 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:44:56,417 INFO L231 Difference]: Finished difference. Result has 60 places, 65 transitions, 273 flow [2022-12-05 20:44:56,417 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=273, PETRI_PLACES=60, PETRI_TRANSITIONS=65} [2022-12-05 20:44:56,418 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2022-12-05 20:44:56,418 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 65 transitions, 273 flow [2022-12-05 20:44:56,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:44:56,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:44:56,419 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:44:56,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:44:56,419 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 3 more)] === [2022-12-05 20:44:56,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:44:56,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1520772612, now seen corresponding path program 1 times [2022-12-05 20:44:56,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:44:56,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958672996] [2022-12-05 20:44:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:44:56,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:44:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:44:56,544 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-05 20:44:56,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:44:56,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958672996] [2022-12-05 20:44:56,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958672996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:44:56,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:44:56,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:44:56,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687144474] [2022-12-05 20:44:56,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:44:56,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:44:56,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:44:56,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:44:56,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:44:56,547 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2022-12-05 20:44:56,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 65 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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-05 20:44:56,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:44:56,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2022-12-05 20:44:56,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:45:00,519 INFO L130 PetriNetUnfolder]: 55209/76631 cut-off events. [2022-12-05 20:45:00,519 INFO L131 PetriNetUnfolder]: For 59229/59299 co-relation queries the response was YES. [2022-12-05 20:45:00,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218680 conditions, 76631 events. 55209/76631 cut-off events. For 59229/59299 co-relation queries the response was YES. Maximal size of possible extension queue 2031. Compared 484941 event pairs, 15476 based on Foata normal form. 688/76138 useless extension candidates. Maximal degree in co-relation 218662. Up to 45619 conditions per place. [2022-12-05 20:45:00,956 INFO L137 encePairwiseOnDemand]: 42/51 looper letters, 151 selfloop transitions, 15 changer transitions 0/174 dead transitions. [2022-12-05 20:45:00,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 174 transitions, 1084 flow [2022-12-05 20:45:00,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:45:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:45:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2022-12-05 20:45:00,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-05 20:45:00,958 INFO L175 Difference]: Start difference. First operand has 60 places, 65 transitions, 273 flow. Second operand 5 states and 160 transitions. [2022-12-05 20:45:00,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 174 transitions, 1084 flow [2022-12-05 20:45:00,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 174 transitions, 1042 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:45:00,983 INFO L231 Difference]: Finished difference. Result has 65 places, 74 transitions, 370 flow [2022-12-05 20:45:00,983 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=65, PETRI_TRANSITIONS=74} [2022-12-05 20:45:00,983 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2022-12-05 20:45:00,983 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 74 transitions, 370 flow [2022-12-05 20:45:00,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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-05 20:45:00,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:45:00,984 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:45:00,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:45:00,984 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 3 more)] === [2022-12-05 20:45:00,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:45:00,984 INFO L85 PathProgramCache]: Analyzing trace with hash 91679833, now seen corresponding path program 1 times [2022-12-05 20:45:00,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:45:00,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726319486] [2022-12-05 20:45:00,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:45:00,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:45:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:45:01,161 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-05 20:45:01,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:45:01,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726319486] [2022-12-05 20:45:01,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726319486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:45:01,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:45:01,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:45:01,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041597151] [2022-12-05 20:45:01,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:45:01,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:45:01,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:45:01,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:45:01,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:45:01,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2022-12-05 20:45:01,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 74 transitions, 370 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:45:01,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:45:01,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2022-12-05 20:45:01,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:45:01,759 INFO L130 PetriNetUnfolder]: 4565/7624 cut-off events. [2022-12-05 20:45:01,759 INFO L131 PetriNetUnfolder]: For 8363/9077 co-relation queries the response was YES. [2022-12-05 20:45:01,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20878 conditions, 7624 events. 4565/7624 cut-off events. For 8363/9077 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 48131 event pairs, 741 based on Foata normal form. 762/8116 useless extension candidates. Maximal degree in co-relation 20857. Up to 5517 conditions per place. [2022-12-05 20:45:01,790 INFO L137 encePairwiseOnDemand]: 43/51 looper letters, 51 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2022-12-05 20:45:01,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 78 transitions, 475 flow [2022-12-05 20:45:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:45:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:45:01,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-12-05 20:45:01,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2022-12-05 20:45:01,792 INFO L175 Difference]: Start difference. First operand has 65 places, 74 transitions, 370 flow. Second operand 4 states and 98 transitions. [2022-12-05 20:45:01,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 78 transitions, 475 flow [2022-12-05 20:45:01,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 78 transitions, 467 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 20:45:01,797 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 315 flow [2022-12-05 20:45:01,798 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=315, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2022-12-05 20:45:01,798 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2022-12-05 20:45:01,798 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 315 flow [2022-12-05 20:45:01,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:45:01,799 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:45:01,799 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:45:01,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:45:01,799 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:45:01,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:45:01,799 INFO L85 PathProgramCache]: Analyzing trace with hash 372112308, now seen corresponding path program 1 times [2022-12-05 20:45:01,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:45:01,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838690395] [2022-12-05 20:45:01,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:45:01,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:45:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:45:01,921 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-05 20:45:01,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:45:01,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838690395] [2022-12-05 20:45:01,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838690395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:45:01,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:45:01,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:45:01,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183704897] [2022-12-05 20:45:01,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:45:01,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:45:01,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:45:01,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:45:01,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:45:01,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2022-12-05 20:45:01,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 315 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 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-05 20:45:01,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:45:01,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2022-12-05 20:45:01,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:45:02,263 INFO L130 PetriNetUnfolder]: 3464/6361 cut-off events. [2022-12-05 20:45:02,263 INFO L131 PetriNetUnfolder]: For 6555/6556 co-relation queries the response was YES. [2022-12-05 20:45:02,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17127 conditions, 6361 events. 3464/6361 cut-off events. For 6555/6556 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 43073 event pairs, 1259 based on Foata normal form. 255/6604 useless extension candidates. Maximal degree in co-relation 17104. Up to 2643 conditions per place. [2022-12-05 20:45:02,291 INFO L137 encePairwiseOnDemand]: 42/51 looper letters, 56 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2022-12-05 20:45:02,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 89 transitions, 581 flow [2022-12-05 20:45:02,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:45:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:45:02,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-12-05 20:45:02,294 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2022-12-05 20:45:02,294 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 315 flow. Second operand 4 states and 104 transitions. [2022-12-05 20:45:02,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 89 transitions, 581 flow [2022-12-05 20:45:02,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 89 transitions, 558 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-05 20:45:02,305 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 333 flow [2022-12-05 20:45:02,305 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=333, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2022-12-05 20:45:02,305 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places. [2022-12-05 20:45:02,306 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 333 flow [2022-12-05 20:45:02,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 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-05 20:45:02,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:45:02,306 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] [2022-12-05 20:45:02,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:45:02,306 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:45:02,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:45:02,306 INFO L85 PathProgramCache]: Analyzing trace with hash -169743941, now seen corresponding path program 1 times [2022-12-05 20:45:02,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:45:02,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423920072] [2022-12-05 20:45:02,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:45:02,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:45:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:45:02,442 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-05 20:45:02,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:45:02,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423920072] [2022-12-05 20:45:02,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423920072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:45:02,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:45:02,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:45:02,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930724781] [2022-12-05 20:45:02,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:45:02,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 20:45:02,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:45:02,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 20:45:02,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-05 20:45:02,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2022-12-05 20:45:02,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 333 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 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-05 20:45:02,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:45:02,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2022-12-05 20:45:02,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:45:03,889 INFO L130 PetriNetUnfolder]: 11946/18298 cut-off events. [2022-12-05 20:45:03,890 INFO L131 PetriNetUnfolder]: For 18932/18933 co-relation queries the response was YES. [2022-12-05 20:45:03,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51744 conditions, 18298 events. 11946/18298 cut-off events. For 18932/18933 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 100396 event pairs, 2127 based on Foata normal form. 793/19087 useless extension candidates. Maximal degree in co-relation 51720. Up to 3911 conditions per place. [2022-12-05 20:45:03,988 INFO L137 encePairwiseOnDemand]: 37/51 looper letters, 310 selfloop transitions, 59 changer transitions 0/377 dead transitions. [2022-12-05 20:45:03,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 377 transitions, 2484 flow [2022-12-05 20:45:03,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-05 20:45:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-05 20:45:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 460 transitions. [2022-12-05 20:45:03,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47471620227038186 [2022-12-05 20:45:03,990 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 333 flow. Second operand 19 states and 460 transitions. [2022-12-05 20:45:03,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 377 transitions, 2484 flow [2022-12-05 20:45:04,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 377 transitions, 2394 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:45:04,013 INFO L231 Difference]: Finished difference. Result has 102 places, 114 transitions, 986 flow [2022-12-05 20:45:04,013 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=986, PETRI_PLACES=102, PETRI_TRANSITIONS=114} [2022-12-05 20:45:04,014 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 48 predicate places. [2022-12-05 20:45:04,014 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 114 transitions, 986 flow [2022-12-05 20:45:04,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 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-05 20:45:04,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:45:04,014 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] [2022-12-05 20:45:04,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:45:04,014 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 3 more)] === [2022-12-05 20:45:04,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:45:04,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1311892645, now seen corresponding path program 1 times [2022-12-05 20:45:04,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:45:04,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249642076] [2022-12-05 20:45:04,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:45:04,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:45:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:45:04,141 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-05 20:45:04,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:45:04,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249642076] [2022-12-05 20:45:04,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249642076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:45:04,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:45:04,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:45:04,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760732933] [2022-12-05 20:45:04,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:45:04,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:45:04,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:45:04,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:45:04,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:45:04,143 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2022-12-05 20:45:04,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 114 transitions, 986 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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-05 20:45:04,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:45:04,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2022-12-05 20:45:04,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:45:05,566 INFO L130 PetriNetUnfolder]: 11923/18229 cut-off events. [2022-12-05 20:45:05,566 INFO L131 PetriNetUnfolder]: For 75957/75958 co-relation queries the response was YES. [2022-12-05 20:45:05,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66746 conditions, 18229 events. 11923/18229 cut-off events. For 75957/75958 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 101415 event pairs, 5573 based on Foata normal form. 35/18263 useless extension candidates. Maximal degree in co-relation 66703. Up to 8470 conditions per place. [2022-12-05 20:45:05,712 INFO L137 encePairwiseOnDemand]: 43/51 looper letters, 156 selfloop transitions, 24 changer transitions 0/188 dead transitions. [2022-12-05 20:45:05,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 188 transitions, 1917 flow [2022-12-05 20:45:05,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:45:05,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:45:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-12-05 20:45:05,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5058823529411764 [2022-12-05 20:45:05,713 INFO L175 Difference]: Start difference. First operand has 102 places, 114 transitions, 986 flow. Second operand 5 states and 129 transitions. [2022-12-05 20:45:05,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 188 transitions, 1917 flow [2022-12-05 20:45:05,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 188 transitions, 1895 flow, removed 11 selfloop flow, removed 0 redundant places. [2022-12-05 20:45:05,895 INFO L231 Difference]: Finished difference. Result has 107 places, 114 transitions, 1043 flow [2022-12-05 20:45:05,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1043, PETRI_PLACES=107, PETRI_TRANSITIONS=114} [2022-12-05 20:45:05,897 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 53 predicate places. [2022-12-05 20:45:05,898 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 114 transitions, 1043 flow [2022-12-05 20:45:05,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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-05 20:45:05,898 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:45:05,898 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:45:05,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:45:05,898 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:45:05,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:45:05,904 INFO L85 PathProgramCache]: Analyzing trace with hash 297540973, now seen corresponding path program 1 times [2022-12-05 20:45:05,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:45:05,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536789608] [2022-12-05 20:45:05,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:45:05,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:45:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:45:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-05 20:45:06,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:45:06,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536789608] [2022-12-05 20:45:06,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536789608] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:45:06,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547016113] [2022-12-05 20:45:06,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:45:06,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:45:06,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:45:06,146 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-05 20:45:06,182 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-05 20:45:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:45:06,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-05 20:45:06,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:45:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-05 20:45:06,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:45:06,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-05 20:45:06,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547016113] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:45:06,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:45:06,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-12-05 20:45:06,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21549303] [2022-12-05 20:45:06,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:45:06,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 20:45:06,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:45:06,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 20:45:06,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-05 20:45:06,485 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2022-12-05 20:45:06,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 114 transitions, 1043 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 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-05 20:45:06,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:45:06,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2022-12-05 20:45:06,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:45:07,876 INFO L130 PetriNetUnfolder]: 8435/13198 cut-off events. [2022-12-05 20:45:07,877 INFO L131 PetriNetUnfolder]: For 64440/64441 co-relation queries the response was YES. [2022-12-05 20:45:07,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44694 conditions, 13198 events. 8435/13198 cut-off events. For 64440/64441 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 72379 event pairs, 1898 based on Foata normal form. 762/13959 useless extension candidates. Maximal degree in co-relation 44648. Up to 4164 conditions per place. [2022-12-05 20:45:07,944 INFO L137 encePairwiseOnDemand]: 37/51 looper letters, 0 selfloop transitions, 0 changer transitions 240/240 dead transitions. [2022-12-05 20:45:07,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 240 transitions, 2213 flow [2022-12-05 20:45:07,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 20:45:07,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 20:45:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 256 transitions. [2022-12-05 20:45:07,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3585434173669468 [2022-12-05 20:45:07,945 INFO L175 Difference]: Start difference. First operand has 107 places, 114 transitions, 1043 flow. Second operand 14 states and 256 transitions. [2022-12-05 20:45:07,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 240 transitions, 2213 flow [2022-12-05 20:45:08,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 240 transitions, 2098 flow, removed 20 selfloop flow, removed 6 redundant places. [2022-12-05 20:45:08,086 INFO L231 Difference]: Finished difference. Result has 110 places, 0 transitions, 0 flow [2022-12-05 20:45:08,087 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=0, PETRI_PLACES=110, PETRI_TRANSITIONS=0} [2022-12-05 20:45:08,087 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 56 predicate places. [2022-12-05 20:45:08,087 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 0 transitions, 0 flow [2022-12-05 20:45:08,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 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-05 20:45:08,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 20:45:08,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-05 20:45:08,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 20:45:08,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 20:45:08,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location disposeErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-05 20:45:08,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location disposeErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 20:45:08,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-05 20:45:08,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:45:08,296 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:45:08,299 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:45:08,299 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:45:08,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:45:08 BasicIcfg [2022-12-05 20:45:08,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:45:08,302 INFO L158 Benchmark]: Toolchain (without parser) took 23780.55ms. Allocated memory was 207.6MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 182.8MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-05 20:45:08,302 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 207.6MB. Free memory is still 183.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:45:08,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.24ms. Allocated memory is still 207.6MB. Free memory was 182.3MB in the beginning and 151.9MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-05 20:45:08,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.18ms. Allocated memory is still 207.6MB. Free memory was 151.9MB in the beginning and 149.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:45:08,303 INFO L158 Benchmark]: Boogie Preprocessor took 49.37ms. Allocated memory is still 207.6MB. Free memory was 149.3MB in the beginning and 146.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:45:08,303 INFO L158 Benchmark]: RCFGBuilder took 409.31ms. Allocated memory is still 207.6MB. Free memory was 146.7MB in the beginning and 124.7MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-05 20:45:08,303 INFO L158 Benchmark]: TraceAbstraction took 22838.72ms. Allocated memory was 207.6MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 123.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2022-12-05 20:45:08,304 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 207.6MB. Free memory is still 183.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 418.24ms. Allocated memory is still 207.6MB. Free memory was 182.3MB in the beginning and 151.9MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.18ms. Allocated memory is still 207.6MB. Free memory was 151.9MB in the beginning and 149.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.37ms. Allocated memory is still 207.6MB. Free memory was 149.3MB in the beginning and 146.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 409.31ms. Allocated memory is still 207.6MB. Free memory was 146.7MB in the beginning and 124.7MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 22838.72ms. Allocated memory was 207.6MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 123.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 147 PlacesBefore, 54 PlacesAfterwards, 149 TransitionsBefore, 51 TransitionsAfterwards, 8738 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 31 TrivialYvCompositions, 68 ConcurrentYvCompositions, 5 ChoiceCompositions, 111 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7058, independent: 6817, independent conditional: 6817, independent unconditional: 0, dependent: 241, dependent conditional: 241, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7058, independent: 6817, independent conditional: 0, independent unconditional: 6817, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7058, independent: 6817, independent conditional: 0, independent unconditional: 6817, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7058, independent: 6817, independent conditional: 0, independent unconditional: 6817, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5306, independent: 5229, independent conditional: 0, independent unconditional: 5229, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5306, independent: 5101, independent conditional: 0, independent unconditional: 5101, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 205, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 234, independent: 118, independent conditional: 0, independent unconditional: 118, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7058, independent: 1588, independent conditional: 0, independent unconditional: 1588, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 5306, unknown conditional: 0, unknown unconditional: 5306] , Statistics on independence cache: Total cache size (in pairs): 9083, Positive cache size: 9006, Positive conditional cache size: 0, Positive unconditional cache size: 9006, Negative cache size: 77, Negative conditional cache size: 0, Negative unconditional cache size: 77, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 208 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.7s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 705 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 705 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2170 IncrementalHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 26 mSDtfsCounter, 2170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1043occurred in iteration=8, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 1385 SizeOfPredicates, 5 NumberOfNonLiveVariables, 239 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 18/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-05 20:45:08,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...