/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 04:00:47,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 04:00:47,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 04:00:47,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 04:00:47,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 04:00:47,285 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 04:00:47,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 04:00:47,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 04:00:47,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 04:00:47,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 04:00:47,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 04:00:47,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 04:00:47,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 04:00:47,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 04:00:47,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 04:00:47,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 04:00:47,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 04:00:47,304 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 04:00:47,305 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 04:00:47,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 04:00:47,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 04:00:47,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 04:00:47,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 04:00:47,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 04:00:47,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 04:00:47,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 04:00:47,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 04:00:47,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 04:00:47,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 04:00:47,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 04:00:47,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 04:00:47,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 04:00:47,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 04:00:47,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 04:00:47,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 04:00:47,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 04:00:47,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 04:00:47,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 04:00:47,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 04:00:47,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 04:00:47,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 04:00:47,325 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 04:00:47,345 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 04:00:47,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 04:00:47,346 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 04:00:47,346 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 04:00:47,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 04:00:47,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 04:00:47,347 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 04:00:47,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 04:00:47,347 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 04:00:47,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 04:00:47,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 04:00:47,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 04:00:47,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 04:00:47,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 04:00:47,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 04:00:47,349 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 04:00:47,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 04:00:47,349 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 04:00:47,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 04:00:47,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 04:00:47,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 04:00:47,349 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 04:00:47,349 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 04:00:47,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 04:00:47,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 04:00:47,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 04:00:47,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 04:00:47,350 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 04:00:47,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 04:00:47,350 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 04:00:47,350 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 04:00:47,350 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 04:00:47,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 04:00:47,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 04:00:47,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 04:00:47,561 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 04:00:47,562 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 04:00:47,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-01-28 04:00:48,617 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 04:00:48,771 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 04:00:48,771 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-01-28 04:00:48,775 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19b5a0c4c/9be7cf0dda634f2daeb79b3273fda694/FLAG59f136277 [2023-01-28 04:00:48,791 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19b5a0c4c/9be7cf0dda634f2daeb79b3273fda694 [2023-01-28 04:00:48,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 04:00:48,794 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 04:00:48,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 04:00:48,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 04:00:48,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 04:00:48,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 04:00:48" (1/1) ... [2023-01-28 04:00:48,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d91b23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:00:48, skipping insertion in model container [2023-01-28 04:00:48,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 04:00:48" (1/1) ... [2023-01-28 04:00:48,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 04:00:48,818 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 04:00:48,949 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2023-01-28 04:00:48,954 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 04:00:48,961 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 04:00:48,989 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2023-01-28 04:00:48,990 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 04:00:48,996 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 04:00:48,997 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 04:00:49,001 INFO L208 MainTranslator]: Completed translation [2023-01-28 04:00:49,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:00:49 WrapperNode [2023-01-28 04:00:49,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 04:00:49,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 04:00:49,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 04:00:49,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 04:00:49,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:00:49" (1/1) ... [2023-01-28 04:00:49,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:00:49" (1/1) ... [2023-01-28 04:00:49,038 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2023-01-28 04:00:49,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 04:00:49,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 04:00:49,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 04:00:49,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 04:00:49,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:00:49" (1/1) ... [2023-01-28 04:00:49,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:00:49" (1/1) ... [2023-01-28 04:00:49,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:00:49" (1/1) ... [2023-01-28 04:00:49,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:00:49" (1/1) ... [2023-01-28 04:00:49,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:00:49" (1/1) ... [2023-01-28 04:00:49,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:00:49" (1/1) ... [2023-01-28 04:00:49,078 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:00:49" (1/1) ... [2023-01-28 04:00:49,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:00:49" (1/1) ... [2023-01-28 04:00:49,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 04:00:49,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 04:00:49,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 04:00:49,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 04:00:49,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:00:49" (1/1) ... [2023-01-28 04:00:49,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 04:00:49,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:00:49,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 04:00:49,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 04:00:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 04:00:49,149 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 04:00:49,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 04:00:49,149 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 04:00:49,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 04:00:49,150 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-28 04:00:49,150 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-28 04:00:49,152 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-01-28 04:00:49,152 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-01-28 04:00:49,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 04:00:49,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 04:00:49,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 04:00:49,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 04:00:49,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 04:00:49,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 04:00:49,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 04:00:49,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 04:00:49,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 04:00:49,154 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 04:00:49,244 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 04:00:49,245 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 04:00:49,436 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 04:00:49,505 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 04:00:49,505 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-28 04:00:49,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 04:00:49 BoogieIcfgContainer [2023-01-28 04:00:49,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 04:00:49,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 04:00:49,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 04:00:49,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 04:00:49,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 04:00:48" (1/3) ... [2023-01-28 04:00:49,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8d9929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 04:00:49, skipping insertion in model container [2023-01-28 04:00:49,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:00:49" (2/3) ... [2023-01-28 04:00:49,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8d9929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 04:00:49, skipping insertion in model container [2023-01-28 04:00:49,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 04:00:49" (3/3) ... [2023-01-28 04:00:49,521 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2023-01-28 04:00:49,532 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 04:00:49,532 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 04:00:49,532 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 04:00:49,624 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-01-28 04:00:49,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 120 transitions, 272 flow [2023-01-28 04:00:49,703 INFO L130 PetriNetUnfolder]: 9/116 cut-off events. [2023-01-28 04:00:49,703 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 04:00:49,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 116 events. 9/116 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-01-28 04:00:49,708 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 120 transitions, 272 flow [2023-01-28 04:00:49,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 104 transitions, 232 flow [2023-01-28 04:00:49,713 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 04:00:49,718 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 104 transitions, 232 flow [2023-01-28 04:00:49,726 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 104 transitions, 232 flow [2023-01-28 04:00:49,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 104 transitions, 232 flow [2023-01-28 04:00:49,746 INFO L130 PetriNetUnfolder]: 9/104 cut-off events. [2023-01-28 04:00:49,747 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 04:00:49,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 104 events. 9/104 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-01-28 04:00:49,749 INFO L119 LiptonReduction]: Number of co-enabled transitions 2520 [2023-01-28 04:00:51,908 INFO L134 LiptonReduction]: Checked pairs total: 2606 [2023-01-28 04:00:51,909 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-01-28 04:00:51,918 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 04:00:51,926 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;@26fd789f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 04:00:51,927 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 04:00:51,938 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2023-01-28 04:00:51,938 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 04:00:51,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:00:51,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:00:51,940 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:00:51,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:00:51,944 INFO L85 PathProgramCache]: Analyzing trace with hash -475984634, now seen corresponding path program 1 times [2023-01-28 04:00:51,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:00:51,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189277667] [2023-01-28 04:00:51,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:00:51,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:00:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:00:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:52,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:00:52,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189277667] [2023-01-28 04:00:52,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189277667] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:00:52,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:00:52,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 04:00:52,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728672533] [2023-01-28 04:00:52,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:00:52,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 04:00:52,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:00:52,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 04:00:52,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 04:00:52,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 202 [2023-01-28 04:00:52,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:52,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:00:52,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 202 [2023-01-28 04:00:52,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:00:52,457 INFO L130 PetriNetUnfolder]: 1537/1954 cut-off events. [2023-01-28 04:00:52,457 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2023-01-28 04:00:52,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4056 conditions, 1954 events. 1537/1954 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6355 event pairs, 141 based on Foata normal form. 1/1138 useless extension candidates. Maximal degree in co-relation 3091. Up to 1733 conditions per place. [2023-01-28 04:00:52,469 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 41 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2023-01-28 04:00:52,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 241 flow [2023-01-28 04:00:52,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 04:00:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 04:00:52,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-01-28 04:00:52,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5693069306930693 [2023-01-28 04:00:52,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-01-28 04:00:52,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-01-28 04:00:52,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:00:52,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-01-28 04:00:52,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:52,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:52,486 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:52,487 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 82 flow. Second operand 3 states and 345 transitions. [2023-01-28 04:00:52,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 241 flow [2023-01-28 04:00:52,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 51 transitions, 211 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-01-28 04:00:52,492 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 99 flow [2023-01-28 04:00:52,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2023-01-28 04:00:52,495 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2023-01-28 04:00:52,495 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 99 flow [2023-01-28 04:00:52,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:52,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:00:52,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:00:52,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 04:00:52,496 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:00:52,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:00:52,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2131273016, now seen corresponding path program 1 times [2023-01-28 04:00:52,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:00:52,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658803492] [2023-01-28 04:00:52,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:00:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:00:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:00:52,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:52,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:00:52,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658803492] [2023-01-28 04:00:52,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658803492] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:00:52,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:00:52,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:00:52,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109292147] [2023-01-28 04:00:52,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:00:52,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:00:52,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:00:52,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:00:52,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:00:52,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:00:52,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:52,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:00:52,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:00:52,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:00:52,847 INFO L130 PetriNetUnfolder]: 2645/3467 cut-off events. [2023-01-28 04:00:52,848 INFO L131 PetriNetUnfolder]: For 1092/1092 co-relation queries the response was YES. [2023-01-28 04:00:52,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8501 conditions, 3467 events. 2645/3467 cut-off events. For 1092/1092 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 15047 event pairs, 598 based on Foata normal form. 62/3529 useless extension candidates. Maximal degree in co-relation 2589. Up to 1576 conditions per place. [2023-01-28 04:00:52,863 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 86 selfloop transitions, 5 changer transitions 0/93 dead transitions. [2023-01-28 04:00:52,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 93 transitions, 461 flow [2023-01-28 04:00:52,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:00:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:00:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-01-28 04:00:52,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504950495049505 [2023-01-28 04:00:52,866 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-01-28 04:00:52,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-01-28 04:00:52,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:00:52,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-01-28 04:00:52,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:52,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:52,869 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:52,870 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 99 flow. Second operand 5 states and 510 transitions. [2023-01-28 04:00:52,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 93 transitions, 461 flow [2023-01-28 04:00:52,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 93 transitions, 448 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 04:00:52,872 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 129 flow [2023-01-28 04:00:52,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2023-01-28 04:00:52,872 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2023-01-28 04:00:52,872 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 129 flow [2023-01-28 04:00:52,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:52,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:00:52,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:00:52,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 04:00:52,873 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:00:52,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:00:52,874 INFO L85 PathProgramCache]: Analyzing trace with hash 134921043, now seen corresponding path program 1 times [2023-01-28 04:00:52,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:00:52,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538787260] [2023-01-28 04:00:52,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:00:52,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:00:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:00:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:52,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:00:52,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538787260] [2023-01-28 04:00:52,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538787260] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:00:52,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642780766] [2023-01-28 04:00:52,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:00:52,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:00:52,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:00:52,947 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:00:52,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 04:00:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:00:53,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 04:00:53,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:00:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:53,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:00:53,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:53,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642780766] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:00:53,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:00:53,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-01-28 04:00:53,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696678115] [2023-01-28 04:00:53,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:00:53,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 04:00:53,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:00:53,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 04:00:53,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-28 04:00:53,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:00:53,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 129 flow. Second operand has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:53,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:00:53,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:00:53,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:00:53,514 INFO L130 PetriNetUnfolder]: 3569/4785 cut-off events. [2023-01-28 04:00:53,514 INFO L131 PetriNetUnfolder]: For 3429/3842 co-relation queries the response was YES. [2023-01-28 04:00:53,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12910 conditions, 4785 events. 3569/4785 cut-off events. For 3429/3842 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 21796 event pairs, 436 based on Foata normal form. 523/5265 useless extension candidates. Maximal degree in co-relation 8290. Up to 1988 conditions per place. [2023-01-28 04:00:53,535 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 87 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2023-01-28 04:00:53,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 95 transitions, 523 flow [2023-01-28 04:00:53,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:00:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:00:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-01-28 04:00:53,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502970297029703 [2023-01-28 04:00:53,537 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-01-28 04:00:53,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-01-28 04:00:53,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:00:53,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-01-28 04:00:53,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:53,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:53,540 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:53,540 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 129 flow. Second operand 5 states and 508 transitions. [2023-01-28 04:00:53,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 95 transitions, 523 flow [2023-01-28 04:00:53,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 95 transitions, 504 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 04:00:53,545 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 159 flow [2023-01-28 04:00:53,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2023-01-28 04:00:53,547 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2023-01-28 04:00:53,547 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 159 flow [2023-01-28 04:00:53,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:53,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:00:53,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:00:53,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-28 04:00:53,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:00:53,753 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:00:53,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:00:53,753 INFO L85 PathProgramCache]: Analyzing trace with hash -950453983, now seen corresponding path program 1 times [2023-01-28 04:00:53,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:00:53,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476111675] [2023-01-28 04:00:53,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:00:53,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:00:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:00:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:53,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:00:53,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476111675] [2023-01-28 04:00:53,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476111675] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:00:53,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012615053] [2023-01-28 04:00:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:00:53,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:00:53,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:00:53,817 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:00:53,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 04:00:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:00:53,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 04:00:53,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:00:53,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:53,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:00:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:53,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012615053] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:00:53,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:00:53,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-01-28 04:00:53,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640043729] [2023-01-28 04:00:53,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:00:53,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 04:00:53,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:00:53,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 04:00:53,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-28 04:00:53,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:00:53,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 159 flow. Second operand has 8 states, 8 states have (on average 90.0) internal successors, (720), 8 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:53,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:00:53,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:00:53,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:00:54,344 INFO L130 PetriNetUnfolder]: 3913/5227 cut-off events. [2023-01-28 04:00:54,344 INFO L131 PetriNetUnfolder]: For 6362/6627 co-relation queries the response was YES. [2023-01-28 04:00:54,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16167 conditions, 5227 events. 3913/5227 cut-off events. For 6362/6627 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 23233 event pairs, 852 based on Foata normal form. 365/5557 useless extension candidates. Maximal degree in co-relation 10491. Up to 2296 conditions per place. [2023-01-28 04:00:54,372 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 90 selfloop transitions, 7 changer transitions 0/100 dead transitions. [2023-01-28 04:00:54,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 100 transitions, 596 flow [2023-01-28 04:00:54,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:00:54,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:00:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-01-28 04:00:54,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504950495049505 [2023-01-28 04:00:54,374 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-01-28 04:00:54,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-01-28 04:00:54,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:00:54,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-01-28 04:00:54,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:54,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:54,377 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:54,377 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 159 flow. Second operand 5 states and 510 transitions. [2023-01-28 04:00:54,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 100 transitions, 596 flow [2023-01-28 04:00:54,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 100 transitions, 587 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-01-28 04:00:54,386 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 212 flow [2023-01-28 04:00:54,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-01-28 04:00:54,386 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2023-01-28 04:00:54,387 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 212 flow [2023-01-28 04:00:54,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.0) internal successors, (720), 8 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:54,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:00:54,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:00:54,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 04:00:54,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-01-28 04:00:54,592 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:00:54,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:00:54,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1864400695, now seen corresponding path program 2 times [2023-01-28 04:00:54,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:00:54,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570312564] [2023-01-28 04:00:54,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:00:54,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:00:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:00:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:54,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:00:54,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570312564] [2023-01-28 04:00:54,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570312564] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:00:54,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:00:54,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:00:54,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196776998] [2023-01-28 04:00:54,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:00:54,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:00:54,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:00:54,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:00:54,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:00:54,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:00:54,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:54,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:00:54,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:00:54,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:00:55,072 INFO L130 PetriNetUnfolder]: 5551/7498 cut-off events. [2023-01-28 04:00:55,072 INFO L131 PetriNetUnfolder]: For 14127/14505 co-relation queries the response was YES. [2023-01-28 04:00:55,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24955 conditions, 7498 events. 5551/7498 cut-off events. For 14127/14505 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 36765 event pairs, 1429 based on Foata normal form. 411/7848 useless extension candidates. Maximal degree in co-relation 15467. Up to 3703 conditions per place. [2023-01-28 04:00:55,108 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 94 selfloop transitions, 11 changer transitions 0/108 dead transitions. [2023-01-28 04:00:55,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 108 transitions, 703 flow [2023-01-28 04:00:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:00:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:00:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-01-28 04:00:55,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502970297029703 [2023-01-28 04:00:55,110 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-01-28 04:00:55,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-01-28 04:00:55,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:00:55,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-01-28 04:00:55,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:55,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:55,114 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:55,114 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 212 flow. Second operand 5 states and 508 transitions. [2023-01-28 04:00:55,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 108 transitions, 703 flow [2023-01-28 04:00:55,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 689 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 04:00:55,131 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 269 flow [2023-01-28 04:00:55,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-01-28 04:00:55,132 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2023-01-28 04:00:55,134 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 269 flow [2023-01-28 04:00:55,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:55,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:00:55,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:00:55,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 04:00:55,134 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:00:55,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:00:55,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1282882796, now seen corresponding path program 2 times [2023-01-28 04:00:55,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:00:55,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131003654] [2023-01-28 04:00:55,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:00:55,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:00:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:00:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:55,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:00:55,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131003654] [2023-01-28 04:00:55,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131003654] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:00:55,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:00:55,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:00:55,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311737581] [2023-01-28 04:00:55,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:00:55,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:00:55,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:00:55,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:00:55,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:00:55,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:00:55,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 269 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:55,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:00:55,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:00:55,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:00:55,734 INFO L130 PetriNetUnfolder]: 5671/7868 cut-off events. [2023-01-28 04:00:55,734 INFO L131 PetriNetUnfolder]: For 25451/26949 co-relation queries the response was YES. [2023-01-28 04:00:55,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29008 conditions, 7868 events. 5671/7868 cut-off events. For 25451/26949 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 41212 event pairs, 1919 based on Foata normal form. 1586/9272 useless extension candidates. Maximal degree in co-relation 21702. Up to 4441 conditions per place. [2023-01-28 04:00:55,774 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 108 selfloop transitions, 6 changer transitions 0/120 dead transitions. [2023-01-28 04:00:55,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 120 transitions, 891 flow [2023-01-28 04:00:55,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:00:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:00:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-01-28 04:00:55,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502970297029703 [2023-01-28 04:00:55,776 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-01-28 04:00:55,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-01-28 04:00:55,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:00:55,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-01-28 04:00:55,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:55,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:55,778 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:55,778 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 269 flow. Second operand 5 states and 508 transitions. [2023-01-28 04:00:55,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 120 transitions, 891 flow [2023-01-28 04:00:55,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 120 transitions, 825 flow, removed 24 selfloop flow, removed 1 redundant places. [2023-01-28 04:00:55,794 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 291 flow [2023-01-28 04:00:55,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-01-28 04:00:55,795 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2023-01-28 04:00:55,795 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 291 flow [2023-01-28 04:00:55,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:55,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:00:55,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:00:55,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 04:00:55,796 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:00:55,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:00:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash -786111875, now seen corresponding path program 3 times [2023-01-28 04:00:55,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:00:55,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049292407] [2023-01-28 04:00:55,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:00:55,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:00:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:00:55,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:55,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:00:55,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049292407] [2023-01-28 04:00:55,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049292407] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:00:55,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951225030] [2023-01-28 04:00:55,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 04:00:55,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:00:55,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:00:55,857 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:00:55,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 04:00:55,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 04:00:55,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:00:55,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 04:00:55,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:00:55,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:55,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:00:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:56,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951225030] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:00:56,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:00:56,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 04:00:56,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410039555] [2023-01-28 04:00:56,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:00:56,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 04:00:56,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:00:56,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 04:00:56,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-01-28 04:00:56,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:00:56,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 291 flow. Second operand has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:56,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:00:56,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:00:56,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:00:56,763 INFO L130 PetriNetUnfolder]: 8386/11509 cut-off events. [2023-01-28 04:00:56,763 INFO L131 PetriNetUnfolder]: For 32012/33129 co-relation queries the response was YES. [2023-01-28 04:00:56,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43270 conditions, 11509 events. 8386/11509 cut-off events. For 32012/33129 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 62789 event pairs, 1876 based on Foata normal form. 1224/12563 useless extension candidates. Maximal degree in co-relation 28010. Up to 4315 conditions per place. [2023-01-28 04:00:56,916 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 152 selfloop transitions, 20 changer transitions 0/177 dead transitions. [2023-01-28 04:00:56,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 177 transitions, 1265 flow [2023-01-28 04:00:56,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 04:00:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 04:00:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 819 transitions. [2023-01-28 04:00:56,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068069306930693 [2023-01-28 04:00:56,919 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 819 transitions. [2023-01-28 04:00:56,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 819 transitions. [2023-01-28 04:00:56,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:00:56,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 819 transitions. [2023-01-28 04:00:56,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.375) internal successors, (819), 8 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:56,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:56,923 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:56,923 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 291 flow. Second operand 8 states and 819 transitions. [2023-01-28 04:00:56,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 177 transitions, 1265 flow [2023-01-28 04:00:56,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 177 transitions, 1223 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-01-28 04:00:56,955 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 466 flow [2023-01-28 04:00:56,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=466, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-01-28 04:00:56,955 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 32 predicate places. [2023-01-28 04:00:56,956 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 466 flow [2023-01-28 04:00:56,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:56,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:00:56,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:00:56,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 04:00:57,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:00:57,161 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:00:57,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:00:57,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1812859993, now seen corresponding path program 4 times [2023-01-28 04:00:57,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:00:57,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654420876] [2023-01-28 04:00:57,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:00:57,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:00:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:00:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:57,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:00:57,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654420876] [2023-01-28 04:00:57,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654420876] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:00:57,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:00:57,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:00:57,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694855855] [2023-01-28 04:00:57,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:00:57,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:00:57,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:00:57,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:00:57,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:00:57,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:00:57,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 466 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:57,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:00:57,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:00:57,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:00:58,220 INFO L130 PetriNetUnfolder]: 10374/14611 cut-off events. [2023-01-28 04:00:58,220 INFO L131 PetriNetUnfolder]: For 59618/61272 co-relation queries the response was YES. [2023-01-28 04:00:58,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57540 conditions, 14611 events. 10374/14611 cut-off events. For 59618/61272 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 85611 event pairs, 2227 based on Foata normal form. 1805/16079 useless extension candidates. Maximal degree in co-relation 50504. Up to 6194 conditions per place. [2023-01-28 04:00:58,291 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 137 selfloop transitions, 17 changer transitions 0/164 dead transitions. [2023-01-28 04:00:58,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 164 transitions, 1364 flow [2023-01-28 04:00:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 04:00:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 04:00:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2023-01-28 04:00:58,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5074257425742574 [2023-01-28 04:00:58,293 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 615 transitions. [2023-01-28 04:00:58,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 615 transitions. [2023-01-28 04:00:58,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:00:58,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 615 transitions. [2023-01-28 04:00:58,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:58,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:58,296 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:58,296 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 466 flow. Second operand 6 states and 615 transitions. [2023-01-28 04:00:58,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 164 transitions, 1364 flow [2023-01-28 04:00:58,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 164 transitions, 1326 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-01-28 04:00:58,365 INFO L231 Difference]: Finished difference. Result has 74 places, 72 transitions, 576 flow [2023-01-28 04:00:58,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=576, PETRI_PLACES=74, PETRI_TRANSITIONS=72} [2023-01-28 04:00:58,367 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2023-01-28 04:00:58,367 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 72 transitions, 576 flow [2023-01-28 04:00:58,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:58,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:00:58,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:00:58,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 04:00:58,368 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:00:58,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:00:58,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2097457269, now seen corresponding path program 5 times [2023-01-28 04:00:58,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:00:58,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598611014] [2023-01-28 04:00:58,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:00:58,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:00:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:00:58,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:58,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:00:58,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598611014] [2023-01-28 04:00:58,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598611014] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:00:58,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:00:58,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:00:58,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233303606] [2023-01-28 04:00:58,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:00:58,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:00:58,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:00:58,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:00:58,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:00:58,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:00:58,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 72 transitions, 576 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:58,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:00:58,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:00:58,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:00:59,459 INFO L130 PetriNetUnfolder]: 11079/15861 cut-off events. [2023-01-28 04:00:59,459 INFO L131 PetriNetUnfolder]: For 70431/72335 co-relation queries the response was YES. [2023-01-28 04:00:59,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64859 conditions, 15861 events. 11079/15861 cut-off events. For 70431/72335 co-relation queries the response was YES. Maximal size of possible extension queue 908. Compared 97497 event pairs, 2860 based on Foata normal form. 1937/17446 useless extension candidates. Maximal degree in co-relation 58035. Up to 6945 conditions per place. [2023-01-28 04:00:59,539 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 141 selfloop transitions, 11 changer transitions 0/162 dead transitions. [2023-01-28 04:00:59,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 162 transitions, 1461 flow [2023-01-28 04:00:59,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:00:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:00:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-01-28 04:00:59,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069306930693069 [2023-01-28 04:00:59,540 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-01-28 04:00:59,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-01-28 04:00:59,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:00:59,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-01-28 04:00:59,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:59,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:59,543 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:59,543 INFO L175 Difference]: Start difference. First operand has 74 places, 72 transitions, 576 flow. Second operand 5 states and 512 transitions. [2023-01-28 04:00:59,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 162 transitions, 1461 flow [2023-01-28 04:00:59,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 162 transitions, 1461 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 04:00:59,649 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 638 flow [2023-01-28 04:00:59,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=638, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2023-01-28 04:00:59,650 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2023-01-28 04:00:59,650 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 638 flow [2023-01-28 04:00:59,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:59,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:00:59,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:00:59,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 04:00:59,651 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:00:59,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:00:59,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1571815567, now seen corresponding path program 6 times [2023-01-28 04:00:59,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:00:59,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366857196] [2023-01-28 04:00:59,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:00:59,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:00:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:00:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:59,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:00:59,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366857196] [2023-01-28 04:00:59,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366857196] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:00:59,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197398338] [2023-01-28 04:00:59,693 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 04:00:59,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:00:59,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:00:59,694 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:00:59,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 04:00:59,765 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-28 04:00:59,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:00:59,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 04:00:59,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:00:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:59,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:00:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:00:59,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197398338] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:00:59,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:00:59,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 04:00:59,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983784232] [2023-01-28 04:00:59,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:00:59,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 04:00:59,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:00:59,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 04:00:59,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-01-28 04:00:59,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:00:59,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 638 flow. Second operand has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:00:59,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:00:59,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:00:59,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:01:00,212 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 698#(= thread3Thread1of1ForFork3_~i~2 0), Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:00,213 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-01-28 04:01:00,213 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 04:01:00,213 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-01-28 04:01:00,213 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-01-28 04:01:00,218 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), 73#$Ultimate##0true, Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 04:01:00,218 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-01-28 04:01:00,218 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-01-28 04:01:00,218 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 04:01:00,219 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-01-28 04:01:00,313 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:00,313 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,313 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,313 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 04:01:00,314 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 04:01:00,315 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), 73#$Ultimate##0true, Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0), 64#thread1EXITtrue]) [2023-01-28 04:01:00,315 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,315 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 04:01:00,315 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 04:01:00,315 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,323 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 698#(= thread3Thread1of1ForFork3_~i~2 0), 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:00,323 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,323 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 04:01:00,323 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,323 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 04:01:00,324 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-01-28 04:01:00,324 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,324 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 04:01:00,324 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,324 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 04:01:00,325 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 04:01:00,325 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,325 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,325 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 04:01:00,325 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-28 04:01:00,447 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 698#(= thread3Thread1of1ForFork3_~i~2 0), 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:00,447 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,447 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,447 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,447 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,448 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0), 64#thread1EXITtrue]) [2023-01-28 04:01:00,448 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,448 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,448 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,448 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,450 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), 73#$Ultimate##0true, Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 04:01:00,450 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,451 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,451 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,451 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,458 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, 10#L91-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 04:01:00,459 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,459 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,459 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,459 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,459 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-01-28 04:01:00,460 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,460 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,460 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,460 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,460 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 04:01:00,460 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,461 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,461 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,461 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,462 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 64#thread1EXITtrue]) [2023-01-28 04:01:00,462 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,462 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,462 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,462 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:00,717 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, 10#L91-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0), 64#thread1EXITtrue]) [2023-01-28 04:01:00,718 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,718 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,718 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,718 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,719 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0), 64#thread1EXITtrue]) [2023-01-28 04:01:00,719 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,719 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,719 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,719 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,721 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:00,721 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,721 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,721 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,721 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,723 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), 73#$Ultimate##0true, Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 04:01:00,723 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,723 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,723 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,723 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,732 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 04:01:00,732 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,732 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,732 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,732 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,733 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 64#thread1EXITtrue]) [2023-01-28 04:01:00,733 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,733 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,733 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,733 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:00,849 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0), 64#thread1EXITtrue]) [2023-01-28 04:01:00,850 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 04:01:00,850 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 04:01:00,850 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,850 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,851 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 04:01:00,851 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 04:01:00,851 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,851 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 04:01:00,851 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,853 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:00,853 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 04:01:00,853 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,853 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 04:01:00,853 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,861 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), 48#L92-2true, Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-01-28 04:01:00,861 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 04:01:00,861 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 04:01:00,861 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,861 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:00,944 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 04:01:00,945 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 04:01:00,945 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 04:01:00,945 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 04:01:00,945 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 04:01:00,946 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 04:01:00,946 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 04:01:00,946 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 04:01:00,946 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 04:01:00,946 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 04:01:00,952 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-01-28 04:01:00,952 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 04:01:00,952 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 04:01:00,952 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 04:01:00,952 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 04:01:01,018 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-28 04:01:01,019 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 04:01:01,019 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 04:01:01,019 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 04:01:01,019 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 04:01:01,162 INFO L130 PetriNetUnfolder]: 12225/17299 cut-off events. [2023-01-28 04:01:01,162 INFO L131 PetriNetUnfolder]: For 90018/91284 co-relation queries the response was YES. [2023-01-28 04:01:01,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74018 conditions, 17299 events. 12225/17299 cut-off events. For 90018/91284 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 103390 event pairs, 3391 based on Foata normal form. 1383/18291 useless extension candidates. Maximal degree in co-relation 60175. Up to 6942 conditions per place. [2023-01-28 04:01:01,381 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 119 selfloop transitions, 31 changer transitions 0/157 dead transitions. [2023-01-28 04:01:01,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 157 transitions, 1499 flow [2023-01-28 04:01:01,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:01:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:01:01,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-01-28 04:01:01,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099009900990099 [2023-01-28 04:01:01,384 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-01-28 04:01:01,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-01-28 04:01:01,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:01:01,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-01-28 04:01:01,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:01,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:01,390 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:01,390 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 638 flow. Second operand 5 states and 515 transitions. [2023-01-28 04:01:01,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 157 transitions, 1499 flow [2023-01-28 04:01:01,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 157 transitions, 1460 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 04:01:01,493 INFO L231 Difference]: Finished difference. Result has 85 places, 85 transitions, 875 flow [2023-01-28 04:01:01,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=875, PETRI_PLACES=85, PETRI_TRANSITIONS=85} [2023-01-28 04:01:01,493 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 47 predicate places. [2023-01-28 04:01:01,493 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 85 transitions, 875 flow [2023-01-28 04:01:01,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:01,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:01:01,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:01:01,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-01-28 04:01:01,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:01:01,698 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:01:01,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:01:01,698 INFO L85 PathProgramCache]: Analyzing trace with hash -212221697, now seen corresponding path program 1 times [2023-01-28 04:01:01,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:01:01,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601927430] [2023-01-28 04:01:01,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:01:01,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:01:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:01:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:01:01,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:01:01,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601927430] [2023-01-28 04:01:01,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601927430] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:01:01,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:01:01,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:01:01,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300374608] [2023-01-28 04:01:01,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:01:01,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:01:01,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:01:01,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:01:01,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:01:01,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:01:01,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 85 transitions, 875 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:01,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:01:01,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:01:01,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:01:03,224 INFO L130 PetriNetUnfolder]: 15528/22702 cut-off events. [2023-01-28 04:01:03,224 INFO L131 PetriNetUnfolder]: For 139262/141033 co-relation queries the response was YES. [2023-01-28 04:01:03,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102188 conditions, 22702 events. 15528/22702 cut-off events. For 139262/141033 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 147110 event pairs, 3078 based on Foata normal form. 1878/24441 useless extension candidates. Maximal degree in co-relation 85103. Up to 7619 conditions per place. [2023-01-28 04:01:03,393 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 161 selfloop transitions, 52 changer transitions 4/226 dead transitions. [2023-01-28 04:01:03,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 226 transitions, 2528 flow [2023-01-28 04:01:03,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 04:01:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 04:01:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 607 transitions. [2023-01-28 04:01:03,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008250825082509 [2023-01-28 04:01:03,395 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 607 transitions. [2023-01-28 04:01:03,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 607 transitions. [2023-01-28 04:01:03,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:01:03,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 607 transitions. [2023-01-28 04:01:03,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:03,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:03,398 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:03,398 INFO L175 Difference]: Start difference. First operand has 85 places, 85 transitions, 875 flow. Second operand 6 states and 607 transitions. [2023-01-28 04:01:03,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 226 transitions, 2528 flow [2023-01-28 04:01:03,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 226 transitions, 2444 flow, removed 22 selfloop flow, removed 1 redundant places. [2023-01-28 04:01:03,769 INFO L231 Difference]: Finished difference. Result has 93 places, 114 transitions, 1322 flow [2023-01-28 04:01:03,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1322, PETRI_PLACES=93, PETRI_TRANSITIONS=114} [2023-01-28 04:01:03,769 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 55 predicate places. [2023-01-28 04:01:03,770 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 114 transitions, 1322 flow [2023-01-28 04:01:03,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:03,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:01:03,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:01:03,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 04:01:03,771 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:01:03,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:01:03,772 INFO L85 PathProgramCache]: Analyzing trace with hash 550303848, now seen corresponding path program 3 times [2023-01-28 04:01:03,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:01:03,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272327117] [2023-01-28 04:01:03,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:01:03,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:01:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:01:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:01:03,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:01:03,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272327117] [2023-01-28 04:01:03,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272327117] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:01:03,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:01:03,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:01:03,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482105097] [2023-01-28 04:01:03,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:01:03,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:01:03,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:01:03,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:01:03,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:01:03,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:01:03,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 114 transitions, 1322 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:03,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:01:03,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:01:03,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:01:04,586 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:04,586 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2023-01-28 04:01:04,586 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-01-28 04:01:04,586 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-01-28 04:01:04,586 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-01-28 04:01:04,607 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:04,608 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-28 04:01:04,608 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:04,608 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:04,608 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 04:01:04,908 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 671#true, 698#(= thread3Thread1of1ForFork3_~i~2 0), Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:04,908 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2023-01-28 04:01:04,908 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-28 04:01:04,908 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-28 04:01:04,908 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-28 04:01:04,920 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:04,920 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 04:01:04,920 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:04,920 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:04,920 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:04,932 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:04,932 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2023-01-28 04:01:04,932 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-28 04:01:04,932 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-28 04:01:04,932 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-28 04:01:04,944 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:04,944 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 04:01:04,944 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:04,944 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:04,944 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 04:01:05,195 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 671#true, 698#(= thread3Thread1of1ForFork3_~i~2 0), 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:05,196 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is not cut-off event [2023-01-28 04:01:05,196 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-01-28 04:01:05,196 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-01-28 04:01:05,196 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-01-28 04:01:05,211 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:05,211 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-28 04:01:05,211 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:05,211 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:05,211 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:05,212 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:05,212 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-28 04:01:05,212 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:05,212 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:05,212 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-28 04:01:05,647 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:05,647 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 04:01:05,647 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 04:01:05,647 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 04:01:05,647 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 04:01:05,647 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:05,648 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 04:01:05,648 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 04:01:05,648 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 04:01:05,648 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 04:01:06,039 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-28 04:01:06,040 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 04:01:06,040 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 04:01:06,040 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 04:01:06,040 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 04:01:06,453 INFO L130 PetriNetUnfolder]: 20473/29469 cut-off events. [2023-01-28 04:01:06,454 INFO L131 PetriNetUnfolder]: For 236429/240162 co-relation queries the response was YES. [2023-01-28 04:01:06,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147314 conditions, 29469 events. 20473/29469 cut-off events. For 236429/240162 co-relation queries the response was YES. Maximal size of possible extension queue 1691. Compared 196382 event pairs, 4703 based on Foata normal form. 4146/33372 useless extension candidates. Maximal degree in co-relation 127841. Up to 12333 conditions per place. [2023-01-28 04:01:06,672 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 246 selfloop transitions, 47 changer transitions 1/303 dead transitions. [2023-01-28 04:01:06,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 303 transitions, 4000 flow [2023-01-28 04:01:06,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 04:01:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 04:01:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 601 transitions. [2023-01-28 04:01:06,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49587458745874585 [2023-01-28 04:01:06,677 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 601 transitions. [2023-01-28 04:01:06,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 601 transitions. [2023-01-28 04:01:06,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:01:06,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 601 transitions. [2023-01-28 04:01:06,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:06,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:06,680 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:06,681 INFO L175 Difference]: Start difference. First operand has 93 places, 114 transitions, 1322 flow. Second operand 6 states and 601 transitions. [2023-01-28 04:01:06,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 303 transitions, 4000 flow [2023-01-28 04:01:07,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 303 transitions, 3992 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-01-28 04:01:07,484 INFO L231 Difference]: Finished difference. Result has 102 places, 147 transitions, 1986 flow [2023-01-28 04:01:07,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1986, PETRI_PLACES=102, PETRI_TRANSITIONS=147} [2023-01-28 04:01:07,485 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 64 predicate places. [2023-01-28 04:01:07,485 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 147 transitions, 1986 flow [2023-01-28 04:01:07,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:07,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:01:07,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:01:07,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 04:01:07,485 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:01:07,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:01:07,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1556227291, now seen corresponding path program 2 times [2023-01-28 04:01:07,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:01:07,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281483645] [2023-01-28 04:01:07,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:01:07,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:01:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:01:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:01:07,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:01:07,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281483645] [2023-01-28 04:01:07,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281483645] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:01:07,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:01:07,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:01:07,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332984648] [2023-01-28 04:01:07,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:01:07,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:01:07,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:01:07,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:01:07,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:01:07,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:01:07,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 147 transitions, 1986 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:07,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:01:07,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:01:07,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:01:09,904 INFO L130 PetriNetUnfolder]: 19448/28253 cut-off events. [2023-01-28 04:01:09,905 INFO L131 PetriNetUnfolder]: For 276671/281367 co-relation queries the response was YES. [2023-01-28 04:01:10,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152388 conditions, 28253 events. 19448/28253 cut-off events. For 276671/281367 co-relation queries the response was YES. Maximal size of possible extension queue 1625. Compared 190687 event pairs, 4561 based on Foata normal form. 3786/31525 useless extension candidates. Maximal degree in co-relation 130869. Up to 13463 conditions per place. [2023-01-28 04:01:10,148 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 268 selfloop transitions, 41 changer transitions 11/337 dead transitions. [2023-01-28 04:01:10,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 337 transitions, 4694 flow [2023-01-28 04:01:10,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 04:01:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 04:01:10,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 613 transitions. [2023-01-28 04:01:10,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057755775577558 [2023-01-28 04:01:10,150 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 613 transitions. [2023-01-28 04:01:10,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 613 transitions. [2023-01-28 04:01:10,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:01:10,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 613 transitions. [2023-01-28 04:01:10,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:10,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:10,153 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:10,153 INFO L175 Difference]: Start difference. First operand has 102 places, 147 transitions, 1986 flow. Second operand 6 states and 613 transitions. [2023-01-28 04:01:10,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 337 transitions, 4694 flow [2023-01-28 04:01:11,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 337 transitions, 4592 flow, removed 51 selfloop flow, removed 0 redundant places. [2023-01-28 04:01:11,273 INFO L231 Difference]: Finished difference. Result has 110 places, 172 transitions, 2600 flow [2023-01-28 04:01:11,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1964, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2600, PETRI_PLACES=110, PETRI_TRANSITIONS=172} [2023-01-28 04:01:11,274 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 72 predicate places. [2023-01-28 04:01:11,274 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 172 transitions, 2600 flow [2023-01-28 04:01:11,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:11,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:01:11,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:01:11,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 04:01:11,275 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:01:11,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:01:11,275 INFO L85 PathProgramCache]: Analyzing trace with hash 371724395, now seen corresponding path program 3 times [2023-01-28 04:01:11,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:01:11,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329381635] [2023-01-28 04:01:11,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:01:11,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:01:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:01:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:01:11,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:01:11,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329381635] [2023-01-28 04:01:11,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329381635] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:01:11,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:01:11,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:01:11,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991829962] [2023-01-28 04:01:11,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:01:11,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:01:11,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:01:11,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:01:11,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:01:11,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:01:11,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 172 transitions, 2600 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:11,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:01:11,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:01:11,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:01:14,770 INFO L130 PetriNetUnfolder]: 23525/35070 cut-off events. [2023-01-28 04:01:14,770 INFO L131 PetriNetUnfolder]: For 340488/342579 co-relation queries the response was YES. [2023-01-28 04:01:14,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192742 conditions, 35070 events. 23525/35070 cut-off events. For 340488/342579 co-relation queries the response was YES. Maximal size of possible extension queue 1887. Compared 250497 event pairs, 5250 based on Foata normal form. 2789/37354 useless extension candidates. Maximal degree in co-relation 164072. Up to 14042 conditions per place. [2023-01-28 04:01:15,104 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 283 selfloop transitions, 48 changer transitions 22/390 dead transitions. [2023-01-28 04:01:15,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 390 transitions, 5724 flow [2023-01-28 04:01:15,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 04:01:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 04:01:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2023-01-28 04:01:15,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041254125412541 [2023-01-28 04:01:15,106 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 611 transitions. [2023-01-28 04:01:15,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 611 transitions. [2023-01-28 04:01:15,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:01:15,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 611 transitions. [2023-01-28 04:01:15,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:15,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:15,109 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:15,109 INFO L175 Difference]: Start difference. First operand has 110 places, 172 transitions, 2600 flow. Second operand 6 states and 611 transitions. [2023-01-28 04:01:15,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 390 transitions, 5724 flow [2023-01-28 04:01:17,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 390 transitions, 5605 flow, removed 42 selfloop flow, removed 2 redundant places. [2023-01-28 04:01:17,099 INFO L231 Difference]: Finished difference. Result has 117 places, 211 transitions, 3311 flow [2023-01-28 04:01:17,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=2529, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3311, PETRI_PLACES=117, PETRI_TRANSITIONS=211} [2023-01-28 04:01:17,099 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 79 predicate places. [2023-01-28 04:01:17,099 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 211 transitions, 3311 flow [2023-01-28 04:01:17,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:17,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:01:17,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:01:17,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 04:01:17,105 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:01:17,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:01:17,105 INFO L85 PathProgramCache]: Analyzing trace with hash 153042763, now seen corresponding path program 4 times [2023-01-28 04:01:17,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:01:17,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785214378] [2023-01-28 04:01:17,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:01:17,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:01:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:01:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:01:17,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:01:17,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785214378] [2023-01-28 04:01:17,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785214378] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:01:17,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:01:17,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:01:17,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941585492] [2023-01-28 04:01:17,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:01:17,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:01:17,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:01:17,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:01:17,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:01:17,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:01:17,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 211 transitions, 3311 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:17,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:01:17,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:01:17,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:01:21,390 INFO L130 PetriNetUnfolder]: 26685/40089 cut-off events. [2023-01-28 04:01:21,390 INFO L131 PetriNetUnfolder]: For 493723/496874 co-relation queries the response was YES. [2023-01-28 04:01:21,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232960 conditions, 40089 events. 26685/40089 cut-off events. For 493723/496874 co-relation queries the response was YES. Maximal size of possible extension queue 2213. Compared 292880 event pairs, 6666 based on Foata normal form. 3099/42875 useless extension candidates. Maximal degree in co-relation 198842. Up to 17529 conditions per place. [2023-01-28 04:01:21,816 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 337 selfloop transitions, 48 changer transitions 20/442 dead transitions. [2023-01-28 04:01:21,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 442 transitions, 7325 flow [2023-01-28 04:01:21,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:01:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:01:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-01-28 04:01:21,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498019801980198 [2023-01-28 04:01:21,818 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-01-28 04:01:21,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-01-28 04:01:21,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:01:21,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-01-28 04:01:21,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:21,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:21,820 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:21,820 INFO L175 Difference]: Start difference. First operand has 117 places, 211 transitions, 3311 flow. Second operand 5 states and 503 transitions. [2023-01-28 04:01:21,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 442 transitions, 7325 flow [2023-01-28 04:01:25,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 442 transitions, 7257 flow, removed 34 selfloop flow, removed 0 redundant places. [2023-01-28 04:01:25,740 INFO L231 Difference]: Finished difference. Result has 124 places, 240 transitions, 3899 flow [2023-01-28 04:01:25,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=3273, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3899, PETRI_PLACES=124, PETRI_TRANSITIONS=240} [2023-01-28 04:01:25,742 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 86 predicate places. [2023-01-28 04:01:25,742 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 240 transitions, 3899 flow [2023-01-28 04:01:25,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:25,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:01:25,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:01:25,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 04:01:25,742 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:01:25,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:01:25,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1733936133, now seen corresponding path program 5 times [2023-01-28 04:01:25,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:01:25,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806710847] [2023-01-28 04:01:25,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:01:25,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:01:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:01:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:01:25,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:01:25,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806710847] [2023-01-28 04:01:25,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806710847] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:01:25,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:01:25,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:01:25,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247295391] [2023-01-28 04:01:25,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:01:25,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:01:25,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:01:25,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:01:25,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:01:25,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:01:25,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 240 transitions, 3899 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:25,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:01:25,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:01:25,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:01:30,231 INFO L130 PetriNetUnfolder]: 26719/40118 cut-off events. [2023-01-28 04:01:30,231 INFO L131 PetriNetUnfolder]: For 567927/573002 co-relation queries the response was YES. [2023-01-28 04:01:30,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251915 conditions, 40118 events. 26719/40118 cut-off events. For 567927/573002 co-relation queries the response was YES. Maximal size of possible extension queue 2456. Compared 296876 event pairs, 7549 based on Foata normal form. 4098/43649 useless extension candidates. Maximal degree in co-relation 214000. Up to 15734 conditions per place. [2023-01-28 04:01:30,629 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 257 selfloop transitions, 75 changer transitions 8/362 dead transitions. [2023-01-28 04:01:30,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 362 transitions, 5973 flow [2023-01-28 04:01:30,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:01:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:01:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-01-28 04:01:30,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099009900990099 [2023-01-28 04:01:30,632 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-01-28 04:01:30,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-01-28 04:01:30,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:01:30,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-01-28 04:01:30,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:30,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:30,635 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:30,635 INFO L175 Difference]: Start difference. First operand has 124 places, 240 transitions, 3899 flow. Second operand 5 states and 515 transitions. [2023-01-28 04:01:30,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 362 transitions, 5973 flow [2023-01-28 04:01:33,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 362 transitions, 5904 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-01-28 04:01:33,799 INFO L231 Difference]: Finished difference. Result has 128 places, 246 transitions, 4156 flow [2023-01-28 04:01:33,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=3859, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4156, PETRI_PLACES=128, PETRI_TRANSITIONS=246} [2023-01-28 04:01:33,799 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 90 predicate places. [2023-01-28 04:01:33,799 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 246 transitions, 4156 flow [2023-01-28 04:01:33,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:33,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:01:33,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:01:33,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 04:01:33,800 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:01:33,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:01:33,800 INFO L85 PathProgramCache]: Analyzing trace with hash 724866881, now seen corresponding path program 2 times [2023-01-28 04:01:33,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:01:33,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518921674] [2023-01-28 04:01:33,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:01:33,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:01:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:01:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:01:33,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:01:33,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518921674] [2023-01-28 04:01:33,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518921674] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:01:33,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965300288] [2023-01-28 04:01:33,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 04:01:33,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:01:33,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:01:33,840 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:01:33,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 04:01:33,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 04:01:33,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:01:33,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 04:01:33,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:01:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:01:33,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:01:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:01:33,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965300288] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:01:33,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:01:33,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-01-28 04:01:33,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959501769] [2023-01-28 04:01:33,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:01:33,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 04:01:33,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:01:33,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 04:01:33,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-28 04:01:33,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:01:33,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 246 transitions, 4156 flow. Second operand has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:33,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:01:33,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:01:33,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:01:38,576 INFO L130 PetriNetUnfolder]: 28102/42070 cut-off events. [2023-01-28 04:01:38,576 INFO L131 PetriNetUnfolder]: For 584259/587926 co-relation queries the response was YES. [2023-01-28 04:01:39,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266787 conditions, 42070 events. 28102/42070 cut-off events. For 584259/587926 co-relation queries the response was YES. Maximal size of possible extension queue 2565. Compared 313697 event pairs, 4899 based on Foata normal form. 2906/44097 useless extension candidates. Maximal degree in co-relation 229533. Up to 26800 conditions per place. [2023-01-28 04:01:39,190 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 282 selfloop transitions, 74 changer transitions 17/390 dead transitions. [2023-01-28 04:01:39,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 390 transitions, 6870 flow [2023-01-28 04:01:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:01:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:01:39,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 502 transitions. [2023-01-28 04:01:39,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.497029702970297 [2023-01-28 04:01:39,192 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 502 transitions. [2023-01-28 04:01:39,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 502 transitions. [2023-01-28 04:01:39,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:01:39,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 502 transitions. [2023-01-28 04:01:39,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:39,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:39,199 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:39,199 INFO L175 Difference]: Start difference. First operand has 128 places, 246 transitions, 4156 flow. Second operand 5 states and 502 transitions. [2023-01-28 04:01:39,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 390 transitions, 6870 flow [2023-01-28 04:01:43,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 390 transitions, 6701 flow, removed 26 selfloop flow, removed 2 redundant places. [2023-01-28 04:01:43,712 INFO L231 Difference]: Finished difference. Result has 132 places, 257 transitions, 4529 flow [2023-01-28 04:01:43,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=4043, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4529, PETRI_PLACES=132, PETRI_TRANSITIONS=257} [2023-01-28 04:01:43,713 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 94 predicate places. [2023-01-28 04:01:43,713 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 257 transitions, 4529 flow [2023-01-28 04:01:43,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:43,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:01:43,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:01:43,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-01-28 04:01:43,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-28 04:01:43,918 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:01:43,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:01:43,918 INFO L85 PathProgramCache]: Analyzing trace with hash 661454854, now seen corresponding path program 4 times [2023-01-28 04:01:43,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:01:43,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627443946] [2023-01-28 04:01:43,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:01:43,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:01:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:01:43,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:01:43,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:01:43,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627443946] [2023-01-28 04:01:43,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627443946] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:01:43,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:01:43,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:01:43,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843567902] [2023-01-28 04:01:43,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:01:43,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:01:43,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:01:43,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:01:43,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:01:43,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:01:43,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 257 transitions, 4529 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:43,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:01:43,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:01:43,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:01:48,623 INFO L130 PetriNetUnfolder]: 27022/40814 cut-off events. [2023-01-28 04:01:48,623 INFO L131 PetriNetUnfolder]: For 648539/653209 co-relation queries the response was YES. [2023-01-28 04:01:48,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260199 conditions, 40814 events. 27022/40814 cut-off events. For 648539/653209 co-relation queries the response was YES. Maximal size of possible extension queue 2518. Compared 306608 event pairs, 7155 based on Foata normal form. 4021/44368 useless extension candidates. Maximal degree in co-relation 221887. Up to 15876 conditions per place. [2023-01-28 04:01:49,077 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 273 selfloop transitions, 120 changer transitions 31/441 dead transitions. [2023-01-28 04:01:49,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 441 transitions, 8068 flow [2023-01-28 04:01:49,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:01:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:01:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 513 transitions. [2023-01-28 04:01:49,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079207920792079 [2023-01-28 04:01:49,079 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 513 transitions. [2023-01-28 04:01:49,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 513 transitions. [2023-01-28 04:01:49,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:01:49,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 513 transitions. [2023-01-28 04:01:49,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:49,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:49,081 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:49,081 INFO L175 Difference]: Start difference. First operand has 132 places, 257 transitions, 4529 flow. Second operand 5 states and 513 transitions. [2023-01-28 04:01:49,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 441 transitions, 8068 flow [2023-01-28 04:01:53,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 441 transitions, 7929 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-01-28 04:01:53,379 INFO L231 Difference]: Finished difference. Result has 137 places, 295 transitions, 5544 flow [2023-01-28 04:01:53,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=4420, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5544, PETRI_PLACES=137, PETRI_TRANSITIONS=295} [2023-01-28 04:01:53,379 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 99 predicate places. [2023-01-28 04:01:53,379 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 295 transitions, 5544 flow [2023-01-28 04:01:53,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:53,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:01:53,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:01:53,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-28 04:01:53,380 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:01:53,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:01:53,380 INFO L85 PathProgramCache]: Analyzing trace with hash -593576133, now seen corresponding path program 3 times [2023-01-28 04:01:53,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:01:53,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962020894] [2023-01-28 04:01:53,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:01:53,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:01:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:01:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:01:53,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:01:53,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962020894] [2023-01-28 04:01:53,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962020894] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:01:53,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:01:53,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:01:53,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887130749] [2023-01-28 04:01:53,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:01:53,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:01:53,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:01:53,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:01:53,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:01:53,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:01:53,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 295 transitions, 5544 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:53,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:01:53,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:01:53,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:01:58,821 INFO L130 PetriNetUnfolder]: 29877/44914 cut-off events. [2023-01-28 04:01:58,821 INFO L131 PetriNetUnfolder]: For 718125/722944 co-relation queries the response was YES. [2023-01-28 04:01:59,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295671 conditions, 44914 events. 29877/44914 cut-off events. For 718125/722944 co-relation queries the response was YES. Maximal size of possible extension queue 2839. Compared 340177 event pairs, 7513 based on Foata normal form. 3729/47583 useless extension candidates. Maximal degree in co-relation 256515. Up to 16539 conditions per place. [2023-01-28 04:01:59,268 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 294 selfloop transitions, 121 changer transitions 8/445 dead transitions. [2023-01-28 04:01:59,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 445 transitions, 8306 flow [2023-01-28 04:01:59,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:01:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:01:59,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2023-01-28 04:01:59,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138613861386139 [2023-01-28 04:01:59,270 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 519 transitions. [2023-01-28 04:01:59,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 519 transitions. [2023-01-28 04:01:59,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:01:59,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 519 transitions. [2023-01-28 04:01:59,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:59,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:59,272 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:01:59,272 INFO L175 Difference]: Start difference. First operand has 137 places, 295 transitions, 5544 flow. Second operand 5 states and 519 transitions. [2023-01-28 04:01:59,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 445 transitions, 8306 flow [2023-01-28 04:02:04,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 445 transitions, 8082 flow, removed 58 selfloop flow, removed 1 redundant places. [2023-01-28 04:02:04,687 INFO L231 Difference]: Finished difference. Result has 141 places, 307 transitions, 5912 flow [2023-01-28 04:02:04,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=5356, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5912, PETRI_PLACES=141, PETRI_TRANSITIONS=307} [2023-01-28 04:02:04,687 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 103 predicate places. [2023-01-28 04:02:04,687 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 307 transitions, 5912 flow [2023-01-28 04:02:04,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:04,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:02:04,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:02:04,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-01-28 04:02:04,688 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:02:04,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:02:04,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1280457636, now seen corresponding path program 5 times [2023-01-28 04:02:04,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:02:04,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66889865] [2023-01-28 04:02:04,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:02:04,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:02:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:02:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:02:04,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:02:04,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66889865] [2023-01-28 04:02:04,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66889865] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:02:04,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535621294] [2023-01-28 04:02:04,734 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 04:02:04,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:02:04,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:02:04,735 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:02:04,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-28 04:02:04,811 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 04:02:04,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:02:04,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 04:02:04,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:02:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:02:04,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:02:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:02:04,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535621294] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:02:04,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:02:04,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-01-28 04:02:04,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637482962] [2023-01-28 04:02:04,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:02:04,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 04:02:04,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:02:04,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 04:02:04,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-28 04:02:04,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:02:04,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 307 transitions, 5912 flow. Second operand has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:04,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:02:04,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:02:04,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:02:10,625 INFO L130 PetriNetUnfolder]: 30927/46403 cut-off events. [2023-01-28 04:02:10,625 INFO L131 PetriNetUnfolder]: For 782816/787508 co-relation queries the response was YES. [2023-01-28 04:02:10,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306594 conditions, 46403 events. 30927/46403 cut-off events. For 782816/787508 co-relation queries the response was YES. Maximal size of possible extension queue 2740. Compared 347457 event pairs, 6549 based on Foata normal form. 4025/50056 useless extension candidates. Maximal degree in co-relation 265828. Up to 27244 conditions per place. [2023-01-28 04:02:11,083 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 399 selfloop transitions, 64 changer transitions 22/502 dead transitions. [2023-01-28 04:02:11,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 502 transitions, 10330 flow [2023-01-28 04:02:11,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:02:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:02:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 498 transitions. [2023-01-28 04:02:11,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49306930693069306 [2023-01-28 04:02:11,085 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 498 transitions. [2023-01-28 04:02:11,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 498 transitions. [2023-01-28 04:02:11,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:02:11,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 498 transitions. [2023-01-28 04:02:11,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:11,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:11,087 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:11,087 INFO L175 Difference]: Start difference. First operand has 141 places, 307 transitions, 5912 flow. Second operand 5 states and 498 transitions. [2023-01-28 04:02:11,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 502 transitions, 10330 flow [2023-01-28 04:02:17,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 502 transitions, 9931 flow, removed 45 selfloop flow, removed 2 redundant places. [2023-01-28 04:02:17,846 INFO L231 Difference]: Finished difference. Result has 145 places, 331 transitions, 6445 flow [2023-01-28 04:02:17,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=5646, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6445, PETRI_PLACES=145, PETRI_TRANSITIONS=331} [2023-01-28 04:02:17,848 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 107 predicate places. [2023-01-28 04:02:17,848 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 331 transitions, 6445 flow [2023-01-28 04:02:17,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:17,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:02:17,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:02:17,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-01-28 04:02:18,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:02:18,057 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:02:18,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:02:18,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1098078909, now seen corresponding path program 4 times [2023-01-28 04:02:18,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:02:18,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939730805] [2023-01-28 04:02:18,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:02:18,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:02:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:02:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:02:18,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:02:18,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939730805] [2023-01-28 04:02:18,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939730805] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:02:18,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:02:18,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:02:18,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992821189] [2023-01-28 04:02:18,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:02:18,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:02:18,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:02:18,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:02:18,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:02:18,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:02:18,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 331 transitions, 6445 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:18,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:02:18,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:02:18,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:02:24,240 INFO L130 PetriNetUnfolder]: 32086/48461 cut-off events. [2023-01-28 04:02:24,240 INFO L131 PetriNetUnfolder]: For 856277/861744 co-relation queries the response was YES. [2023-01-28 04:02:24,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323315 conditions, 48461 events. 32086/48461 cut-off events. For 856277/861744 co-relation queries the response was YES. Maximal size of possible extension queue 3140. Compared 373632 event pairs, 7386 based on Foata normal form. 4189/51590 useless extension candidates. Maximal degree in co-relation 283420. Up to 18163 conditions per place. [2023-01-28 04:02:24,763 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 249 selfloop transitions, 147 changer transitions 23/441 dead transitions. [2023-01-28 04:02:24,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 441 transitions, 8570 flow [2023-01-28 04:02:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:02:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:02:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-01-28 04:02:24,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069306930693069 [2023-01-28 04:02:24,788 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-01-28 04:02:24,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-01-28 04:02:24,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:02:24,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-01-28 04:02:24,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:24,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:24,790 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:24,790 INFO L175 Difference]: Start difference. First operand has 145 places, 331 transitions, 6445 flow. Second operand 5 states and 512 transitions. [2023-01-28 04:02:24,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 441 transitions, 8570 flow [2023-01-28 04:02:30,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 441 transitions, 8442 flow, removed 25 selfloop flow, removed 3 redundant places. [2023-01-28 04:02:30,042 INFO L231 Difference]: Finished difference. Result has 148 places, 334 transitions, 6718 flow [2023-01-28 04:02:30,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=6328, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6718, PETRI_PLACES=148, PETRI_TRANSITIONS=334} [2023-01-28 04:02:30,042 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 110 predicate places. [2023-01-28 04:02:30,042 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 334 transitions, 6718 flow [2023-01-28 04:02:30,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:30,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:02:30,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:02:30,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-01-28 04:02:30,043 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:02:30,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:02:30,043 INFO L85 PathProgramCache]: Analyzing trace with hash -75263484, now seen corresponding path program 6 times [2023-01-28 04:02:30,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:02:30,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629081154] [2023-01-28 04:02:30,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:02:30,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:02:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:02:30,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:02:30,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:02:30,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629081154] [2023-01-28 04:02:30,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629081154] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:02:30,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:02:30,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:02:30,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357119740] [2023-01-28 04:02:30,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:02:30,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:02:30,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:02:30,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:02:30,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:02:30,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:02:30,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 334 transitions, 6718 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:30,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:02:30,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:02:30,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:02:36,209 INFO L130 PetriNetUnfolder]: 31442/47939 cut-off events. [2023-01-28 04:02:36,209 INFO L131 PetriNetUnfolder]: For 864160/866898 co-relation queries the response was YES. [2023-01-28 04:02:36,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318852 conditions, 47939 events. 31442/47939 cut-off events. For 864160/866898 co-relation queries the response was YES. Maximal size of possible extension queue 2788. Compared 371200 event pairs, 6897 based on Foata normal form. 2516/50112 useless extension candidates. Maximal degree in co-relation 283808. Up to 18393 conditions per place. [2023-01-28 04:02:36,743 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 403 selfloop transitions, 104 changer transitions 73/617 dead transitions. [2023-01-28 04:02:36,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 617 transitions, 12476 flow [2023-01-28 04:02:36,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 04:02:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 04:02:36,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2023-01-28 04:02:36,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4991749174917492 [2023-01-28 04:02:36,750 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 605 transitions. [2023-01-28 04:02:36,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 605 transitions. [2023-01-28 04:02:36,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:02:36,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 605 transitions. [2023-01-28 04:02:36,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:36,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:36,752 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:36,752 INFO L175 Difference]: Start difference. First operand has 148 places, 334 transitions, 6718 flow. Second operand 6 states and 605 transitions. [2023-01-28 04:02:36,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 617 transitions, 12476 flow [2023-01-28 04:02:42,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 617 transitions, 12120 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-28 04:02:42,674 INFO L231 Difference]: Finished difference. Result has 155 places, 390 transitions, 7945 flow [2023-01-28 04:02:42,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=6438, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7945, PETRI_PLACES=155, PETRI_TRANSITIONS=390} [2023-01-28 04:02:42,675 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 117 predicate places. [2023-01-28 04:02:42,675 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 390 transitions, 7945 flow [2023-01-28 04:02:42,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:42,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:02:42,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:02:42,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-01-28 04:02:42,675 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:02:42,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:02:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1821063516, now seen corresponding path program 7 times [2023-01-28 04:02:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:02:42,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524226605] [2023-01-28 04:02:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:02:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:02:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:02:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:02:42,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:02:42,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524226605] [2023-01-28 04:02:42,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524226605] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:02:42,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:02:42,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:02:42,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589561565] [2023-01-28 04:02:42,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:02:42,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:02:42,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:02:42,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:02:42,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:02:42,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:02:42,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 390 transitions, 7945 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:42,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:02:42,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:02:42,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:02:49,065 INFO L130 PetriNetUnfolder]: 30968/46642 cut-off events. [2023-01-28 04:02:49,065 INFO L131 PetriNetUnfolder]: For 926450/929539 co-relation queries the response was YES. [2023-01-28 04:02:49,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331385 conditions, 46642 events. 30968/46642 cut-off events. For 926450/929539 co-relation queries the response was YES. Maximal size of possible extension queue 2795. Compared 349861 event pairs, 9053 based on Foata normal form. 2471/48755 useless extension candidates. Maximal degree in co-relation 295279. Up to 16874 conditions per place. [2023-01-28 04:02:49,577 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 306 selfloop transitions, 169 changer transitions 22/530 dead transitions. [2023-01-28 04:02:49,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 530 transitions, 11154 flow [2023-01-28 04:02:49,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:02:49,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:02:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-01-28 04:02:49,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501980198019802 [2023-01-28 04:02:49,578 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-01-28 04:02:49,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-01-28 04:02:49,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:02:49,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-01-28 04:02:49,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:49,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:49,580 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:49,580 INFO L175 Difference]: Start difference. First operand has 155 places, 390 transitions, 7945 flow. Second operand 5 states and 507 transitions. [2023-01-28 04:02:49,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 530 transitions, 11154 flow [2023-01-28 04:02:56,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 530 transitions, 11078 flow, removed 38 selfloop flow, removed 0 redundant places. [2023-01-28 04:02:56,169 INFO L231 Difference]: Finished difference. Result has 160 places, 409 transitions, 8720 flow [2023-01-28 04:02:56,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=7877, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8720, PETRI_PLACES=160, PETRI_TRANSITIONS=409} [2023-01-28 04:02:56,170 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 122 predicate places. [2023-01-28 04:02:56,170 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 409 transitions, 8720 flow [2023-01-28 04:02:56,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:56,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:02:56,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:02:56,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-01-28 04:02:56,171 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:02:56,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:02:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2013740015, now seen corresponding path program 5 times [2023-01-28 04:02:56,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:02:56,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28493503] [2023-01-28 04:02:56,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:02:56,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:02:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:02:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:02:56,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:02:56,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28493503] [2023-01-28 04:02:56,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28493503] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:02:56,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:02:56,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:02:56,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399624209] [2023-01-28 04:02:56,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:02:56,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:02:56,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:02:56,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:02:56,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:02:56,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:02:56,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 409 transitions, 8720 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:02:56,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:02:56,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:02:56,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:03:02,428 INFO L130 PetriNetUnfolder]: 27955/41862 cut-off events. [2023-01-28 04:03:02,429 INFO L131 PetriNetUnfolder]: For 940457/946048 co-relation queries the response was YES. [2023-01-28 04:03:02,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308888 conditions, 41862 events. 27955/41862 cut-off events. For 940457/946048 co-relation queries the response was YES. Maximal size of possible extension queue 2756. Compared 311318 event pairs, 7203 based on Foata normal form. 4581/45565 useless extension candidates. Maximal degree in co-relation 288644. Up to 18914 conditions per place. [2023-01-28 04:03:02,933 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 314 selfloop transitions, 185 changer transitions 30/551 dead transitions. [2023-01-28 04:03:02,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 551 transitions, 11826 flow [2023-01-28 04:03:02,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:03:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:03:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-01-28 04:03:02,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099009900990099 [2023-01-28 04:03:02,935 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-01-28 04:03:02,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-01-28 04:03:02,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:03:02,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-01-28 04:03:02,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:02,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:02,936 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:02,936 INFO L175 Difference]: Start difference. First operand has 160 places, 409 transitions, 8720 flow. Second operand 5 states and 515 transitions. [2023-01-28 04:03:02,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 551 transitions, 11826 flow [2023-01-28 04:03:08,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 551 transitions, 11392 flow, removed 45 selfloop flow, removed 3 redundant places. [2023-01-28 04:03:08,198 INFO L231 Difference]: Finished difference. Result has 162 places, 420 transitions, 9009 flow [2023-01-28 04:03:08,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=8292, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9009, PETRI_PLACES=162, PETRI_TRANSITIONS=420} [2023-01-28 04:03:08,199 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 124 predicate places. [2023-01-28 04:03:08,199 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 420 transitions, 9009 flow [2023-01-28 04:03:08,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:08,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:03:08,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:03:08,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-01-28 04:03:08,199 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:03:08,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:03:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash 328926055, now seen corresponding path program 6 times [2023-01-28 04:03:08,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:03:08,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181208500] [2023-01-28 04:03:08,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:03:08,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:03:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:03:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:03:08,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:03:08,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181208500] [2023-01-28 04:03:08,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181208500] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:03:08,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140449998] [2023-01-28 04:03:08,259 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 04:03:08,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:03:08,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:03:08,260 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:03:08,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-28 04:03:08,346 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-28 04:03:08,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:03:08,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 04:03:08,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:03:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:03:08,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:03:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:03:08,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140449998] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:03:08,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:03:08,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 04:03:08,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868259933] [2023-01-28 04:03:08,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:03:08,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 04:03:08,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:03:08,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 04:03:08,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-01-28 04:03:08,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:03:08,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 420 transitions, 9009 flow. Second operand has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:08,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:03:08,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:03:08,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:03:15,357 INFO L130 PetriNetUnfolder]: 30804/45994 cut-off events. [2023-01-28 04:03:15,358 INFO L131 PetriNetUnfolder]: For 1028273/1032695 co-relation queries the response was YES. [2023-01-28 04:03:15,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337437 conditions, 45994 events. 30804/45994 cut-off events. For 1028273/1032695 co-relation queries the response was YES. Maximal size of possible extension queue 2811. Compared 340648 event pairs, 7530 based on Foata normal form. 4096/49359 useless extension candidates. Maximal degree in co-relation 316189. Up to 17610 conditions per place. [2023-01-28 04:03:15,893 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 416 selfloop transitions, 163 changer transitions 26/651 dead transitions. [2023-01-28 04:03:15,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 651 transitions, 14204 flow [2023-01-28 04:03:15,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:03:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:03:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-01-28 04:03:15,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099009900990099 [2023-01-28 04:03:15,895 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-01-28 04:03:15,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-01-28 04:03:15,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:03:15,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-01-28 04:03:15,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:15,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:15,913 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:15,913 INFO L175 Difference]: Start difference. First operand has 162 places, 420 transitions, 9009 flow. Second operand 5 states and 515 transitions. [2023-01-28 04:03:15,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 651 transitions, 14204 flow [2023-01-28 04:03:22,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 651 transitions, 13622 flow, removed 54 selfloop flow, removed 4 redundant places. [2023-01-28 04:03:22,292 INFO L231 Difference]: Finished difference. Result has 165 places, 481 transitions, 10412 flow [2023-01-28 04:03:22,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=8543, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10412, PETRI_PLACES=165, PETRI_TRANSITIONS=481} [2023-01-28 04:03:22,292 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 127 predicate places. [2023-01-28 04:03:22,292 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 481 transitions, 10412 flow [2023-01-28 04:03:22,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:22,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:03:22,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:03:22,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-01-28 04:03:22,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:03:22,497 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:03:22,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:03:22,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1550796492, now seen corresponding path program 8 times [2023-01-28 04:03:22,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:03:22,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034783253] [2023-01-28 04:03:22,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:03:22,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:03:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:03:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:03:22,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:03:22,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034783253] [2023-01-28 04:03:22,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034783253] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:03:22,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:03:22,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:03:22,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821685423] [2023-01-28 04:03:22,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:03:22,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:03:22,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:03:22,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:03:22,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:03:22,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:03:22,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 481 transitions, 10412 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:22,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:03:22,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:03:22,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:03:29,471 INFO L130 PetriNetUnfolder]: 30448/45750 cut-off events. [2023-01-28 04:03:29,471 INFO L131 PetriNetUnfolder]: For 988654/990532 co-relation queries the response was YES. [2023-01-28 04:03:29,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336545 conditions, 45750 events. 30448/45750 cut-off events. For 988654/990532 co-relation queries the response was YES. Maximal size of possible extension queue 2616. Compared 339960 event pairs, 7545 based on Foata normal form. 1138/46536 useless extension candidates. Maximal degree in co-relation 317170. Up to 21598 conditions per place. [2023-01-28 04:03:30,228 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 487 selfloop transitions, 97 changer transitions 77/715 dead transitions. [2023-01-28 04:03:30,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 715 transitions, 15601 flow [2023-01-28 04:03:30,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:03:30,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:03:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2023-01-28 04:03:30,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505940594059406 [2023-01-28 04:03:30,230 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions. [2023-01-28 04:03:30,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions. [2023-01-28 04:03:30,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:03:30,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions. [2023-01-28 04:03:30,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:30,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:30,232 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:30,232 INFO L175 Difference]: Start difference. First operand has 165 places, 481 transitions, 10412 flow. Second operand 5 states and 511 transitions. [2023-01-28 04:03:30,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 715 transitions, 15601 flow [2023-01-28 04:03:37,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 715 transitions, 15241 flow, removed 96 selfloop flow, removed 1 redundant places. [2023-01-28 04:03:37,294 INFO L231 Difference]: Finished difference. Result has 171 places, 524 transitions, 11402 flow [2023-01-28 04:03:37,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=10101, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11402, PETRI_PLACES=171, PETRI_TRANSITIONS=524} [2023-01-28 04:03:37,295 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 133 predicate places. [2023-01-28 04:03:37,295 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 524 transitions, 11402 flow [2023-01-28 04:03:37,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:37,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:03:37,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:03:37,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-01-28 04:03:37,296 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:03:37,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:03:37,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1955010241, now seen corresponding path program 7 times [2023-01-28 04:03:37,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:03:37,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674898760] [2023-01-28 04:03:37,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:03:37,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:03:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:03:37,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:03:37,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:03:37,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674898760] [2023-01-28 04:03:37,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674898760] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:03:37,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765105705] [2023-01-28 04:03:37,341 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 04:03:37,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:03:37,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:03:37,358 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:03:37,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-28 04:03:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:03:37,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 04:03:37,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:03:37,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:03:37,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:03:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:03:37,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765105705] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:03:37,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:03:37,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 04:03:37,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355541368] [2023-01-28 04:03:37,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:03:37,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 04:03:37,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:03:37,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 04:03:37,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-01-28 04:03:37,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:03:37,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 524 transitions, 11402 flow. Second operand has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:37,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:03:37,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:03:37,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:03:44,378 INFO L130 PetriNetUnfolder]: 28497/42251 cut-off events. [2023-01-28 04:03:44,378 INFO L131 PetriNetUnfolder]: For 1036949/1041043 co-relation queries the response was YES. [2023-01-28 04:03:44,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324920 conditions, 42251 events. 28497/42251 cut-off events. For 1036949/1041043 co-relation queries the response was YES. Maximal size of possible extension queue 2536. Compared 306329 event pairs, 3394 based on Foata normal form. 3859/45367 useless extension candidates. Maximal degree in co-relation 306550. Up to 15562 conditions per place. [2023-01-28 04:03:44,847 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 574 selfloop transitions, 161 changer transitions 81/868 dead transitions. [2023-01-28 04:03:44,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 868 transitions, 18971 flow [2023-01-28 04:03:44,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 04:03:44,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 04:03:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 813 transitions. [2023-01-28 04:03:44,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030940594059405 [2023-01-28 04:03:44,849 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 813 transitions. [2023-01-28 04:03:44,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 813 transitions. [2023-01-28 04:03:44,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:03:44,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 813 transitions. [2023-01-28 04:03:44,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.625) internal successors, (813), 8 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:44,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:44,851 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:44,851 INFO L175 Difference]: Start difference. First operand has 171 places, 524 transitions, 11402 flow. Second operand 8 states and 813 transitions. [2023-01-28 04:03:44,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 868 transitions, 18971 flow [2023-01-28 04:03:51,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 868 transitions, 18711 flow, removed 101 selfloop flow, removed 1 redundant places. [2023-01-28 04:03:51,675 INFO L231 Difference]: Finished difference. Result has 179 places, 546 transitions, 12220 flow [2023-01-28 04:03:51,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11204, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12220, PETRI_PLACES=179, PETRI_TRANSITIONS=546} [2023-01-28 04:03:51,676 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 141 predicate places. [2023-01-28 04:03:51,676 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 546 transitions, 12220 flow [2023-01-28 04:03:51,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:51,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:03:51,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:03:51,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-28 04:03:51,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-01-28 04:03:51,881 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:03:51,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:03:51,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1547411515, now seen corresponding path program 6 times [2023-01-28 04:03:51,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:03:51,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445379519] [2023-01-28 04:03:51,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:03:51,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:03:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:03:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:03:51,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:03:51,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445379519] [2023-01-28 04:03:51,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445379519] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:03:51,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:03:51,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:03:51,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914852473] [2023-01-28 04:03:51,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:03:51,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:03:51,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:03:51,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:03:51,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:03:51,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:03:51,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 546 transitions, 12220 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:51,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:03:51,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:03:51,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:03:58,099 INFO L130 PetriNetUnfolder]: 25160/36932 cut-off events. [2023-01-28 04:03:58,099 INFO L131 PetriNetUnfolder]: For 986589/994236 co-relation queries the response was YES. [2023-01-28 04:03:58,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290487 conditions, 36932 events. 25160/36932 cut-off events. For 986589/994236 co-relation queries the response was YES. Maximal size of possible extension queue 2305. Compared 259742 event pairs, 5948 based on Foata normal form. 5920/41908 useless extension candidates. Maximal degree in co-relation 273173. Up to 16715 conditions per place. [2023-01-28 04:03:58,575 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 388 selfloop transitions, 235 changer transitions 75/729 dead transitions. [2023-01-28 04:03:58,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 729 transitions, 16766 flow [2023-01-28 04:03:58,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 04:03:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 04:03:58,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2023-01-28 04:03:58,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-28 04:03:58,577 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2023-01-28 04:03:58,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2023-01-28 04:03:58,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:03:58,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2023-01-28 04:03:58,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:58,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:58,578 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:03:58,578 INFO L175 Difference]: Start difference. First operand has 179 places, 546 transitions, 12220 flow. Second operand 6 states and 606 transitions. [2023-01-28 04:03:58,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 729 transitions, 16766 flow [2023-01-28 04:04:03,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 729 transitions, 16268 flow, removed 86 selfloop flow, removed 5 redundant places. [2023-01-28 04:04:03,269 INFO L231 Difference]: Finished difference. Result has 180 places, 545 transitions, 12355 flow [2023-01-28 04:04:03,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11776, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12355, PETRI_PLACES=180, PETRI_TRANSITIONS=545} [2023-01-28 04:04:03,273 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 142 predicate places. [2023-01-28 04:04:03,273 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 545 transitions, 12355 flow [2023-01-28 04:04:03,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:03,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:04:03,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:04:03,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-01-28 04:04:03,274 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:04:03,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:04:03,274 INFO L85 PathProgramCache]: Analyzing trace with hash 13754851, now seen corresponding path program 7 times [2023-01-28 04:04:03,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:04:03,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487204786] [2023-01-28 04:04:03,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:04:03,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:04:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:04:03,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:04:03,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:04:03,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487204786] [2023-01-28 04:04:03,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487204786] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:04:03,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:04:03,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:04:03,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563063421] [2023-01-28 04:04:03,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:04:03,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:04:03,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:04:03,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:04:03,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:04:03,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:04:03,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 545 transitions, 12355 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:03,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:04:03,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:04:03,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:04:08,964 INFO L130 PetriNetUnfolder]: 24669/35922 cut-off events. [2023-01-28 04:04:08,964 INFO L131 PetriNetUnfolder]: For 841027/843152 co-relation queries the response was YES. [2023-01-28 04:04:09,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277215 conditions, 35922 events. 24669/35922 cut-off events. For 841027/843152 co-relation queries the response was YES. Maximal size of possible extension queue 1938. Compared 242490 event pairs, 4292 based on Foata normal form. 1728/37238 useless extension candidates. Maximal degree in co-relation 262952. Up to 18008 conditions per place. [2023-01-28 04:04:09,511 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 439 selfloop transitions, 192 changer transitions 64/733 dead transitions. [2023-01-28 04:04:09,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 733 transitions, 17092 flow [2023-01-28 04:04:09,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:04:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:04:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2023-01-28 04:04:09,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500990099009901 [2023-01-28 04:04:09,513 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2023-01-28 04:04:09,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2023-01-28 04:04:09,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:04:09,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2023-01-28 04:04:09,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:09,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:09,514 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:09,514 INFO L175 Difference]: Start difference. First operand has 180 places, 545 transitions, 12355 flow. Second operand 5 states and 506 transitions. [2023-01-28 04:04:09,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 733 transitions, 17092 flow [2023-01-28 04:04:14,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 733 transitions, 16406 flow, removed 112 selfloop flow, removed 5 redundant places. [2023-01-28 04:04:14,541 INFO L231 Difference]: Finished difference. Result has 181 places, 553 transitions, 12456 flow [2023-01-28 04:04:14,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11669, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12456, PETRI_PLACES=181, PETRI_TRANSITIONS=553} [2023-01-28 04:04:14,542 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 143 predicate places. [2023-01-28 04:04:14,542 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 553 transitions, 12456 flow [2023-01-28 04:04:14,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:14,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:04:14,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:04:14,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-01-28 04:04:14,543 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:04:14,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:04:14,543 INFO L85 PathProgramCache]: Analyzing trace with hash 201753452, now seen corresponding path program 9 times [2023-01-28 04:04:14,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:04:14,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12227993] [2023-01-28 04:04:14,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:04:14,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:04:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:04:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:04:14,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:04:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12227993] [2023-01-28 04:04:14,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12227993] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:04:14,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:04:14,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:04:14,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611768079] [2023-01-28 04:04:14,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:04:14,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:04:14,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:04:14,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:04:14,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:04:14,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:04:14,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 553 transitions, 12456 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:14,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:04:14,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:04:14,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:04:20,637 INFO L130 PetriNetUnfolder]: 25669/36968 cut-off events. [2023-01-28 04:04:20,638 INFO L131 PetriNetUnfolder]: For 867355/869414 co-relation queries the response was YES. [2023-01-28 04:04:21,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283852 conditions, 36968 events. 25669/36968 cut-off events. For 867355/869414 co-relation queries the response was YES. Maximal size of possible extension queue 1951. Compared 244752 event pairs, 6934 based on Foata normal form. 1210/37880 useless extension candidates. Maximal degree in co-relation 269900. Up to 20029 conditions per place. [2023-01-28 04:04:21,229 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 553 selfloop transitions, 93 changer transitions 22/718 dead transitions. [2023-01-28 04:04:21,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 718 transitions, 16758 flow [2023-01-28 04:04:21,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:04:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:04:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-01-28 04:04:21,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501980198019802 [2023-01-28 04:04:21,235 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-01-28 04:04:21,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-01-28 04:04:21,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:04:21,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-01-28 04:04:21,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:21,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:21,237 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:21,237 INFO L175 Difference]: Start difference. First operand has 181 places, 553 transitions, 12456 flow. Second operand 5 states and 507 transitions. [2023-01-28 04:04:21,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 718 transitions, 16758 flow [2023-01-28 04:04:27,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 718 transitions, 16201 flow, removed 51 selfloop flow, removed 5 redundant places. [2023-01-28 04:04:27,315 INFO L231 Difference]: Finished difference. Result has 181 places, 562 transitions, 12412 flow [2023-01-28 04:04:27,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11976, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12412, PETRI_PLACES=181, PETRI_TRANSITIONS=562} [2023-01-28 04:04:27,316 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 143 predicate places. [2023-01-28 04:04:27,316 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 562 transitions, 12412 flow [2023-01-28 04:04:27,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:27,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:04:27,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:04:27,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-01-28 04:04:27,317 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:04:27,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:04:27,317 INFO L85 PathProgramCache]: Analyzing trace with hash -303154112, now seen corresponding path program 10 times [2023-01-28 04:04:27,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:04:27,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472264698] [2023-01-28 04:04:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:04:27,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:04:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:04:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:04:27,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:04:27,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472264698] [2023-01-28 04:04:27,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472264698] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:04:27,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:04:27,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:04:27,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930958539] [2023-01-28 04:04:27,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:04:27,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:04:27,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:04:27,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:04:27,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:04:27,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:04:27,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 562 transitions, 12412 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:27,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:04:27,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:04:27,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:04:32,787 INFO L130 PetriNetUnfolder]: 23491/33728 cut-off events. [2023-01-28 04:04:32,787 INFO L131 PetriNetUnfolder]: For 806643/809922 co-relation queries the response was YES. [2023-01-28 04:04:33,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261789 conditions, 33728 events. 23491/33728 cut-off events. For 806643/809922 co-relation queries the response was YES. Maximal size of possible extension queue 1895. Compared 221443 event pairs, 6161 based on Foata normal form. 2063/35586 useless extension candidates. Maximal degree in co-relation 251511. Up to 16283 conditions per place. [2023-01-28 04:04:33,221 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 495 selfloop transitions, 131 changer transitions 51/705 dead transitions. [2023-01-28 04:04:33,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 705 transitions, 16312 flow [2023-01-28 04:04:33,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:04:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:04:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-01-28 04:04:33,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49603960396039604 [2023-01-28 04:04:33,223 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-01-28 04:04:33,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-01-28 04:04:33,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:04:33,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-01-28 04:04:33,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:33,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:33,224 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:33,224 INFO L175 Difference]: Start difference. First operand has 181 places, 562 transitions, 12412 flow. Second operand 5 states and 501 transitions. [2023-01-28 04:04:33,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 705 transitions, 16312 flow [2023-01-28 04:04:38,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 705 transitions, 16044 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-01-28 04:04:38,872 INFO L231 Difference]: Finished difference. Result has 183 places, 550 transitions, 12321 flow [2023-01-28 04:04:38,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=12196, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12321, PETRI_PLACES=183, PETRI_TRANSITIONS=550} [2023-01-28 04:04:38,873 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 145 predicate places. [2023-01-28 04:04:38,873 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 550 transitions, 12321 flow [2023-01-28 04:04:38,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:38,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:04:38,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:04:38,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-01-28 04:04:38,874 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:04:38,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:04:38,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1032574491, now seen corresponding path program 8 times [2023-01-28 04:04:38,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:04:38,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011818951] [2023-01-28 04:04:38,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:04:38,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:04:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:04:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:04:38,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:04:38,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011818951] [2023-01-28 04:04:38,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011818951] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:04:38,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:04:38,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:04:38,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971415226] [2023-01-28 04:04:38,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:04:38,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:04:38,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:04:38,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:04:38,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:04:38,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:04:38,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 550 transitions, 12321 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:38,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:04:38,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:04:38,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:04:43,934 INFO L130 PetriNetUnfolder]: 22334/31675 cut-off events. [2023-01-28 04:04:43,934 INFO L131 PetriNetUnfolder]: For 775607/778609 co-relation queries the response was YES. [2023-01-28 04:04:44,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248094 conditions, 31675 events. 22334/31675 cut-off events. For 775607/778609 co-relation queries the response was YES. Maximal size of possible extension queue 1768. Compared 200690 event pairs, 5780 based on Foata normal form. 2118/32979 useless extension candidates. Maximal degree in co-relation 243421. Up to 16795 conditions per place. [2023-01-28 04:04:44,390 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 370 selfloop transitions, 183 changer transitions 93/692 dead transitions. [2023-01-28 04:04:44,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 692 transitions, 16016 flow [2023-01-28 04:04:44,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:04:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:04:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2023-01-28 04:04:44,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-28 04:04:44,391 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2023-01-28 04:04:44,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2023-01-28 04:04:44,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:04:44,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2023-01-28 04:04:44,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:44,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:44,392 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:44,392 INFO L175 Difference]: Start difference. First operand has 183 places, 550 transitions, 12321 flow. Second operand 5 states and 505 transitions. [2023-01-28 04:04:44,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 692 transitions, 16016 flow [2023-01-28 04:04:48,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 692 transitions, 15511 flow, removed 76 selfloop flow, removed 6 redundant places. [2023-01-28 04:04:48,488 INFO L231 Difference]: Finished difference. Result has 180 places, 550 transitions, 12272 flow [2023-01-28 04:04:48,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11868, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12272, PETRI_PLACES=180, PETRI_TRANSITIONS=550} [2023-01-28 04:04:48,489 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 142 predicate places. [2023-01-28 04:04:48,489 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 550 transitions, 12272 flow [2023-01-28 04:04:48,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:48,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:04:48,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:04:48,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-01-28 04:04:48,489 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:04:48,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:04:48,489 INFO L85 PathProgramCache]: Analyzing trace with hash -481538739, now seen corresponding path program 8 times [2023-01-28 04:04:48,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:04:48,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286569451] [2023-01-28 04:04:48,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:04:48,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:04:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:04:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:04:48,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:04:48,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286569451] [2023-01-28 04:04:48,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286569451] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:04:48,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247328087] [2023-01-28 04:04:48,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 04:04:48,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:04:48,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:04:48,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:04:48,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-28 04:04:48,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 04:04:48,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:04:48,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 04:04:48,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:04:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:04:48,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:04:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:04:48,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247328087] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:04:48,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:04:48,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 04:04:48,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983742476] [2023-01-28 04:04:48,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:04:48,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 04:04:48,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:04:48,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 04:04:48,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-01-28 04:04:48,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:04:48,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 550 transitions, 12272 flow. Second operand has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:48,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:04:48,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:04:48,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:04:53,738 INFO L130 PetriNetUnfolder]: 22923/32314 cut-off events. [2023-01-28 04:04:53,738 INFO L131 PetriNetUnfolder]: For 737438/739982 co-relation queries the response was YES. [2023-01-28 04:04:54,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251696 conditions, 32314 events. 22923/32314 cut-off events. For 737438/739982 co-relation queries the response was YES. Maximal size of possible extension queue 1770. Compared 201711 event pairs, 2880 based on Foata normal form. 1865/33810 useless extension candidates. Maximal degree in co-relation 227485. Up to 14697 conditions per place. [2023-01-28 04:04:54,216 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 497 selfloop transitions, 230 changer transitions 119/881 dead transitions. [2023-01-28 04:04:54,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 881 transitions, 19638 flow [2023-01-28 04:04:54,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 04:04:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 04:04:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 809 transitions. [2023-01-28 04:04:54,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006188118811881 [2023-01-28 04:04:54,217 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 809 transitions. [2023-01-28 04:04:54,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 809 transitions. [2023-01-28 04:04:54,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:04:54,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 809 transitions. [2023-01-28 04:04:54,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.125) internal successors, (809), 8 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:54,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:54,219 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:54,219 INFO L175 Difference]: Start difference. First operand has 180 places, 550 transitions, 12272 flow. Second operand 8 states and 809 transitions. [2023-01-28 04:04:54,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 881 transitions, 19638 flow [2023-01-28 04:04:58,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 881 transitions, 19252 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-01-28 04:04:58,986 INFO L231 Difference]: Finished difference. Result has 185 places, 560 transitions, 12698 flow [2023-01-28 04:04:58,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11892, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12698, PETRI_PLACES=185, PETRI_TRANSITIONS=560} [2023-01-28 04:04:58,987 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 147 predicate places. [2023-01-28 04:04:58,987 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 560 transitions, 12698 flow [2023-01-28 04:04:58,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:58,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:04:58,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:04:59,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-01-28 04:04:59,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:04:59,192 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:04:59,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:04:59,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2051744475, now seen corresponding path program 9 times [2023-01-28 04:04:59,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:04:59,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731916666] [2023-01-28 04:04:59,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:04:59,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:04:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:04:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:04:59,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:04:59,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731916666] [2023-01-28 04:04:59,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731916666] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:04:59,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111538663] [2023-01-28 04:04:59,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 04:04:59,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:04:59,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:04:59,238 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:04:59,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-28 04:04:59,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 04:04:59,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:04:59,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 04:04:59,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:04:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:04:59,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:04:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:04:59,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111538663] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:04:59,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:04:59,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 04:04:59,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313796901] [2023-01-28 04:04:59,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:04:59,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 04:04:59,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:04:59,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 04:04:59,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-01-28 04:04:59,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:04:59,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 560 transitions, 12698 flow. Second operand has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:04:59,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:04:59,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:04:59,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:05:04,120 INFO L130 PetriNetUnfolder]: 21401/29770 cut-off events. [2023-01-28 04:05:04,120 INFO L131 PetriNetUnfolder]: For 730383/733737 co-relation queries the response was YES. [2023-01-28 04:05:04,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239539 conditions, 29770 events. 21401/29770 cut-off events. For 730383/733737 co-relation queries the response was YES. Maximal size of possible extension queue 1611. Compared 179571 event pairs, 5378 based on Foata normal form. 2146/31540 useless extension candidates. Maximal degree in co-relation 207874. Up to 16809 conditions per place. [2023-01-28 04:05:04,489 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 441 selfloop transitions, 154 changer transitions 51/679 dead transitions. [2023-01-28 04:05:04,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 679 transitions, 15822 flow [2023-01-28 04:05:04,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:05:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:05:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-01-28 04:05:04,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501980198019802 [2023-01-28 04:05:04,490 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-01-28 04:05:04,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-01-28 04:05:04,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:05:04,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-01-28 04:05:04,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:04,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:04,491 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:04,491 INFO L175 Difference]: Start difference. First operand has 185 places, 560 transitions, 12698 flow. Second operand 5 states and 507 transitions. [2023-01-28 04:05:04,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 679 transitions, 15822 flow [2023-01-28 04:05:09,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 679 transitions, 15218 flow, removed 82 selfloop flow, removed 6 redundant places. [2023-01-28 04:05:09,664 INFO L231 Difference]: Finished difference. Result has 183 places, 541 transitions, 12100 flow [2023-01-28 04:05:09,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=12106, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12100, PETRI_PLACES=183, PETRI_TRANSITIONS=541} [2023-01-28 04:05:09,665 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 145 predicate places. [2023-01-28 04:05:09,665 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 541 transitions, 12100 flow [2023-01-28 04:05:09,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:09,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:05:09,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:05:09,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-28 04:05:09,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-01-28 04:05:09,871 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:05:09,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:05:09,871 INFO L85 PathProgramCache]: Analyzing trace with hash -210520731, now seen corresponding path program 9 times [2023-01-28 04:05:09,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:05:09,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899708961] [2023-01-28 04:05:09,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:05:09,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:05:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:05:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:05:09,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:05:09,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899708961] [2023-01-28 04:05:09,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899708961] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:05:09,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:05:09,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 04:05:09,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358080602] [2023-01-28 04:05:09,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:05:09,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 04:05:09,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:05:09,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 04:05:09,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 04:05:09,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:05:09,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 541 transitions, 12100 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:09,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:05:09,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:05:09,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:05:13,467 INFO L130 PetriNetUnfolder]: 18175/24257 cut-off events. [2023-01-28 04:05:13,467 INFO L131 PetriNetUnfolder]: For 603230/605933 co-relation queries the response was YES. [2023-01-28 04:05:13,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196240 conditions, 24257 events. 18175/24257 cut-off events. For 603230/605933 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 129418 event pairs, 4009 based on Foata normal form. 2024/25529 useless extension candidates. Maximal degree in co-relation 178146. Up to 13332 conditions per place. [2023-01-28 04:05:13,710 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 327 selfloop transitions, 195 changer transitions 61/613 dead transitions. [2023-01-28 04:05:13,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 613 transitions, 14273 flow [2023-01-28 04:05:13,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:05:13,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:05:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-01-28 04:05:13,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49603960396039604 [2023-01-28 04:05:13,712 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-01-28 04:05:13,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-01-28 04:05:13,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:05:13,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-01-28 04:05:13,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:13,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:13,713 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:13,713 INFO L175 Difference]: Start difference. First operand has 183 places, 541 transitions, 12100 flow. Second operand 5 states and 501 transitions. [2023-01-28 04:05:13,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 613 transitions, 14273 flow [2023-01-28 04:05:16,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 613 transitions, 13631 flow, removed 142 selfloop flow, removed 8 redundant places. [2023-01-28 04:05:16,946 INFO L231 Difference]: Finished difference. Result has 175 places, 509 transitions, 11199 flow [2023-01-28 04:05:16,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11485, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11199, PETRI_PLACES=175, PETRI_TRANSITIONS=509} [2023-01-28 04:05:16,946 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 137 predicate places. [2023-01-28 04:05:16,946 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 509 transitions, 11199 flow [2023-01-28 04:05:16,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:16,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:05:16,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:05:16,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-01-28 04:05:16,947 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:05:16,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:05:16,947 INFO L85 PathProgramCache]: Analyzing trace with hash -667345164, now seen corresponding path program 1 times [2023-01-28 04:05:16,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:05:16,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822930369] [2023-01-28 04:05:16,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:05:16,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:05:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:05:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:05:16,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:05:16,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822930369] [2023-01-28 04:05:16,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822930369] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:05:16,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656368578] [2023-01-28 04:05:16,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:05:16,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:05:16,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:05:16,998 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:05:16,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-28 04:05:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:05:17,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 04:05:17,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:05:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:05:17,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:05:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:05:17,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656368578] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:05:17,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:05:17,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-01-28 04:05:17,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232227696] [2023-01-28 04:05:17,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:05:17,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 04:05:17,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:05:17,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 04:05:17,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-28 04:05:17,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:05:17,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 509 transitions, 11199 flow. Second operand has 8 states, 8 states have (on average 90.0) internal successors, (720), 8 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:17,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:05:17,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:05:17,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:05:20,330 INFO L130 PetriNetUnfolder]: 17052/22257 cut-off events. [2023-01-28 04:05:20,330 INFO L131 PetriNetUnfolder]: For 507950/509893 co-relation queries the response was YES. [2023-01-28 04:05:20,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184120 conditions, 22257 events. 17052/22257 cut-off events. For 507950/509893 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 109890 event pairs, 2012 based on Foata normal form. 998/22714 useless extension candidates. Maximal degree in co-relation 168442. Up to 13528 conditions per place. [2023-01-28 04:05:20,552 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 420 selfloop transitions, 169 changer transitions 1/620 dead transitions. [2023-01-28 04:05:20,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 620 transitions, 14088 flow [2023-01-28 04:05:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:05:20,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:05:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-01-28 04:05:20,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49603960396039604 [2023-01-28 04:05:20,554 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-01-28 04:05:20,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-01-28 04:05:20,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:05:20,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-01-28 04:05:20,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:20,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:20,555 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:20,555 INFO L175 Difference]: Start difference. First operand has 175 places, 509 transitions, 11199 flow. Second operand 5 states and 501 transitions. [2023-01-28 04:05:20,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 620 transitions, 14088 flow [2023-01-28 04:05:23,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 620 transitions, 12458 flow, removed 172 selfloop flow, removed 22 redundant places. [2023-01-28 04:05:23,305 INFO L231 Difference]: Finished difference. Result has 143 places, 525 transitions, 10573 flow [2023-01-28 04:05:23,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=9715, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10573, PETRI_PLACES=143, PETRI_TRANSITIONS=525} [2023-01-28 04:05:23,305 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 105 predicate places. [2023-01-28 04:05:23,306 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 525 transitions, 10573 flow [2023-01-28 04:05:23,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.0) internal successors, (720), 8 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:23,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:05:23,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:05:23,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-28 04:05:23,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-01-28 04:05:23,510 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:05:23,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:05:23,511 INFO L85 PathProgramCache]: Analyzing trace with hash -65837510, now seen corresponding path program 2 times [2023-01-28 04:05:23,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:05:23,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124245282] [2023-01-28 04:05:23,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:05:23,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:05:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:05:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:05:23,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:05:23,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124245282] [2023-01-28 04:05:23,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124245282] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:05:23,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389970749] [2023-01-28 04:05:23,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 04:05:23,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:05:23,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:05:23,553 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:05:23,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-28 04:05:23,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 04:05:23,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:05:23,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 04:05:23,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:05:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:05:23,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:05:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:05:23,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389970749] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:05:23,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:05:23,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 04:05:23,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638112924] [2023-01-28 04:05:23,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:05:23,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 04:05:23,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:05:23,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 04:05:23,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-01-28 04:05:23,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 202 [2023-01-28 04:05:23,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 525 transitions, 10573 flow. Second operand has 10 states, 10 states have (on average 87.3) internal successors, (873), 10 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:23,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:05:23,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 202 [2023-01-28 04:05:23,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:05:27,045 INFO L130 PetriNetUnfolder]: 19775/25806 cut-off events. [2023-01-28 04:05:27,045 INFO L131 PetriNetUnfolder]: For 471967/473084 co-relation queries the response was YES. [2023-01-28 04:05:27,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203310 conditions, 25806 events. 19775/25806 cut-off events. For 471967/473084 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 128460 event pairs, 1201 based on Foata normal form. 865/26315 useless extension candidates. Maximal degree in co-relation 182335. Up to 15510 conditions per place. [2023-01-28 04:05:27,504 INFO L137 encePairwiseOnDemand]: 195/202 looper letters, 443 selfloop transitions, 385 changer transitions 2/842 dead transitions. [2023-01-28 04:05:27,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 842 transitions, 16889 flow [2023-01-28 04:05:27,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-28 04:05:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-01-28 04:05:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1428 transitions. [2023-01-28 04:05:27,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47128712871287126 [2023-01-28 04:05:27,506 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1428 transitions. [2023-01-28 04:05:27,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1428 transitions. [2023-01-28 04:05:27,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:05:27,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1428 transitions. [2023-01-28 04:05:27,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 95.2) internal successors, (1428), 15 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:27,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 202.0) internal successors, (3232), 16 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:27,509 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 202.0) internal successors, (3232), 16 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:27,509 INFO L175 Difference]: Start difference. First operand has 143 places, 525 transitions, 10573 flow. Second operand 15 states and 1428 transitions. [2023-01-28 04:05:27,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 842 transitions, 16889 flow [2023-01-28 04:05:29,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 842 transitions, 16574 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-01-28 04:05:29,777 INFO L231 Difference]: Finished difference. Result has 161 places, 620 transitions, 13397 flow [2023-01-28 04:05:29,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=10319, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=294, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13397, PETRI_PLACES=161, PETRI_TRANSITIONS=620} [2023-01-28 04:05:29,778 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 123 predicate places. [2023-01-28 04:05:29,778 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 620 transitions, 13397 flow [2023-01-28 04:05:29,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.3) internal successors, (873), 10 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:29,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:05:29,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:05:29,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-28 04:05:29,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-01-28 04:05:29,981 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:05:29,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:05:29,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1053393848, now seen corresponding path program 3 times [2023-01-28 04:05:29,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:05:29,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284190173] [2023-01-28 04:05:29,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:05:29,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:05:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:05:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:05:30,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:05:30,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284190173] [2023-01-28 04:05:30,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284190173] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:05:30,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695998477] [2023-01-28 04:05:30,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 04:05:30,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:05:30,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:05:30,107 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:05:30,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-28 04:05:30,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 04:05:30,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:05:30,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 04:05:30,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:05:30,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:05:30,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:05:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:05:30,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695998477] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:05:30,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:05:30,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 04:05:30,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38189159] [2023-01-28 04:05:30,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:05:30,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 04:05:30,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:05:30,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 04:05:30,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-01-28 04:05:30,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 202 [2023-01-28 04:05:30,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 620 transitions, 13397 flow. Second operand has 10 states, 10 states have (on average 87.2) internal successors, (872), 10 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:30,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:05:30,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 202 [2023-01-28 04:05:30,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:05:34,793 INFO L130 PetriNetUnfolder]: 24929/32605 cut-off events. [2023-01-28 04:05:34,793 INFO L131 PetriNetUnfolder]: For 612389/612946 co-relation queries the response was YES. [2023-01-28 04:05:35,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264605 conditions, 32605 events. 24929/32605 cut-off events. For 612389/612946 co-relation queries the response was YES. Maximal size of possible extension queue 1431. Compared 167413 event pairs, 1622 based on Foata normal form. 498/32960 useless extension candidates. Maximal degree in co-relation 240253. Up to 19261 conditions per place. [2023-01-28 04:05:35,217 INFO L137 encePairwiseOnDemand]: 194/202 looper letters, 618 selfloop transitions, 358 changer transitions 1/1001 dead transitions. [2023-01-28 04:05:35,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 1001 transitions, 21666 flow [2023-01-28 04:05:35,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 04:05:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 04:05:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1341 transitions. [2023-01-28 04:05:35,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4741867043847242 [2023-01-28 04:05:35,219 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1341 transitions. [2023-01-28 04:05:35,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1341 transitions. [2023-01-28 04:05:35,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:05:35,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1341 transitions. [2023-01-28 04:05:35,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 95.78571428571429) internal successors, (1341), 14 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:35,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 202.0) internal successors, (3030), 15 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:35,223 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 202.0) internal successors, (3030), 15 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:35,223 INFO L175 Difference]: Start difference. First operand has 161 places, 620 transitions, 13397 flow. Second operand 14 states and 1341 transitions. [2023-01-28 04:05:35,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 1001 transitions, 21666 flow [2023-01-28 04:05:40,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 1001 transitions, 19189 flow, removed 283 selfloop flow, removed 10 redundant places. [2023-01-28 04:05:40,067 INFO L231 Difference]: Finished difference. Result has 166 places, 742 transitions, 15014 flow [2023-01-28 04:05:40,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11655, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=235, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=15014, PETRI_PLACES=166, PETRI_TRANSITIONS=742} [2023-01-28 04:05:40,068 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 128 predicate places. [2023-01-28 04:05:40,068 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 742 transitions, 15014 flow [2023-01-28 04:05:40,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.2) internal successors, (872), 10 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:40,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:05:40,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:05:40,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-01-28 04:05:40,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-01-28 04:05:40,273 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:05:40,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:05:40,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1871381985, now seen corresponding path program 1 times [2023-01-28 04:05:40,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:05:40,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831163770] [2023-01-28 04:05:40,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:05:40,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:05:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:05:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:05:40,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:05:40,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831163770] [2023-01-28 04:05:40,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831163770] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:05:40,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883888518] [2023-01-28 04:05:40,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:05:40,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:05:40,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:05:40,410 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:05:40,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-01-28 04:05:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:05:40,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 17 conjunts are in the unsatisfiable core [2023-01-28 04:05:40,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:05:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:05:40,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:05:40,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:05:40,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883888518] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:05:40,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:05:40,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 7 [2023-01-28 04:05:40,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360775301] [2023-01-28 04:05:40,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:05:40,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 04:05:40,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:05:40,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 04:05:40,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-01-28 04:05:40,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 202 [2023-01-28 04:05:40,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 742 transitions, 15014 flow. Second operand has 9 states, 9 states have (on average 104.66666666666667) internal successors, (942), 9 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:40,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:05:40,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 202 [2023-01-28 04:05:40,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:05:48,826 INFO L130 PetriNetUnfolder]: 40667/54062 cut-off events. [2023-01-28 04:05:48,826 INFO L131 PetriNetUnfolder]: For 970693/986750 co-relation queries the response was YES. [2023-01-28 04:05:49,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412629 conditions, 54062 events. 40667/54062 cut-off events. For 970693/986750 co-relation queries the response was YES. Maximal size of possible extension queue 2511. Compared 315673 event pairs, 3619 based on Foata normal form. 8820/60831 useless extension candidates. Maximal degree in co-relation 380576. Up to 32297 conditions per place. [2023-01-28 04:05:49,576 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 482 selfloop transitions, 559 changer transitions 5/1125 dead transitions. [2023-01-28 04:05:49,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 1125 transitions, 23116 flow [2023-01-28 04:05:49,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 04:05:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 04:05:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1057 transitions. [2023-01-28 04:05:49,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5814081408140814 [2023-01-28 04:05:49,578 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1057 transitions. [2023-01-28 04:05:49,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1057 transitions. [2023-01-28 04:05:49,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:05:49,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1057 transitions. [2023-01-28 04:05:49,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.44444444444444) internal successors, (1057), 9 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:49,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:49,580 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:49,580 INFO L175 Difference]: Start difference. First operand has 166 places, 742 transitions, 15014 flow. Second operand 9 states and 1057 transitions. [2023-01-28 04:05:49,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 1125 transitions, 23116 flow [2023-01-28 04:05:55,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 1125 transitions, 21178 flow, removed 438 selfloop flow, removed 11 redundant places. [2023-01-28 04:05:55,066 INFO L231 Difference]: Finished difference. Result has 165 places, 1005 transitions, 21197 flow [2023-01-28 04:05:55,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=9252, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=21197, PETRI_PLACES=165, PETRI_TRANSITIONS=1005} [2023-01-28 04:05:55,067 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 127 predicate places. [2023-01-28 04:05:55,067 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 1005 transitions, 21197 flow [2023-01-28 04:05:55,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 104.66666666666667) internal successors, (942), 9 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:55,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:05:55,067 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:05:55,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-01-28 04:05:55,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:05:55,269 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:05:55,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:05:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash 787534766, now seen corresponding path program 2 times [2023-01-28 04:05:55,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:05:55,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145167341] [2023-01-28 04:05:55,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:05:55,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:05:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:05:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:05:55,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:05:55,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145167341] [2023-01-28 04:05:55,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145167341] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:05:55,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504830416] [2023-01-28 04:05:55,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 04:05:55,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:05:55,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:05:55,334 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:05:55,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-01-28 04:05:55,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 04:05:55,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:05:55,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 04:05:55,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:05:55,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:05:55,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:05:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:05:55,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504830416] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:05:55,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:05:55,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-01-28 04:05:55,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995181582] [2023-01-28 04:05:55,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:05:55,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 04:05:55,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:05:55,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 04:05:55,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-01-28 04:05:55,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 202 [2023-01-28 04:05:55,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 1005 transitions, 21197 flow. Second operand has 12 states, 12 states have (on average 87.5) internal successors, (1050), 12 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:05:55,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:05:55,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 202 [2023-01-28 04:05:55,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:06:13,115 INFO L130 PetriNetUnfolder]: 78598/104797 cut-off events. [2023-01-28 04:06:13,115 INFO L131 PetriNetUnfolder]: For 1577870/1578845 co-relation queries the response was YES. [2023-01-28 04:06:14,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783151 conditions, 104797 events. 78598/104797 cut-off events. For 1577870/1578845 co-relation queries the response was YES. Maximal size of possible extension queue 4020. Compared 643365 event pairs, 11791 based on Foata normal form. 3039/107475 useless extension candidates. Maximal degree in co-relation 768271. Up to 57556 conditions per place. [2023-01-28 04:06:14,617 INFO L137 encePairwiseOnDemand]: 194/202 looper letters, 1521 selfloop transitions, 456 changer transitions 0/1997 dead transitions. [2023-01-28 04:06:14,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1997 transitions, 42747 flow [2023-01-28 04:06:14,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-28 04:06:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-28 04:06:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1265 transitions. [2023-01-28 04:06:14,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48172124904798175 [2023-01-28 04:06:14,619 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1265 transitions. [2023-01-28 04:06:14,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1265 transitions. [2023-01-28 04:06:14,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:06:14,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1265 transitions. [2023-01-28 04:06:14,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.3076923076923) internal successors, (1265), 13 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:06:14,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 202.0) internal successors, (2828), 14 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:06:14,622 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 202.0) internal successors, (2828), 14 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:06:14,622 INFO L175 Difference]: Start difference. First operand has 165 places, 1005 transitions, 21197 flow. Second operand 13 states and 1265 transitions. [2023-01-28 04:06:14,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 1997 transitions, 42747 flow [2023-01-28 04:07:33,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 1997 transitions, 40401 flow, removed 1173 selfloop flow, removed 0 redundant places. [2023-01-28 04:07:33,222 INFO L231 Difference]: Finished difference. Result has 187 places, 1278 transitions, 27482 flow [2023-01-28 04:07:33,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=20057, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1005, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=27482, PETRI_PLACES=187, PETRI_TRANSITIONS=1278} [2023-01-28 04:07:33,223 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 149 predicate places. [2023-01-28 04:07:33,223 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 1278 transitions, 27482 flow [2023-01-28 04:07:33,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.5) internal successors, (1050), 12 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:07:33,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:07:33,224 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:07:33,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-01-28 04:07:33,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-01-28 04:07:33,428 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:07:33,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:07:33,429 INFO L85 PathProgramCache]: Analyzing trace with hash -926111482, now seen corresponding path program 3 times [2023-01-28 04:07:33,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:07:33,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107866896] [2023-01-28 04:07:33,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:07:33,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:07:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:07:33,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:07:33,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:07:33,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107866896] [2023-01-28 04:07:33,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107866896] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:07:33,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479283838] [2023-01-28 04:07:33,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 04:07:33,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:07:33,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:07:33,501 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:07:33,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-01-28 04:07:33,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-28 04:07:33,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:07:33,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 04:07:33,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:07:33,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:07:33,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:07:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:07:33,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479283838] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:07:33,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:07:33,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-01-28 04:07:33,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879816203] [2023-01-28 04:07:33,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:07:33,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 04:07:33,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:07:33,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 04:07:33,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-01-28 04:07:33,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 202 [2023-01-28 04:07:33,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 1278 transitions, 27482 flow. Second operand has 14 states, 14 states have (on average 86.5) internal successors, (1211), 14 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:07:33,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:07:33,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 202 [2023-01-28 04:07:33,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:08:12,204 INFO L130 PetriNetUnfolder]: 139227/185735 cut-off events. [2023-01-28 04:08:12,204 INFO L131 PetriNetUnfolder]: For 3462857/3473540 co-relation queries the response was YES. [2023-01-28 04:08:14,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1456167 conditions, 185735 events. 139227/185735 cut-off events. For 3462857/3473540 co-relation queries the response was YES. Maximal size of possible extension queue 6969. Compared 1227144 event pairs, 5433 based on Foata normal form. 12630/197455 useless extension candidates. Maximal degree in co-relation 1441380. Up to 51509 conditions per place. [2023-01-28 04:08:15,528 INFO L137 encePairwiseOnDemand]: 193/202 looper letters, 3398 selfloop transitions, 2085 changer transitions 0/5522 dead transitions. [2023-01-28 04:08:15,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 5522 transitions, 121869 flow [2023-01-28 04:08:15,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-01-28 04:08:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-01-28 04:08:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 4462 transitions. [2023-01-28 04:08:15,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4699810406572572 [2023-01-28 04:08:15,531 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 4462 transitions. [2023-01-28 04:08:15,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 4462 transitions. [2023-01-28 04:08:15,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:08:15,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 4462 transitions. [2023-01-28 04:08:15,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 94.93617021276596) internal successors, (4462), 47 states have internal predecessors, (4462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:08:15,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 202.0) internal successors, (9696), 48 states have internal predecessors, (9696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:08:15,541 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 202.0) internal successors, (9696), 48 states have internal predecessors, (9696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:08:15,541 INFO L175 Difference]: Start difference. First operand has 187 places, 1278 transitions, 27482 flow. Second operand 47 states and 4462 transitions. [2023-01-28 04:08:15,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 5522 transitions, 121869 flow [2023-01-28 04:14:12,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 5522 transitions, 118795 flow, removed 1439 selfloop flow, removed 2 redundant places. [2023-01-28 04:14:12,155 INFO L231 Difference]: Finished difference. Result has 267 places, 2944 transitions, 70120 flow [2023-01-28 04:14:12,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=26966, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=527, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=70120, PETRI_PLACES=267, PETRI_TRANSITIONS=2944} [2023-01-28 04:14:12,156 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 229 predicate places. [2023-01-28 04:14:12,156 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 2944 transitions, 70120 flow [2023-01-28 04:14:12,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 86.5) internal successors, (1211), 14 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:14:12,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:14:12,157 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:14:12,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-01-28 04:14:12,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:14:12,361 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 04:14:12,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:14:12,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1686096440, now seen corresponding path program 4 times [2023-01-28 04:14:12,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:14:12,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443977769] [2023-01-28 04:14:12,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:14:12,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:14:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:14:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:14:12,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:14:12,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443977769] [2023-01-28 04:14:12,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443977769] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:14:12,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89530754] [2023-01-28 04:14:12,412 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 04:14:12,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:14:12,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:14:12,413 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 04:14:12,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-01-28 04:14:12,508 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 04:14:12,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:14:12,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 04:14:12,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:14:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:14:12,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:14:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:14:12,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89530754] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:14:12,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:14:12,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-01-28 04:14:12,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483756641] [2023-01-28 04:14:12,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:14:12,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 04:14:12,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:14:12,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 04:14:12,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-01-28 04:14:12,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 04:14:12,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 2944 transitions, 70120 flow. Second operand has 12 states, 12 states have (on average 89.0) internal successors, (1068), 12 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:14:12,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:14:12,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 04:14:12,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-01-28 04:14:37,647 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 04:14:37,648 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 04:14:38,667 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 [2023-01-28 04:14:38,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-01-28 04:14:38,964 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 04:14:38,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-01-28 04:14:38,964 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-01-28 04:14:38,965 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-01-28 04:14:38,965 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 04:14:38,965 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 04:14:38,965 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-01-28 04:14:38,966 INFO L445 BasicCegarLoop]: Path program histogram: [10, 9, 9, 6, 4, 3, 1] [2023-01-28 04:14:38,967 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 04:14:38,967 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 04:14:38,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 04:14:38 BasicIcfg [2023-01-28 04:14:38,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 04:14:38,969 INFO L158 Benchmark]: Toolchain (without parser) took 830175.37ms. Allocated memory was 377.5MB in the beginning and 15.9GB in the end (delta: 15.5GB). Free memory was 317.6MB in the beginning and 9.3GB in the end (delta: -9.0GB). Peak memory consumption was 11.1GB. Max. memory is 16.0GB. [2023-01-28 04:14:38,969 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 377.5MB. Free memory is still 327.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 04:14:38,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.92ms. Allocated memory is still 377.5MB. Free memory was 317.3MB in the beginning and 306.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-28 04:14:38,970 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.80ms. Allocated memory is still 377.5MB. Free memory was 306.1MB in the beginning and 304.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 04:14:38,970 INFO L158 Benchmark]: Boogie Preprocessor took 41.30ms. Allocated memory is still 377.5MB. Free memory was 304.3MB in the beginning and 302.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 04:14:38,970 INFO L158 Benchmark]: RCFGBuilder took 426.22ms. Allocated memory was 377.5MB in the beginning and 543.2MB in the end (delta: 165.7MB). Free memory was 302.8MB in the beginning and 507.9MB in the end (delta: -205.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.0GB. [2023-01-28 04:14:38,970 INFO L158 Benchmark]: TraceAbstraction took 829452.18ms. Allocated memory was 543.2MB in the beginning and 15.9GB in the end (delta: 15.3GB). Free memory was 507.1MB in the beginning and 9.3GB in the end (delta: -8.8GB). Peak memory consumption was 11.1GB. Max. memory is 16.0GB. [2023-01-28 04:14:38,971 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.08ms. Allocated memory is still 377.5MB. Free memory is still 327.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 205.92ms. Allocated memory is still 377.5MB. Free memory was 317.3MB in the beginning and 306.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 35.80ms. Allocated memory is still 377.5MB. Free memory was 306.1MB in the beginning and 304.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.30ms. Allocated memory is still 377.5MB. Free memory was 304.3MB in the beginning and 302.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 426.22ms. Allocated memory was 377.5MB in the beginning and 543.2MB in the end (delta: 165.7MB). Free memory was 302.8MB in the beginning and 507.9MB in the end (delta: -205.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.0GB. * TraceAbstraction took 829452.18ms. Allocated memory was 543.2MB in the beginning and 15.9GB in the end (delta: 15.3GB). Free memory was 507.1MB in the beginning and 9.3GB in the end (delta: -8.8GB). Peak memory consumption was 11.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 108 PlacesBefore, 38 PlacesAfterwards, 104 TransitionsBefore, 29 TransitionsAfterwards, 2520 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 8 ConcurrentYvCompositions, 5 ChoiceCompositions, 82 TotalNumberOfCompositions, 2606 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2469, independent: 2462, independent conditional: 0, independent unconditional: 2462, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1329, independent: 1325, independent conditional: 0, independent unconditional: 1325, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2469, independent: 1137, independent conditional: 0, independent unconditional: 1137, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 1329, unknown conditional: 0, unknown unconditional: 1329] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 152 locations, 5 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: 829.3s, OverallIterations: 42, TraceHistogramMax: 2, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 817.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3239 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3239 mSDsluCounter, 505 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 320 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12217 IncrementalHoareTripleChecker+Invalid, 12329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 185 mSDtfsCounter, 12217 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1300 GetRequests, 944 SyntacticMatches, 30 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70120occurred in iteration=41, InterpolantAutomatonStates: 292, 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.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1575 NumberOfCodeBlocks, 1570 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 1962 ConstructedInterpolants, 0 QuantifiedInterpolants, 4587 SizeOfPredicates, 47 NumberOfNonLiveVariables, 3656 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 76 InterpolantComputations, 25 PerfectInterpolantSequences, 65/147 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown