/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 12:51:54,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 12:51:54,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 12:51:54,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 12:51:54,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 12:51:54,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 12:51:54,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 12:51:54,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 12:51:54,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 12:51:54,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 12:51:54,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 12:51:54,359 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 12:51:54,359 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 12:51:54,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 12:51:54,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 12:51:54,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 12:51:54,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 12:51:54,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 12:51:54,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 12:51:54,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 12:51:54,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 12:51:54,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 12:51:54,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 12:51:54,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 12:51:54,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 12:51:54,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 12:51:54,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 12:51:54,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 12:51:54,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 12:51:54,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 12:51:54,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 12:51:54,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 12:51:54,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 12:51:54,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 12:51:54,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 12:51:54,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 12:51:54,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 12:51:54,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 12:51:54,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 12:51:54,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 12:51:54,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 12:51:54,397 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-RepeatedSemanticLbe.epf [2021-03-25 12:51:54,429 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 12:51:54,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 12:51:54,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 12:51:54,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 12:51:54,433 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 12:51:54,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 12:51:54,434 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 12:51:54,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 12:51:54,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 12:51:54,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 12:51:54,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 12:51:54,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 12:51:54,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 12:51:54,436 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 12:51:54,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 12:51:54,436 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 12:51:54,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 12:51:54,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 12:51:54,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 12:51:54,437 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 12:51:54,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 12:51:54,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 12:51:54,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 12:51:54,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 12:51:54,438 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 12:51:54,438 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 12:51:54,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 12:51:54,438 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 12:51:54,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 12:51:54,438 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true 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 [2021-03-25 12:51:54,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 12:51:54,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 12:51:54,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 12:51:54,746 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 12:51:54,747 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 12:51:54,747 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i [2021-03-25 12:51:54,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f093a7cc/44e84ac039684ca19efb30b92671a4ae/FLAG210cd35b8 [2021-03-25 12:51:55,338 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 12:51:55,339 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i [2021-03-25 12:51:55,365 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f093a7cc/44e84ac039684ca19efb30b92671a4ae/FLAG210cd35b8 [2021-03-25 12:51:55,641 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f093a7cc/44e84ac039684ca19efb30b92671a4ae [2021-03-25 12:51:55,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 12:51:55,645 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 12:51:55,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 12:51:55,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 12:51:55,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 12:51:55,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 12:51:55" (1/1) ... [2021-03-25 12:51:55,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8ce18d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:51:55, skipping insertion in model container [2021-03-25 12:51:55,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 12:51:55" (1/1) ... [2021-03-25 12:51:55,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 12:51:55,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 12:51:55,912 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-25 12:51:56,152 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i[55568,55581] [2021-03-25 12:51:56,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 12:51:56,170 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 12:51:56,182 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-25 12:51:56,196 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i[55568,55581] [2021-03-25 12:51:56,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 12:51:56,363 INFO L208 MainTranslator]: Completed translation [2021-03-25 12:51:56,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:51:56 WrapperNode [2021-03-25 12:51:56,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 12:51:56,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 12:51:56,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 12:51:56,365 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 12:51:56,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:51:56" (1/1) ... [2021-03-25 12:51:56,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:51:56" (1/1) ... [2021-03-25 12:51:56,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 12:51:56,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 12:51:56,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 12:51:56,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 12:51:56,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:51:56" (1/1) ... [2021-03-25 12:51:56,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:51:56" (1/1) ... [2021-03-25 12:51:56,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:51:56" (1/1) ... [2021-03-25 12:51:56,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:51:56" (1/1) ... [2021-03-25 12:51:56,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:51:56" (1/1) ... [2021-03-25 12:51:56,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:51:56" (1/1) ... [2021-03-25 12:51:56,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:51:56" (1/1) ... [2021-03-25 12:51:56,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 12:51:56,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 12:51:56,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 12:51:56,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 12:51:56,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:51:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 12:51:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 12:51:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 12:51:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 12:51:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 12:51:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 12:51:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2021-03-25 12:51:56,486 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2021-03-25 12:51:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-25 12:51:56,486 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-25 12:51:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-25 12:51:56,486 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-25 12:51:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-25 12:51:56,486 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-25 12:51:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 12:51:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-03-25 12:51:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 12:51:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 12:51:56,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 12:51:56,488 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 12:51:56,940 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 12:51:56,940 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-03-25 12:51:56,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 12:51:56 BoogieIcfgContainer [2021-03-25 12:51:56,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 12:51:56,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 12:51:56,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 12:51:56,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 12:51:56,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 12:51:55" (1/3) ... [2021-03-25 12:51:56,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb19ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 12:51:56, skipping insertion in model container [2021-03-25 12:51:56,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:51:56" (2/3) ... [2021-03-25 12:51:56,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb19ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 12:51:56, skipping insertion in model container [2021-03-25 12:51:56,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 12:51:56" (3/3) ... [2021-03-25 12:51:56,948 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.i [2021-03-25 12:51:56,953 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 12:51:56,956 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-25 12:51:56,957 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 12:51:57,029 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,030 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,030 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,030 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,030 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,030 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,031 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,031 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,031 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,032 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,032 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,032 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,032 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,033 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,033 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,034 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,034 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,034 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,034 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,034 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,034 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,035 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,035 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,035 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,035 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,035 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,035 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,036 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,036 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,036 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,036 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,037 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,037 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,037 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,037 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,037 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,037 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,038 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,038 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,038 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,039 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,039 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,039 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,040 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,040 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,040 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,040 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,040 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,040 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,040 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,042 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,042 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,042 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,042 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,042 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,042 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,047 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,047 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,047 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,047 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,048 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,048 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,051 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,052 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,052 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,053 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,058 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,058 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,058 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,058 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,058 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,059 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,059 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,059 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,059 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,059 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,059 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,059 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,059 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,060 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,060 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,060 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,060 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,060 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,060 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,060 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,060 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,060 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,061 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,061 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,061 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,061 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,063 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,063 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,063 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,063 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,063 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,063 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,063 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,063 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,064 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,064 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,064 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,064 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,064 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,064 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,064 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,065 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,065 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,065 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,065 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,065 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,066 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,066 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,066 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,066 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,066 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,066 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,066 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,067 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,067 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,067 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,067 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,067 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,067 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,067 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,067 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,067 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,068 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,068 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,068 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,068 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,070 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,070 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,070 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,070 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,071 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,071 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,071 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,071 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,071 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,071 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,071 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,071 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,071 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,071 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,072 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,072 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,072 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,072 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,072 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,072 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,072 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,072 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,072 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,073 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,073 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,073 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,073 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,073 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,075 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,075 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,075 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,075 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,081 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,081 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,081 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,081 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,083 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,083 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,083 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,084 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,085 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,086 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,086 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,086 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,086 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,086 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,088 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,099 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,099 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,099 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,099 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,099 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,099 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,099 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,099 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,099 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,104 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,104 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,104 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,104 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,106 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,106 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,106 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,106 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,106 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,107 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,108 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,108 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,108 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,109 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,112 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,113 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,113 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,113 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,115 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,115 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,115 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,116 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,118 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,118 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,118 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,118 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:51:57,268 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2021-03-25 12:51:57,281 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-03-25 12:51:57,301 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 12:51:57,301 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 12:51:57,301 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 12:51:57,301 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 12:51:57,301 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 12:51:57,301 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 12:51:57,301 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 12:51:57,301 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 12:51:57,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 255 transitions, 890 flow [2021-03-25 12:51:57,384 INFO L129 PetriNetUnfolder]: 67/316 cut-off events. [2021-03-25 12:51:57,384 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-03-25 12:51:57,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 316 events. 67/316 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 995 event pairs, 0 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 365. Up to 24 conditions per place. [2021-03-25 12:51:57,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 255 transitions, 890 flow [2021-03-25 12:51:57,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 147 transitions, 447 flow [2021-03-25 12:51:57,400 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:51:57,408 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 147 transitions, 447 flow [2021-03-25 12:51:57,411 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 147 transitions, 447 flow [2021-03-25 12:51:57,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 147 transitions, 447 flow [2021-03-25 12:51:57,479 INFO L129 PetriNetUnfolder]: 67/316 cut-off events. [2021-03-25 12:51:57,479 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-03-25 12:51:57,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 316 events. 67/316 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 983 event pairs, 0 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 365. Up to 24 conditions per place. [2021-03-25 12:51:57,494 INFO L142 LiptonReduction]: Number of co-enabled transitions 4982 [2021-03-25 12:52:00,397 INFO L154 LiptonReduction]: Checked pairs total: 2660 [2021-03-25 12:52:00,397 INFO L156 LiptonReduction]: Total number of compositions: 70 [2021-03-25 12:52:00,399 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3000 [2021-03-25 12:52:00,407 INFO L129 PetriNetUnfolder]: 2/21 cut-off events. [2021-03-25 12:52:00,407 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 12:52:00,408 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:00,408 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:00,408 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:00,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:00,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1880774221, now seen corresponding path program 1 times [2021-03-25 12:52:00,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:00,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814907064] [2021-03-25 12:52:00,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:00,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:00,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:00,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:00,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:52:00,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:00,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:52:00,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:00,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:52:00,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:00,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:52:00,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:00,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:00,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:00,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:00,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814907064] [2021-03-25 12:52:00,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:00,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 12:52:00,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441573691] [2021-03-25 12:52:00,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 12:52:00,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:00,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 12:52:00,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 12:52:00,750 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 336 [2021-03-25 12:52:00,754 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 85 transitions, 323 flow. Second operand has 7 states, 7 states have (on average 193.71428571428572) internal successors, (1356), 7 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:00,754 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:00,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 336 [2021-03-25 12:52:00,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:01,572 INFO L129 PetriNetUnfolder]: 3307/4976 cut-off events. [2021-03-25 12:52:01,572 INFO L130 PetriNetUnfolder]: For 1440/1445 co-relation queries the response was YES. [2021-03-25 12:52:01,589 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10444 conditions, 4976 events. 3307/4976 cut-off events. For 1440/1445 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 26754 event pairs, 1751 based on Foata normal form. 121/3980 useless extension candidates. Maximal degree in co-relation 10407. Up to 2724 conditions per place. [2021-03-25 12:52:01,619 INFO L132 encePairwiseOnDemand]: 325/336 looper letters, 69 selfloop transitions, 7 changer transitions 4/121 dead transitions. [2021-03-25 12:52:01,620 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 121 transitions, 588 flow [2021-03-25 12:52:01,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 12:52:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 12:52:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1620 transitions. [2021-03-25 12:52:01,638 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6026785714285714 [2021-03-25 12:52:01,638 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1620 transitions. [2021-03-25 12:52:01,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1620 transitions. [2021-03-25 12:52:01,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:01,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1620 transitions. [2021-03-25 12:52:01,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 202.5) internal successors, (1620), 8 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:01,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 336.0) internal successors, (3024), 9 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:01,661 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 336.0) internal successors, (3024), 9 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:01,663 INFO L185 Difference]: Start difference. First operand has 64 places, 85 transitions, 323 flow. Second operand 8 states and 1620 transitions. [2021-03-25 12:52:01,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 121 transitions, 588 flow [2021-03-25 12:52:01,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 121 transitions, 464 flow, removed 0 selfloop flow, removed 12 redundant places. [2021-03-25 12:52:01,679 INFO L241 Difference]: Finished difference. Result has 62 places, 86 transitions, 256 flow [2021-03-25 12:52:01,681 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=256, PETRI_PLACES=62, PETRI_TRANSITIONS=86} [2021-03-25 12:52:01,681 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2021-03-25 12:52:01,682 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:01,682 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 86 transitions, 256 flow [2021-03-25 12:52:01,683 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 86 transitions, 256 flow [2021-03-25 12:52:01,683 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 86 transitions, 256 flow [2021-03-25 12:52:01,703 INFO L129 PetriNetUnfolder]: 115/277 cut-off events. [2021-03-25 12:52:01,703 INFO L130 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2021-03-25 12:52:01,704 INFO L84 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 277 events. 115/277 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 883 event pairs, 1 based on Foata normal form. 1/196 useless extension candidates. Maximal degree in co-relation 320. Up to 48 conditions per place. [2021-03-25 12:52:01,707 INFO L142 LiptonReduction]: Number of co-enabled transitions 1484 [2021-03-25 12:52:02,177 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-03-25 12:52:02,282 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-03-25 12:52:02,394 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-03-25 12:52:02,508 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-03-25 12:52:02,810 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2021-03-25 12:52:03,010 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2021-03-25 12:52:03,423 INFO L154 LiptonReduction]: Checked pairs total: 323 [2021-03-25 12:52:03,423 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 12:52:03,423 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1741 [2021-03-25 12:52:03,424 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 75 transitions, 234 flow [2021-03-25 12:52:03,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 193.71428571428572) internal successors, (1356), 7 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:03,425 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:03,425 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:03,426 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 12:52:03,426 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:03,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:03,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1911423025, now seen corresponding path program 1 times [2021-03-25 12:52:03,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:03,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607198371] [2021-03-25 12:52:03,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:03,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:03,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:03,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:03,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:52:03,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:03,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:52:03,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:03,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:03,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:03,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:03,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607198371] [2021-03-25 12:52:03,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:03,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 12:52:03,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398249730] [2021-03-25 12:52:03,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 12:52:03,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:03,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 12:52:03,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 12:52:03,530 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 348 [2021-03-25 12:52:03,532 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 75 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 236.6) internal successors, (1183), 5 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:03,532 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:03,532 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 348 [2021-03-25 12:52:03,532 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:03,993 INFO L129 PetriNetUnfolder]: 4056/5694 cut-off events. [2021-03-25 12:52:03,993 INFO L130 PetriNetUnfolder]: For 1025/1025 co-relation queries the response was YES. [2021-03-25 12:52:04,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10629 conditions, 5694 events. 4056/5694 cut-off events. For 1025/1025 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 26293 event pairs, 1893 based on Foata normal form. 2/4271 useless extension candidates. Maximal degree in co-relation 9570. Up to 3235 conditions per place. [2021-03-25 12:52:04,032 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 58 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2021-03-25 12:52:04,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 103 transitions, 442 flow [2021-03-25 12:52:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 12:52:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 12:52:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1473 transitions. [2021-03-25 12:52:04,037 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7054597701149425 [2021-03-25 12:52:04,037 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1473 transitions. [2021-03-25 12:52:04,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1473 transitions. [2021-03-25 12:52:04,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:04,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1473 transitions. [2021-03-25 12:52:04,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 245.5) internal successors, (1473), 6 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:04,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 348.0) internal successors, (2436), 7 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:04,045 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 348.0) internal successors, (2436), 7 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:04,048 INFO L185 Difference]: Start difference. First operand has 50 places, 75 transitions, 234 flow. Second operand 6 states and 1473 transitions. [2021-03-25 12:52:04,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 103 transitions, 442 flow [2021-03-25 12:52:04,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 103 transitions, 429 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-03-25 12:52:04,056 INFO L241 Difference]: Finished difference. Result has 54 places, 79 transitions, 269 flow [2021-03-25 12:52:04,056 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=54, PETRI_TRANSITIONS=79} [2021-03-25 12:52:04,056 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, -10 predicate places. [2021-03-25 12:52:04,057 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:04,057 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 79 transitions, 269 flow [2021-03-25 12:52:04,057 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 79 transitions, 269 flow [2021-03-25 12:52:04,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 79 transitions, 269 flow [2021-03-25 12:52:04,084 INFO L129 PetriNetUnfolder]: 223/447 cut-off events. [2021-03-25 12:52:04,085 INFO L130 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2021-03-25 12:52:04,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 447 events. 223/447 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1599 event pairs, 1 based on Foata normal form. 1/304 useless extension candidates. Maximal degree in co-relation 403. Up to 96 conditions per place. [2021-03-25 12:52:04,089 INFO L142 LiptonReduction]: Number of co-enabled transitions 1154 [2021-03-25 12:52:04,092 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:04,092 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:04,092 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-25 12:52:04,094 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 79 transitions, 269 flow [2021-03-25 12:52:04,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 236.6) internal successors, (1183), 5 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:04,094 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:04,095 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:04,095 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 12:52:04,095 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:04,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:04,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1741067560, now seen corresponding path program 1 times [2021-03-25 12:52:04,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:04,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555131507] [2021-03-25 12:52:04,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:04,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:04,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:52:04,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:04,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:52:04,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:04,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:52:04,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:04,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:04,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:04,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:04,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:04,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555131507] [2021-03-25 12:52:04,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:04,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 12:52:04,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925240192] [2021-03-25 12:52:04,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 12:52:04,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:04,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 12:52:04,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 12:52:04,178 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 348 [2021-03-25 12:52:04,180 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 79 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:04,180 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:04,180 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 348 [2021-03-25 12:52:04,180 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:04,754 INFO L129 PetriNetUnfolder]: 4974/6927 cut-off events. [2021-03-25 12:52:04,754 INFO L130 PetriNetUnfolder]: For 1741/1741 co-relation queries the response was YES. [2021-03-25 12:52:04,773 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13252 conditions, 6927 events. 4974/6927 cut-off events. For 1741/1741 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 32634 event pairs, 2253 based on Foata normal form. 2/5164 useless extension candidates. Maximal degree in co-relation 10922. Up to 2520 conditions per place. [2021-03-25 12:52:04,806 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 82 selfloop transitions, 12 changer transitions 0/131 dead transitions. [2021-03-25 12:52:04,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 131 transitions, 588 flow [2021-03-25 12:52:04,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:52:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:52:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1457 transitions. [2021-03-25 12:52:04,810 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5981116584564861 [2021-03-25 12:52:04,810 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1457 transitions. [2021-03-25 12:52:04,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1457 transitions. [2021-03-25 12:52:04,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:04,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1457 transitions. [2021-03-25 12:52:04,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 208.14285714285714) internal successors, (1457), 7 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:04,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:04,819 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:04,819 INFO L185 Difference]: Start difference. First operand has 54 places, 79 transitions, 269 flow. Second operand 7 states and 1457 transitions. [2021-03-25 12:52:04,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 131 transitions, 588 flow [2021-03-25 12:52:04,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 131 transitions, 577 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-25 12:52:04,827 INFO L241 Difference]: Finished difference. Result has 61 places, 81 transitions, 311 flow [2021-03-25 12:52:04,827 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=61, PETRI_TRANSITIONS=81} [2021-03-25 12:52:04,828 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2021-03-25 12:52:04,828 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:04,828 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 81 transitions, 311 flow [2021-03-25 12:52:04,829 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 81 transitions, 311 flow [2021-03-25 12:52:04,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 81 transitions, 311 flow [2021-03-25 12:52:04,849 INFO L129 PetriNetUnfolder]: 230/457 cut-off events. [2021-03-25 12:52:04,849 INFO L130 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2021-03-25 12:52:04,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 457 events. 230/457 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1646 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 400. Up to 96 conditions per place. [2021-03-25 12:52:04,854 INFO L142 LiptonReduction]: Number of co-enabled transitions 1222 [2021-03-25 12:52:04,857 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:04,857 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:04,857 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29 [2021-03-25 12:52:04,860 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 81 transitions, 311 flow [2021-03-25 12:52:04,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:04,861 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:04,861 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:04,861 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 12:52:04,861 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:04,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:04,862 INFO L82 PathProgramCache]: Analyzing trace with hash -742337810, now seen corresponding path program 1 times [2021-03-25 12:52:04,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:04,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208798934] [2021-03-25 12:52:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:04,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:04,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:04,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:04,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:52:04,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:04,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:04,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208798934] [2021-03-25 12:52:04,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:04,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 12:52:04,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284072932] [2021-03-25 12:52:04,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 12:52:04,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:04,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 12:52:04,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 12:52:04,927 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 348 [2021-03-25 12:52:04,928 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 81 transitions, 311 flow. Second operand has 4 states, 4 states have (on average 261.25) internal successors, (1045), 4 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:04,928 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:04,928 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 348 [2021-03-25 12:52:04,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:05,556 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][33], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 210#true, Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 42#L1156-1true, 125#L1164-2true, Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-25 12:52:05,557 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,557 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,557 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,557 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,557 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][32], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 210#true, 226#true, Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 42#L1156-1true, 125#L1164-2true, Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-25 12:52:05,557 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,558 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,558 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,558 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,558 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][35], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 210#true, 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 42#L1156-1true, 125#L1164-2true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5)]) [2021-03-25 12:52:05,558 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,558 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,558 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,558 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,559 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][34], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 210#true, 226#true, Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 42#L1156-1true, 125#L1164-2true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5)]) [2021-03-25 12:52:05,559 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,559 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,559 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,559 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,559 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][36], [Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 210#true, Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 42#L1156-1true, 125#L1164-2true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5)]) [2021-03-25 12:52:05,559 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,559 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,560 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,560 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,560 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][42], [Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 226#true, 210#true, Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 42#L1156-1true, 125#L1164-2true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5)]) [2021-03-25 12:52:05,560 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,560 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,560 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,560 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:05,561 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][31], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), 210#true, Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 42#L1156-1true, 125#L1164-2true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5)]) [2021-03-25 12:52:05,561 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-03-25 12:52:05,561 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 12:52:05,561 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 12:52:05,561 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 12:52:05,561 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][30], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 210#true, 226#true, 42#L1156-1true, 125#L1164-2true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5)]) [2021-03-25 12:52:05,562 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-03-25 12:52:05,562 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 12:52:05,562 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 12:52:05,562 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 12:52:05,566 INFO L129 PetriNetUnfolder]: 5344/7964 cut-off events. [2021-03-25 12:52:05,566 INFO L130 PetriNetUnfolder]: For 6145/6145 co-relation queries the response was YES. [2021-03-25 12:52:05,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17336 conditions, 7964 events. 5344/7964 cut-off events. For 6145/6145 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 45349 event pairs, 563 based on Foata normal form. 0/6058 useless extension candidates. Maximal degree in co-relation 11827. Up to 2435 conditions per place. [2021-03-25 12:52:05,702 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 48 selfloop transitions, 20 changer transitions 2/122 dead transitions. [2021-03-25 12:52:05,702 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 122 transitions, 561 flow [2021-03-25 12:52:05,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 12:52:05,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 12:52:05,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1355 transitions. [2021-03-25 12:52:05,705 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7787356321839081 [2021-03-25 12:52:05,705 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1355 transitions. [2021-03-25 12:52:05,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1355 transitions. [2021-03-25 12:52:05,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:05,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1355 transitions. [2021-03-25 12:52:05,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:05,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:05,713 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:05,713 INFO L185 Difference]: Start difference. First operand has 61 places, 81 transitions, 311 flow. Second operand 5 states and 1355 transitions. [2021-03-25 12:52:05,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 122 transitions, 561 flow [2021-03-25 12:52:05,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 122 transitions, 540 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-03-25 12:52:05,722 INFO L241 Difference]: Finished difference. Result has 67 places, 101 transitions, 476 flow [2021-03-25 12:52:05,722 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=476, PETRI_PLACES=67, PETRI_TRANSITIONS=101} [2021-03-25 12:52:05,722 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2021-03-25 12:52:05,723 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:05,723 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 101 transitions, 476 flow [2021-03-25 12:52:05,723 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 101 transitions, 476 flow [2021-03-25 12:52:05,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 101 transitions, 476 flow [2021-03-25 12:52:05,893 INFO L129 PetriNetUnfolder]: 1882/3330 cut-off events. [2021-03-25 12:52:05,893 INFO L130 PetriNetUnfolder]: For 2071/2091 co-relation queries the response was YES. [2021-03-25 12:52:05,908 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6156 conditions, 3330 events. 1882/3330 cut-off events. For 2071/2091 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 21593 event pairs, 113 based on Foata normal form. 14/2316 useless extension candidates. Maximal degree in co-relation 4729. Up to 680 conditions per place. [2021-03-25 12:52:05,937 INFO L142 LiptonReduction]: Number of co-enabled transitions 1914 [2021-03-25 12:52:05,943 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:05,943 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:05,943 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 220 [2021-03-25 12:52:05,947 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 101 transitions, 476 flow [2021-03-25 12:52:05,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 261.25) internal successors, (1045), 4 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:05,947 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:05,947 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:05,947 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 12:52:05,948 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:05,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:05,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1604078752, now seen corresponding path program 1 times [2021-03-25 12:52:05,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:05,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007681274] [2021-03-25 12:52:05,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:05,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:05,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:52:06,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:06,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:52:06,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:06,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:06,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:06,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:06,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:06,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007681274] [2021-03-25 12:52:06,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:06,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 12:52:06,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816759692] [2021-03-25 12:52:06,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 12:52:06,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:06,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 12:52:06,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 12:52:06,019 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 348 [2021-03-25 12:52:06,020 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 101 transitions, 476 flow. Second operand has 5 states, 5 states have (on average 236.2) internal successors, (1181), 5 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:06,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:06,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 348 [2021-03-25 12:52:06,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:07,046 INFO L129 PetriNetUnfolder]: 9107/12595 cut-off events. [2021-03-25 12:52:07,046 INFO L130 PetriNetUnfolder]: For 15561/15783 co-relation queries the response was YES. [2021-03-25 12:52:07,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34280 conditions, 12595 events. 9107/12595 cut-off events. For 15561/15783 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 64879 event pairs, 2026 based on Foata normal form. 74/9356 useless extension candidates. Maximal degree in co-relation 27212. Up to 8670 conditions per place. [2021-03-25 12:52:07,143 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 95 selfloop transitions, 7 changer transitions 0/137 dead transitions. [2021-03-25 12:52:07,143 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 137 transitions, 827 flow [2021-03-25 12:52:07,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 12:52:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 12:52:07,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1475 transitions. [2021-03-25 12:52:07,147 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7064176245210728 [2021-03-25 12:52:07,147 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1475 transitions. [2021-03-25 12:52:07,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1475 transitions. [2021-03-25 12:52:07,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:07,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1475 transitions. [2021-03-25 12:52:07,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 245.83333333333334) internal successors, (1475), 6 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:07,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 348.0) internal successors, (2436), 7 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:07,153 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 348.0) internal successors, (2436), 7 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:07,153 INFO L185 Difference]: Start difference. First operand has 67 places, 101 transitions, 476 flow. Second operand 6 states and 1475 transitions. [2021-03-25 12:52:07,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 137 transitions, 827 flow [2021-03-25 12:52:07,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 137 transitions, 827 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 12:52:07,170 INFO L241 Difference]: Finished difference. Result has 74 places, 102 transitions, 504 flow [2021-03-25 12:52:07,170 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=74, PETRI_TRANSITIONS=102} [2021-03-25 12:52:07,171 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 10 predicate places. [2021-03-25 12:52:07,171 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:07,171 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 102 transitions, 504 flow [2021-03-25 12:52:07,171 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 102 transitions, 504 flow [2021-03-25 12:52:07,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 102 transitions, 504 flow [2021-03-25 12:52:07,469 INFO L129 PetriNetUnfolder]: 1910/3387 cut-off events. [2021-03-25 12:52:07,470 INFO L130 PetriNetUnfolder]: For 2203/2227 co-relation queries the response was YES. [2021-03-25 12:52:07,487 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6332 conditions, 3387 events. 1910/3387 cut-off events. For 2203/2227 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 22165 event pairs, 112 based on Foata normal form. 18/2362 useless extension candidates. Maximal degree in co-relation 4319. Up to 714 conditions per place. [2021-03-25 12:52:07,519 INFO L142 LiptonReduction]: Number of co-enabled transitions 1910 [2021-03-25 12:52:07,524 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:07,524 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:07,524 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 353 [2021-03-25 12:52:07,526 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 102 transitions, 504 flow [2021-03-25 12:52:07,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 236.2) internal successors, (1181), 5 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:07,527 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:07,527 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:07,527 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 12:52:07,527 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:07,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:07,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1535794226, now seen corresponding path program 2 times [2021-03-25 12:52:07,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:07,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332146577] [2021-03-25 12:52:07,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:07,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:07,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:52:07,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:07,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 12:52:07,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:07,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:52:07,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:07,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:07,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:07,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:07,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:07,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332146577] [2021-03-25 12:52:07,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:07,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 12:52:07,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234683389] [2021-03-25 12:52:07,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 12:52:07,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:07,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 12:52:07,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 12:52:07,618 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 348 [2021-03-25 12:52:07,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 102 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 194.16666666666666) internal successors, (1165), 6 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:07,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:07,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 348 [2021-03-25 12:52:07,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:08,710 INFO L129 PetriNetUnfolder]: 8856/12256 cut-off events. [2021-03-25 12:52:08,711 INFO L130 PetriNetUnfolder]: For 16838/17054 co-relation queries the response was YES. [2021-03-25 12:52:08,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34028 conditions, 12256 events. 8856/12256 cut-off events. For 16838/17054 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 62749 event pairs, 2030 based on Foata normal form. 150/9224 useless extension candidates. Maximal degree in co-relation 25751. Up to 5431 conditions per place. [2021-03-25 12:52:08,791 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 90 selfloop transitions, 17 changer transitions 0/139 dead transitions. [2021-03-25 12:52:08,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 139 transitions, 864 flow [2021-03-25 12:52:08,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 12:52:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 12:52:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1613 transitions. [2021-03-25 12:52:08,795 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.579382183908046 [2021-03-25 12:52:08,795 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1613 transitions. [2021-03-25 12:52:08,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1613 transitions. [2021-03-25 12:52:08,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:08,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1613 transitions. [2021-03-25 12:52:08,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 201.625) internal successors, (1613), 8 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:08,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:08,803 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:08,803 INFO L185 Difference]: Start difference. First operand has 74 places, 102 transitions, 504 flow. Second operand 8 states and 1613 transitions. [2021-03-25 12:52:08,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 139 transitions, 864 flow [2021-03-25 12:52:08,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 139 transitions, 852 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 12:52:08,819 INFO L241 Difference]: Finished difference. Result has 79 places, 103 transitions, 549 flow [2021-03-25 12:52:08,819 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=549, PETRI_PLACES=79, PETRI_TRANSITIONS=103} [2021-03-25 12:52:08,820 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 15 predicate places. [2021-03-25 12:52:08,820 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:08,820 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 103 transitions, 549 flow [2021-03-25 12:52:08,820 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 103 transitions, 549 flow [2021-03-25 12:52:08,821 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 103 transitions, 549 flow [2021-03-25 12:52:09,049 INFO L129 PetriNetUnfolder]: 1786/3207 cut-off events. [2021-03-25 12:52:09,050 INFO L130 PetriNetUnfolder]: For 2415/2435 co-relation queries the response was YES. [2021-03-25 12:52:09,063 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6261 conditions, 3207 events. 1786/3207 cut-off events. For 2415/2435 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 21125 event pairs, 113 based on Foata normal form. 14/2239 useless extension candidates. Maximal degree in co-relation 4243. Up to 680 conditions per place. [2021-03-25 12:52:09,091 INFO L142 LiptonReduction]: Number of co-enabled transitions 1902 [2021-03-25 12:52:09,096 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:09,096 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:09,096 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 276 [2021-03-25 12:52:09,101 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 103 transitions, 549 flow [2021-03-25 12:52:09,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 194.16666666666666) internal successors, (1165), 6 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:09,101 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:09,101 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:09,101 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 12:52:09,102 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:09,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:09,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1516767050, now seen corresponding path program 3 times [2021-03-25 12:52:09,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:09,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866551947] [2021-03-25 12:52:09,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:09,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:09,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:09,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:09,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 12:52:09,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:09,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:09,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:09,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:52:09,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:09,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:52:09,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:09,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:09,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866551947] [2021-03-25 12:52:09,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:09,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 12:52:09,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764322183] [2021-03-25 12:52:09,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 12:52:09,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:09,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 12:52:09,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 12:52:09,187 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 348 [2021-03-25 12:52:09,189 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 103 transitions, 549 flow. Second operand has 7 states, 7 states have (on average 237.57142857142858) internal successors, (1663), 7 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:09,189 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:09,189 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 348 [2021-03-25 12:52:09,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:09,787 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][51], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 226#true, Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), 42#L1156-1true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 245#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 249#true, 125#L1164-2true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-25 12:52:09,788 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:09,788 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:09,788 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:09,788 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:09,800 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][35], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 226#true, 42#L1156-1true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 245#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 249#true, 125#L1164-2true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-25 12:52:09,800 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:09,800 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:09,800 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:09,800 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:09,820 INFO L129 PetriNetUnfolder]: 5329/8061 cut-off events. [2021-03-25 12:52:09,820 INFO L130 PetriNetUnfolder]: For 15980/16324 co-relation queries the response was YES. [2021-03-25 12:52:09,844 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24474 conditions, 8061 events. 5329/8061 cut-off events. For 15980/16324 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 47262 event pairs, 475 based on Foata normal form. 240/6583 useless extension candidates. Maximal degree in co-relation 17998. Up to 2472 conditions per place. [2021-03-25 12:52:09,885 INFO L132 encePairwiseOnDemand]: 336/348 looper letters, 56 selfloop transitions, 34 changer transitions 10/152 dead transitions. [2021-03-25 12:52:09,886 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 152 transitions, 1040 flow [2021-03-25 12:52:09,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:52:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:52:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2196 transitions. [2021-03-25 12:52:09,891 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7011494252873564 [2021-03-25 12:52:09,891 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2196 transitions. [2021-03-25 12:52:09,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2196 transitions. [2021-03-25 12:52:09,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:09,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2196 transitions. [2021-03-25 12:52:09,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:09,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:09,903 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:09,903 INFO L185 Difference]: Start difference. First operand has 79 places, 103 transitions, 549 flow. Second operand 9 states and 2196 transitions. [2021-03-25 12:52:09,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 152 transitions, 1040 flow [2021-03-25 12:52:09,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 152 transitions, 995 flow, removed 3 selfloop flow, removed 7 redundant places. [2021-03-25 12:52:09,918 INFO L241 Difference]: Finished difference. Result has 83 places, 115 transitions, 726 flow [2021-03-25 12:52:09,919 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=726, PETRI_PLACES=83, PETRI_TRANSITIONS=115} [2021-03-25 12:52:09,919 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 19 predicate places. [2021-03-25 12:52:09,919 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:09,919 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 115 transitions, 726 flow [2021-03-25 12:52:09,919 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 115 transitions, 726 flow [2021-03-25 12:52:09,920 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 115 transitions, 726 flow [2021-03-25 12:52:10,106 INFO L129 PetriNetUnfolder]: 1947/3603 cut-off events. [2021-03-25 12:52:10,107 INFO L130 PetriNetUnfolder]: For 4715/4757 co-relation queries the response was YES. [2021-03-25 12:52:10,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7842 conditions, 3603 events. 1947/3603 cut-off events. For 4715/4757 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 25044 event pairs, 74 based on Foata normal form. 18/2540 useless extension candidates. Maximal degree in co-relation 5743. Up to 776 conditions per place. [2021-03-25 12:52:10,144 INFO L142 LiptonReduction]: Number of co-enabled transitions 2076 [2021-03-25 12:52:10,149 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:10,150 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:10,150 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 231 [2021-03-25 12:52:10,150 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 115 transitions, 726 flow [2021-03-25 12:52:10,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 237.57142857142858) internal successors, (1663), 7 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:10,151 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:10,151 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:10,151 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 12:52:10,151 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:10,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:10,151 INFO L82 PathProgramCache]: Analyzing trace with hash -739810455, now seen corresponding path program 1 times [2021-03-25 12:52:10,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:10,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508807822] [2021-03-25 12:52:10,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:10,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:10,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:10,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:10,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:52:10,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:10,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508807822] [2021-03-25 12:52:10,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:10,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 12:52:10,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115827191] [2021-03-25 12:52:10,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 12:52:10,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:10,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 12:52:10,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 12:52:10,176 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 348 [2021-03-25 12:52:10,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 115 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:10,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:10,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 348 [2021-03-25 12:52:10,177 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:10,853 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][32], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 226#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), 42#L1156-1true, Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), 125#L1164-2true, Black: 280#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), 287#true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-25 12:52:10,853 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:10,853 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:10,853 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:10,853 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:10,854 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][56], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 226#true, Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), 42#L1156-1true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), 125#L1164-2true, Black: 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 280#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-25 12:52:10,854 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:10,854 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:10,854 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:10,854 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:10,861 INFO L129 PetriNetUnfolder]: 6059/9083 cut-off events. [2021-03-25 12:52:10,861 INFO L130 PetriNetUnfolder]: For 34721/35262 co-relation queries the response was YES. [2021-03-25 12:52:10,884 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30870 conditions, 9083 events. 6059/9083 cut-off events. For 34721/35262 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 52876 event pairs, 752 based on Foata normal form. 84/7080 useless extension candidates. Maximal degree in co-relation 24444. Up to 4318 conditions per place. [2021-03-25 12:52:10,921 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 67 selfloop transitions, 16 changer transitions 1/137 dead transitions. [2021-03-25 12:52:10,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 137 transitions, 1067 flow [2021-03-25 12:52:10,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 12:52:10,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 12:52:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2021-03-25 12:52:10,924 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8132183908045977 [2021-03-25 12:52:10,924 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 849 transitions. [2021-03-25 12:52:10,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 849 transitions. [2021-03-25 12:52:10,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:10,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 849 transitions. [2021-03-25 12:52:10,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:10,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:10,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:10,928 INFO L185 Difference]: Start difference. First operand has 81 places, 115 transitions, 726 flow. Second operand 3 states and 849 transitions. [2021-03-25 12:52:10,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 137 transitions, 1067 flow [2021-03-25 12:52:10,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 137 transitions, 1061 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 12:52:10,964 INFO L241 Difference]: Finished difference. Result has 82 places, 124 transitions, 880 flow [2021-03-25 12:52:10,964 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=82, PETRI_TRANSITIONS=124} [2021-03-25 12:52:10,964 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 18 predicate places. [2021-03-25 12:52:10,964 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:10,964 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 124 transitions, 880 flow [2021-03-25 12:52:10,965 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 124 transitions, 880 flow [2021-03-25 12:52:10,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 124 transitions, 880 flow [2021-03-25 12:52:11,166 INFO L129 PetriNetUnfolder]: 2136/3904 cut-off events. [2021-03-25 12:52:11,167 INFO L130 PetriNetUnfolder]: For 7108/7218 co-relation queries the response was YES. [2021-03-25 12:52:11,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9435 conditions, 3904 events. 2136/3904 cut-off events. For 7108/7218 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 27562 event pairs, 66 based on Foata normal form. 30/2840 useless extension candidates. Maximal degree in co-relation 6775. Up to 832 conditions per place. [2021-03-25 12:52:11,211 INFO L142 LiptonReduction]: Number of co-enabled transitions 2306 [2021-03-25 12:52:11,217 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:11,217 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:11,217 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 253 [2021-03-25 12:52:11,218 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 124 transitions, 880 flow [2021-03-25 12:52:11,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:11,218 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:11,218 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:11,218 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 12:52:11,218 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:11,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:11,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1459289047, now seen corresponding path program 1 times [2021-03-25 12:52:11,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:11,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45892834] [2021-03-25 12:52:11,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:11,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:11,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:52:11,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:11,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 12:52:11,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:11,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:52:11,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:11,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:11,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:11,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:11,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:11,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45892834] [2021-03-25 12:52:11,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:11,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 12:52:11,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983704240] [2021-03-25 12:52:11,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 12:52:11,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:11,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 12:52:11,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 12:52:11,275 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 348 [2021-03-25 12:52:11,277 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 124 transitions, 880 flow. Second operand has 6 states, 6 states have (on average 194.33333333333334) internal successors, (1166), 6 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:11,277 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:11,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 348 [2021-03-25 12:52:11,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:12,259 INFO L129 PetriNetUnfolder]: 8862/12412 cut-off events. [2021-03-25 12:52:12,259 INFO L130 PetriNetUnfolder]: For 50299/51113 co-relation queries the response was YES. [2021-03-25 12:52:12,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44959 conditions, 12412 events. 8862/12412 cut-off events. For 50299/51113 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 66345 event pairs, 1911 based on Foata normal form. 281/9913 useless extension candidates. Maximal degree in co-relation 36825. Up to 6340 conditions per place. [2021-03-25 12:52:12,330 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 104 selfloop transitions, 16 changer transitions 18/166 dead transitions. [2021-03-25 12:52:12,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 166 transitions, 1413 flow [2021-03-25 12:52:12,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 12:52:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 12:52:12,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1610 transitions. [2021-03-25 12:52:12,335 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5783045977011494 [2021-03-25 12:52:12,335 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1610 transitions. [2021-03-25 12:52:12,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1610 transitions. [2021-03-25 12:52:12,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:12,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1610 transitions. [2021-03-25 12:52:12,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 201.25) internal successors, (1610), 8 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:12,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:12,343 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:12,343 INFO L185 Difference]: Start difference. First operand has 82 places, 124 transitions, 880 flow. Second operand 8 states and 1610 transitions. [2021-03-25 12:52:12,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 166 transitions, 1413 flow [2021-03-25 12:52:12,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 166 transitions, 1389 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 12:52:12,425 INFO L241 Difference]: Finished difference. Result has 90 places, 113 transitions, 852 flow [2021-03-25 12:52:12,425 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=852, PETRI_PLACES=90, PETRI_TRANSITIONS=113} [2021-03-25 12:52:12,425 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 26 predicate places. [2021-03-25 12:52:12,425 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:12,426 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 113 transitions, 852 flow [2021-03-25 12:52:12,426 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 113 transitions, 852 flow [2021-03-25 12:52:12,427 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 113 transitions, 852 flow [2021-03-25 12:52:12,635 INFO L129 PetriNetUnfolder]: 2030/3789 cut-off events. [2021-03-25 12:52:12,636 INFO L130 PetriNetUnfolder]: For 6954/7347 co-relation queries the response was YES. [2021-03-25 12:52:12,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8919 conditions, 3789 events. 2030/3789 cut-off events. For 6954/7347 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 27227 event pairs, 62 based on Foata normal form. 40/2762 useless extension candidates. Maximal degree in co-relation 6574. Up to 884 conditions per place. [2021-03-25 12:52:12,681 INFO L142 LiptonReduction]: Number of co-enabled transitions 2216 [2021-03-25 12:52:12,688 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:12,688 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:12,688 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 263 [2021-03-25 12:52:12,688 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 113 transitions, 852 flow [2021-03-25 12:52:12,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 194.33333333333334) internal successors, (1166), 6 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:12,689 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:12,689 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:12,689 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 12:52:12,689 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:12,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:12,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1370679130, now seen corresponding path program 1 times [2021-03-25 12:52:12,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:12,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778097612] [2021-03-25 12:52:12,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:12,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:12,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:12,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:12,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 12:52:12,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:12,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:12,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:12,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:52:12,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:12,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:52:12,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:12,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:12,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778097612] [2021-03-25 12:52:12,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:12,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 12:52:12,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477643413] [2021-03-25 12:52:12,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 12:52:12,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:12,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 12:52:12,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 12:52:12,755 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 348 [2021-03-25 12:52:12,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 113 transitions, 852 flow. Second operand has 7 states, 7 states have (on average 236.71428571428572) internal successors, (1657), 7 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:12,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:12,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 348 [2021-03-25 12:52:12,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:13,531 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][53], [Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 280#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 226#true, 292#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), 42#L1156-1true, Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 125#L1164-2true, 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|))]) [2021-03-25 12:52:13,531 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:13,531 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:13,531 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:13,531 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:13,537 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][35], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 292#true, 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 226#true, 42#L1156-1true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), 125#L1164-2true, Black: 280#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-25 12:52:13,537 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:13,538 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:13,538 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:13,538 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:13,540 INFO L129 PetriNetUnfolder]: 5708/8764 cut-off events. [2021-03-25 12:52:13,540 INFO L130 PetriNetUnfolder]: For 40617/41301 co-relation queries the response was YES. [2021-03-25 12:52:13,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32716 conditions, 8764 events. 5708/8764 cut-off events. For 40617/41301 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 54052 event pairs, 379 based on Foata normal form. 357/7528 useless extension candidates. Maximal degree in co-relation 25553. Up to 2921 conditions per place. [2021-03-25 12:52:13,615 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 64 selfloop transitions, 46 changer transitions 2/156 dead transitions. [2021-03-25 12:52:13,615 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 156 transitions, 1398 flow [2021-03-25 12:52:13,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:52:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:52:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1709 transitions. [2021-03-25 12:52:13,619 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.701559934318555 [2021-03-25 12:52:13,620 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1709 transitions. [2021-03-25 12:52:13,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1709 transitions. [2021-03-25 12:52:13,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:13,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1709 transitions. [2021-03-25 12:52:13,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 244.14285714285714) internal successors, (1709), 7 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:13,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:13,627 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:13,627 INFO L185 Difference]: Start difference. First operand has 88 places, 113 transitions, 852 flow. Second operand 7 states and 1709 transitions. [2021-03-25 12:52:13,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 156 transitions, 1398 flow [2021-03-25 12:52:13,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 156 transitions, 1366 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-03-25 12:52:13,680 INFO L241 Difference]: Finished difference. Result has 92 places, 129 transitions, 1193 flow [2021-03-25 12:52:13,680 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1193, PETRI_PLACES=92, PETRI_TRANSITIONS=129} [2021-03-25 12:52:13,681 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 28 predicate places. [2021-03-25 12:52:13,681 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:13,681 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 129 transitions, 1193 flow [2021-03-25 12:52:13,681 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 129 transitions, 1193 flow [2021-03-25 12:52:13,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 92 places, 129 transitions, 1193 flow [2021-03-25 12:52:13,925 INFO L129 PetriNetUnfolder]: 2221/4150 cut-off events. [2021-03-25 12:52:13,925 INFO L130 PetriNetUnfolder]: For 14244/15019 co-relation queries the response was YES. [2021-03-25 12:52:13,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11727 conditions, 4150 events. 2221/4150 cut-off events. For 14244/15019 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 30104 event pairs, 64 based on Foata normal form. 76/3082 useless extension candidates. Maximal degree in co-relation 8675. Up to 960 conditions per place. [2021-03-25 12:52:13,973 INFO L142 LiptonReduction]: Number of co-enabled transitions 2482 [2021-03-25 12:52:13,978 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:13,978 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:13,978 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 297 [2021-03-25 12:52:13,978 INFO L480 AbstractCegarLoop]: Abstraction has has 92 places, 129 transitions, 1193 flow [2021-03-25 12:52:13,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 236.71428571428572) internal successors, (1657), 7 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:13,979 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:13,979 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:13,979 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 12:52:13,979 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:13,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:13,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1940270885, now seen corresponding path program 1 times [2021-03-25 12:52:13,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:13,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82447253] [2021-03-25 12:52:13,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:14,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:14,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:14,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:14,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 12:52:14,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:14,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:14,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:14,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:52:14,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:14,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:52:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:14,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82447253] [2021-03-25 12:52:14,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:14,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 12:52:14,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572327001] [2021-03-25 12:52:14,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 12:52:14,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:14,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 12:52:14,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 12:52:14,040 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 348 [2021-03-25 12:52:14,041 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 129 transitions, 1193 flow. Second operand has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:14,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:14,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 348 [2021-03-25 12:52:14,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:14,852 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][34], [321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), 336#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 280#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 226#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), 42#L1156-1true, Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 125#L1164-2true]) [2021-03-25 12:52:14,852 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:14,852 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:14,852 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:14,852 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:14,853 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][55], [Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 280#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 226#true, 42#L1156-1true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 125#L1164-2true]) [2021-03-25 12:52:14,853 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:14,853 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:14,853 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:14,853 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:14,858 INFO L129 PetriNetUnfolder]: 5711/8738 cut-off events. [2021-03-25 12:52:14,858 INFO L130 PetriNetUnfolder]: For 64111/65081 co-relation queries the response was YES. [2021-03-25 12:52:14,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37887 conditions, 8738 events. 5711/8738 cut-off events. For 64111/65081 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 53151 event pairs, 621 based on Foata normal form. 304/7394 useless extension candidates. Maximal degree in co-relation 29141. Up to 4322 conditions per place. [2021-03-25 12:52:14,919 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 80 selfloop transitions, 24 changer transitions 0/148 dead transitions. [2021-03-25 12:52:14,920 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 148 transitions, 1579 flow [2021-03-25 12:52:14,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 12:52:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 12:52:14,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1272 transitions. [2021-03-25 12:52:14,923 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7310344827586207 [2021-03-25 12:52:14,923 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1272 transitions. [2021-03-25 12:52:14,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1272 transitions. [2021-03-25 12:52:14,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:14,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1272 transitions. [2021-03-25 12:52:14,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 254.4) internal successors, (1272), 5 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:14,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:14,928 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:14,928 INFO L185 Difference]: Start difference. First operand has 92 places, 129 transitions, 1193 flow. Second operand 5 states and 1272 transitions. [2021-03-25 12:52:14,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 148 transitions, 1579 flow [2021-03-25 12:52:14,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 148 transitions, 1574 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 12:52:14,987 INFO L241 Difference]: Finished difference. Result has 95 places, 133 transitions, 1325 flow [2021-03-25 12:52:14,987 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1188, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1325, PETRI_PLACES=95, PETRI_TRANSITIONS=133} [2021-03-25 12:52:14,987 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 31 predicate places. [2021-03-25 12:52:14,987 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:14,988 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 133 transitions, 1325 flow [2021-03-25 12:52:14,988 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 133 transitions, 1325 flow [2021-03-25 12:52:14,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 95 places, 133 transitions, 1325 flow [2021-03-25 12:52:15,203 INFO L129 PetriNetUnfolder]: 2182/4096 cut-off events. [2021-03-25 12:52:15,203 INFO L130 PetriNetUnfolder]: For 14632/14924 co-relation queries the response was YES. [2021-03-25 12:52:15,218 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12361 conditions, 4096 events. 2182/4096 cut-off events. For 14632/14924 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 29823 event pairs, 52 based on Foata normal form. 62/3039 useless extension candidates. Maximal degree in co-relation 9243. Up to 932 conditions per place. [2021-03-25 12:52:15,243 INFO L142 LiptonReduction]: Number of co-enabled transitions 2512 [2021-03-25 12:52:15,249 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:15,249 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:15,249 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 262 [2021-03-25 12:52:15,250 INFO L480 AbstractCegarLoop]: Abstraction has has 95 places, 133 transitions, 1325 flow [2021-03-25 12:52:15,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:15,250 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:15,250 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:15,250 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 12:52:15,250 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:15,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:15,251 INFO L82 PathProgramCache]: Analyzing trace with hash -414745382, now seen corresponding path program 2 times [2021-03-25 12:52:15,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:15,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511409070] [2021-03-25 12:52:15,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:15,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:15,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:15,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:15,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 12:52:15,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:15,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 12:52:15,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:15,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:52:15,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:15,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:52:15,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:15,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:52:15,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:15,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:15,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511409070] [2021-03-25 12:52:15,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:15,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 12:52:15,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333808099] [2021-03-25 12:52:15,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 12:52:15,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:15,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 12:52:15,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 12:52:15,340 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 348 [2021-03-25 12:52:15,341 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 133 transitions, 1325 flow. Second operand has 8 states, 8 states have (on average 233.5) internal successors, (1868), 8 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:15,341 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:15,341 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 348 [2021-03-25 12:52:15,341 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:16,176 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][56], [Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 280#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 226#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), 42#L1156-1true, Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 125#L1164-2true, 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|))]) [2021-03-25 12:52:16,176 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:16,176 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:16,176 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:16,176 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:16,184 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][35], [321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), 336#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 280#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 354#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 226#true, 42#L1156-1true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 125#L1164-2true]) [2021-03-25 12:52:16,184 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:16,184 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:16,184 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:16,184 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:16,187 INFO L129 PetriNetUnfolder]: 5948/9107 cut-off events. [2021-03-25 12:52:16,187 INFO L130 PetriNetUnfolder]: For 80833/81720 co-relation queries the response was YES. [2021-03-25 12:52:16,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41288 conditions, 9107 events. 5948/9107 cut-off events. For 80833/81720 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 55247 event pairs, 425 based on Foata normal form. 286/7625 useless extension candidates. Maximal degree in co-relation 31628. Up to 2829 conditions per place. [2021-03-25 12:52:16,253 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 65 selfloop transitions, 66 changer transitions 2/177 dead transitions. [2021-03-25 12:52:16,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 177 transitions, 2051 flow [2021-03-25 12:52:16,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:52:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:52:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1688 transitions. [2021-03-25 12:52:16,257 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6929392446633826 [2021-03-25 12:52:16,257 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1688 transitions. [2021-03-25 12:52:16,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1688 transitions. [2021-03-25 12:52:16,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:16,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1688 transitions. [2021-03-25 12:52:16,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 241.14285714285714) internal successors, (1688), 7 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:16,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:16,264 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:16,264 INFO L185 Difference]: Start difference. First operand has 95 places, 133 transitions, 1325 flow. Second operand 7 states and 1688 transitions. [2021-03-25 12:52:16,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 177 transitions, 2051 flow [2021-03-25 12:52:16,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 177 transitions, 2016 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 12:52:16,357 INFO L241 Difference]: Finished difference. Result has 102 places, 151 transitions, 1856 flow [2021-03-25 12:52:16,358 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1856, PETRI_PLACES=102, PETRI_TRANSITIONS=151} [2021-03-25 12:52:16,358 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 38 predicate places. [2021-03-25 12:52:16,358 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:16,358 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 151 transitions, 1856 flow [2021-03-25 12:52:16,358 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 151 transitions, 1856 flow [2021-03-25 12:52:16,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 151 transitions, 1856 flow [2021-03-25 12:52:16,567 INFO L129 PetriNetUnfolder]: 2215/4146 cut-off events. [2021-03-25 12:52:16,567 INFO L130 PetriNetUnfolder]: For 23389/23894 co-relation queries the response was YES. [2021-03-25 12:52:16,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14178 conditions, 4146 events. 2215/4146 cut-off events. For 23389/23894 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 30164 event pairs, 47 based on Foata normal form. 144/3132 useless extension candidates. Maximal degree in co-relation 9811. Up to 948 conditions per place. [2021-03-25 12:52:16,614 INFO L142 LiptonReduction]: Number of co-enabled transitions 2734 [2021-03-25 12:52:16,621 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:16,621 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:16,621 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 263 [2021-03-25 12:52:16,621 INFO L480 AbstractCegarLoop]: Abstraction has has 102 places, 151 transitions, 1856 flow [2021-03-25 12:52:16,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 233.5) internal successors, (1868), 8 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:16,622 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:16,622 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:16,622 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 12:52:16,622 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:16,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:16,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1940269459, now seen corresponding path program 1 times [2021-03-25 12:52:16,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:16,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056996162] [2021-03-25 12:52:16,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:16,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:16,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:52:16,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:16,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 12:52:16,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:16,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 12:52:16,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:16,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:52:16,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:16,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:52:16,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:16,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:52:16,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:16,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:52:16,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:16,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 12:52:16,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:16,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:16,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:16,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:16,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056996162] [2021-03-25 12:52:16,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:16,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 12:52:16,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469779135] [2021-03-25 12:52:16,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 12:52:16,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:16,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 12:52:16,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-25 12:52:16,857 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 348 [2021-03-25 12:52:16,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 151 transitions, 1856 flow. Second operand has 11 states, 11 states have (on average 189.27272727272728) internal successors, (2082), 11 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:16,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:16,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 348 [2021-03-25 12:52:16,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:18,683 INFO L129 PetriNetUnfolder]: 10702/15056 cut-off events. [2021-03-25 12:52:18,683 INFO L130 PetriNetUnfolder]: For 179343/180230 co-relation queries the response was YES. [2021-03-25 12:52:18,729 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74078 conditions, 15056 events. 10702/15056 cut-off events. For 179343/180230 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 83867 event pairs, 1928 based on Foata normal form. 94/11776 useless extension candidates. Maximal degree in co-relation 60344. Up to 10784 conditions per place. [2021-03-25 12:52:18,760 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 173 selfloop transitions, 42 changer transitions 3/246 dead transitions. [2021-03-25 12:52:18,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 246 transitions, 3502 flow [2021-03-25 12:52:18,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 12:52:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 12:52:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2173 transitions. [2021-03-25 12:52:18,765 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5676593521421107 [2021-03-25 12:52:18,765 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2173 transitions. [2021-03-25 12:52:18,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2173 transitions. [2021-03-25 12:52:18,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:18,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2173 transitions. [2021-03-25 12:52:18,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 197.54545454545453) internal successors, (2173), 11 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:18,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:18,773 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:18,773 INFO L185 Difference]: Start difference. First operand has 102 places, 151 transitions, 1856 flow. Second operand 11 states and 2173 transitions. [2021-03-25 12:52:18,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 246 transitions, 3502 flow [2021-03-25 12:52:18,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 246 transitions, 3497 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 12:52:18,884 INFO L241 Difference]: Finished difference. Result has 116 places, 186 transitions, 2570 flow [2021-03-25 12:52:18,884 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1851, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2570, PETRI_PLACES=116, PETRI_TRANSITIONS=186} [2021-03-25 12:52:18,884 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 52 predicate places. [2021-03-25 12:52:18,884 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:18,885 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 186 transitions, 2570 flow [2021-03-25 12:52:18,885 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 186 transitions, 2570 flow [2021-03-25 12:52:18,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 116 places, 186 transitions, 2570 flow [2021-03-25 12:52:19,159 INFO L129 PetriNetUnfolder]: 2704/5029 cut-off events. [2021-03-25 12:52:19,160 INFO L130 PetriNetUnfolder]: For 31755/32358 co-relation queries the response was YES. [2021-03-25 12:52:19,183 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17908 conditions, 5029 events. 2704/5029 cut-off events. For 31755/32358 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 37566 event pairs, 55 based on Foata normal form. 124/3719 useless extension candidates. Maximal degree in co-relation 13546. Up to 1140 conditions per place. [2021-03-25 12:52:19,221 INFO L142 LiptonReduction]: Number of co-enabled transitions 2894 [2021-03-25 12:52:19,228 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:19,228 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:19,228 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 344 [2021-03-25 12:52:19,228 INFO L480 AbstractCegarLoop]: Abstraction has has 116 places, 186 transitions, 2570 flow [2021-03-25 12:52:19,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 189.27272727272728) internal successors, (2082), 11 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:19,229 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:19,229 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:19,229 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 12:52:19,229 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:19,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:19,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2068052205, now seen corresponding path program 2 times [2021-03-25 12:52:19,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:19,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426862340] [2021-03-25 12:52:19,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:19,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:19,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:52:19,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:19,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:52:19,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:19,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:52:19,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:19,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:52:19,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:19,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:52:19,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:19,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:52:19,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:19,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:19,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:19,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:19,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426862340] [2021-03-25 12:52:19,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:19,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 12:52:19,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129436827] [2021-03-25 12:52:19,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 12:52:19,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:19,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 12:52:19,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 12:52:19,339 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 348 [2021-03-25 12:52:19,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 186 transitions, 2570 flow. Second operand has 9 states, 9 states have (on average 191.55555555555554) internal successors, (1724), 9 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:19,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:19,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 348 [2021-03-25 12:52:19,340 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:21,240 INFO L129 PetriNetUnfolder]: 13896/19275 cut-off events. [2021-03-25 12:52:21,240 INFO L130 PetriNetUnfolder]: For 258894/259968 co-relation queries the response was YES. [2021-03-25 12:52:21,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97376 conditions, 19275 events. 13896/19275 cut-off events. For 258894/259968 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 107499 event pairs, 2645 based on Foata normal form. 96/14857 useless extension candidates. Maximal degree in co-relation 82894. Up to 8682 conditions per place. [2021-03-25 12:52:21,337 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 164 selfloop transitions, 34 changer transitions 66/292 dead transitions. [2021-03-25 12:52:21,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 292 transitions, 4478 flow [2021-03-25 12:52:21,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:52:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:52:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1815 transitions. [2021-03-25 12:52:21,340 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5795019157088123 [2021-03-25 12:52:21,340 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1815 transitions. [2021-03-25 12:52:21,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1815 transitions. [2021-03-25 12:52:21,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:21,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1815 transitions. [2021-03-25 12:52:21,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 201.66666666666666) internal successors, (1815), 9 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:21,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:21,347 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:21,347 INFO L185 Difference]: Start difference. First operand has 116 places, 186 transitions, 2570 flow. Second operand 9 states and 1815 transitions. [2021-03-25 12:52:21,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 292 transitions, 4478 flow [2021-03-25 12:52:21,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 292 transitions, 4299 flow, removed 88 selfloop flow, removed 1 redundant places. [2021-03-25 12:52:21,499 INFO L241 Difference]: Finished difference. Result has 127 places, 146 transitions, 1817 flow [2021-03-25 12:52:21,500 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2459, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1817, PETRI_PLACES=127, PETRI_TRANSITIONS=146} [2021-03-25 12:52:21,500 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 63 predicate places. [2021-03-25 12:52:21,500 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:21,500 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 146 transitions, 1817 flow [2021-03-25 12:52:21,500 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 146 transitions, 1817 flow [2021-03-25 12:52:21,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 146 transitions, 1817 flow [2021-03-25 12:52:21,836 INFO L129 PetriNetUnfolder]: 2963/5511 cut-off events. [2021-03-25 12:52:21,836 INFO L130 PetriNetUnfolder]: For 35743/36357 co-relation queries the response was YES. [2021-03-25 12:52:21,865 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19165 conditions, 5511 events. 2963/5511 cut-off events. For 35743/36357 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 41793 event pairs, 52 based on Foata normal form. 95/3974 useless extension candidates. Maximal degree in co-relation 16429. Up to 1256 conditions per place. [2021-03-25 12:52:21,911 INFO L142 LiptonReduction]: Number of co-enabled transitions 2534 [2021-03-25 12:52:21,915 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:21,915 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:21,916 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 416 [2021-03-25 12:52:21,916 INFO L480 AbstractCegarLoop]: Abstraction has has 127 places, 146 transitions, 1817 flow [2021-03-25 12:52:21,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 191.55555555555554) internal successors, (1724), 9 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:21,916 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:21,916 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:21,916 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 12:52:21,916 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:21,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:21,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1101121893, now seen corresponding path program 1 times [2021-03-25 12:52:21,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:21,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799731044] [2021-03-25 12:52:21,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:21,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:21,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:52:21,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:21,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:52:22,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:22,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:52:22,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:22,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:52:22,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:22,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:52:22,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:22,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:52:22,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:22,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:52:22,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:22,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:22,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:22,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:22,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799731044] [2021-03-25 12:52:22,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:22,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 12:52:22,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307112500] [2021-03-25 12:52:22,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 12:52:22,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:22,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 12:52:22,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-03-25 12:52:22,133 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 348 [2021-03-25 12:52:22,134 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 146 transitions, 1817 flow. Second operand has 10 states, 10 states have (on average 190.5) internal successors, (1905), 10 states have internal predecessors, (1905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:22,134 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:22,134 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 348 [2021-03-25 12:52:22,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:24,198 INFO L129 PetriNetUnfolder]: 14848/20634 cut-off events. [2021-03-25 12:52:24,198 INFO L130 PetriNetUnfolder]: For 271659/271696 co-relation queries the response was YES. [2021-03-25 12:52:24,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101587 conditions, 20634 events. 14848/20634 cut-off events. For 271659/271696 co-relation queries the response was YES. Maximal size of possible extension queue 950. Compared 115886 event pairs, 3110 based on Foata normal form. 88/15751 useless extension candidates. Maximal degree in co-relation 92109. Up to 15017 conditions per place. [2021-03-25 12:52:24,308 INFO L132 encePairwiseOnDemand]: 335/348 looper letters, 123 selfloop transitions, 32 changer transitions 3/186 dead transitions. [2021-03-25 12:52:24,308 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 186 transitions, 2646 flow [2021-03-25 12:52:24,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:52:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:52:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1780 transitions. [2021-03-25 12:52:24,311 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5683269476372924 [2021-03-25 12:52:24,311 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1780 transitions. [2021-03-25 12:52:24,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1780 transitions. [2021-03-25 12:52:24,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:24,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1780 transitions. [2021-03-25 12:52:24,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 197.77777777777777) internal successors, (1780), 9 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:24,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:24,317 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:24,317 INFO L185 Difference]: Start difference. First operand has 127 places, 146 transitions, 1817 flow. Second operand 9 states and 1780 transitions. [2021-03-25 12:52:24,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 186 transitions, 2646 flow [2021-03-25 12:52:24,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 186 transitions, 2473 flow, removed 34 selfloop flow, removed 10 redundant places. [2021-03-25 12:52:24,510 INFO L241 Difference]: Finished difference. Result has 128 places, 157 transitions, 2001 flow [2021-03-25 12:52:24,510 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1660, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2001, PETRI_PLACES=128, PETRI_TRANSITIONS=157} [2021-03-25 12:52:24,510 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 64 predicate places. [2021-03-25 12:52:24,510 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:24,510 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 157 transitions, 2001 flow [2021-03-25 12:52:24,511 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 157 transitions, 2001 flow [2021-03-25 12:52:24,511 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 157 transitions, 2001 flow [2021-03-25 12:52:24,849 INFO L129 PetriNetUnfolder]: 3311/6092 cut-off events. [2021-03-25 12:52:24,849 INFO L130 PetriNetUnfolder]: For 33986/34356 co-relation queries the response was YES. [2021-03-25 12:52:24,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20170 conditions, 6092 events. 3311/6092 cut-off events. For 33986/34356 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 46454 event pairs, 53 based on Foata normal form. 97/4368 useless extension candidates. Maximal degree in co-relation 17124. Up to 1408 conditions per place. [2021-03-25 12:52:24,935 INFO L142 LiptonReduction]: Number of co-enabled transitions 2660 [2021-03-25 12:52:24,940 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:24,940 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:24,941 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 431 [2021-03-25 12:52:24,941 INFO L480 AbstractCegarLoop]: Abstraction has has 128 places, 157 transitions, 2001 flow [2021-03-25 12:52:24,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 190.5) internal successors, (1905), 10 states have internal predecessors, (1905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:24,941 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:24,942 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:24,942 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 12:52:24,942 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:24,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:24,942 INFO L82 PathProgramCache]: Analyzing trace with hash 505804647, now seen corresponding path program 2 times [2021-03-25 12:52:24,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:24,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192254933] [2021-03-25 12:52:24,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:24,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:24,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 12:52:24,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:24,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 12:52:25,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:25,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 12:52:25,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:25,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 12:52:25,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:25,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:52:25,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:25,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:52:25,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:25,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 12:52:25,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:25,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:52:25,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:25,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:52:25,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:25,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:25,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:25,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:25,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192254933] [2021-03-25 12:52:25,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:25,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 12:52:25,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255164950] [2021-03-25 12:52:25,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 12:52:25,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:25,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 12:52:25,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-03-25 12:52:25,215 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 348 [2021-03-25 12:52:25,217 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 157 transitions, 2001 flow. Second operand has 12 states, 12 states have (on average 187.25) internal successors, (2247), 12 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:25,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:25,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 348 [2021-03-25 12:52:25,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:27,741 INFO L129 PetriNetUnfolder]: 16084/22173 cut-off events. [2021-03-25 12:52:27,741 INFO L130 PetriNetUnfolder]: For 277670/278352 co-relation queries the response was YES. [2021-03-25 12:52:27,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108418 conditions, 22173 events. 16084/22173 cut-off events. For 277670/278352 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 123751 event pairs, 2373 based on Foata normal form. 87/16835 useless extension candidates. Maximal degree in co-relation 98605. Up to 11711 conditions per place. [2021-03-25 12:52:27,918 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 177 selfloop transitions, 53 changer transitions 4/262 dead transitions. [2021-03-25 12:52:27,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 262 transitions, 3980 flow [2021-03-25 12:52:27,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 12:52:27,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 12:52:27,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1582 transitions. [2021-03-25 12:52:27,920 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5682471264367817 [2021-03-25 12:52:27,920 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1582 transitions. [2021-03-25 12:52:27,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1582 transitions. [2021-03-25 12:52:27,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:27,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1582 transitions. [2021-03-25 12:52:27,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 197.75) internal successors, (1582), 8 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:27,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:27,924 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:27,924 INFO L185 Difference]: Start difference. First operand has 128 places, 157 transitions, 2001 flow. Second operand 8 states and 1582 transitions. [2021-03-25 12:52:27,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 262 transitions, 3980 flow [2021-03-25 12:52:28,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 262 transitions, 3754 flow, removed 89 selfloop flow, removed 5 redundant places. [2021-03-25 12:52:28,138 INFO L241 Difference]: Finished difference. Result has 133 places, 182 transitions, 2469 flow [2021-03-25 12:52:28,138 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1840, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2469, PETRI_PLACES=133, PETRI_TRANSITIONS=182} [2021-03-25 12:52:28,138 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 69 predicate places. [2021-03-25 12:52:28,138 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:28,138 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 182 transitions, 2469 flow [2021-03-25 12:52:28,139 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 182 transitions, 2469 flow [2021-03-25 12:52:28,139 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 133 places, 182 transitions, 2469 flow [2021-03-25 12:52:28,355 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([464] L1151-2-->L1152-1: Formula: (= (store |v_#memory_int_76| |v_thread0Thread1of1ForFork4_~#t5~0.base_23| (store (select |v_#memory_int_76| |v_thread0Thread1of1ForFork4_~#t5~0.base_23|) |v_thread0Thread1of1ForFork4_~#t5~0.offset_19| 4)) |v_#memory_int_75|) InVars {#memory_int=|v_#memory_int_76|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_23|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_19|} OutVars{#memory_int=|v_#memory_int_75|, thread0Thread1of1ForFork4_#t~nondet11=|v_thread0Thread1of1ForFork4_#t~nondet11_5|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_23|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_19|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork4_#t~nondet11][16], [Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 386#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), 153#thread3EXITtrue, Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 33#thread2EXITtrue, Black: 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 73#ULTIMATE.startEXITtrue, Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 226#true, Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 356#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 362#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 121#L1152-1true]) [2021-03-25 12:52:28,356 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 12:52:28,356 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 12:52:28,356 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 12:52:28,356 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 12:52:28,734 INFO L129 PetriNetUnfolder]: 3638/6661 cut-off events. [2021-03-25 12:52:28,734 INFO L130 PetriNetUnfolder]: For 42093/42457 co-relation queries the response was YES. [2021-03-25 12:52:28,768 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22244 conditions, 6661 events. 3638/6661 cut-off events. For 42093/42457 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 51284 event pairs, 53 based on Foata normal form. 138/4749 useless extension candidates. Maximal degree in co-relation 19845. Up to 1588 conditions per place. [2021-03-25 12:52:28,820 INFO L142 LiptonReduction]: Number of co-enabled transitions 2778 [2021-03-25 12:52:28,828 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:28,828 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:28,828 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 690 [2021-03-25 12:52:28,829 INFO L480 AbstractCegarLoop]: Abstraction has has 133 places, 182 transitions, 2469 flow [2021-03-25 12:52:28,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 187.25) internal successors, (2247), 12 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:28,829 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:28,829 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:28,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 12:52:28,830 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:28,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:28,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1501503079, now seen corresponding path program 1 times [2021-03-25 12:52:28,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:28,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514153743] [2021-03-25 12:52:28,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:28,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:28,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:52:28,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:28,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:52:28,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:28,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:28,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:28,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:28,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514153743] [2021-03-25 12:52:28,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:28,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 12:52:28,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713015190] [2021-03-25 12:52:28,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 12:52:28,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:28,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 12:52:28,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 12:52:28,877 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 348 [2021-03-25 12:52:28,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 182 transitions, 2469 flow. Second operand has 5 states, 5 states have (on average 236.6) internal successors, (1183), 5 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:28,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:28,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 348 [2021-03-25 12:52:28,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:30,818 INFO L129 PetriNetUnfolder]: 15379/21530 cut-off events. [2021-03-25 12:52:30,819 INFO L130 PetriNetUnfolder]: For 278881/279268 co-relation queries the response was YES. [2021-03-25 12:52:30,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105571 conditions, 21530 events. 15379/21530 cut-off events. For 278881/279268 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 123747 event pairs, 3191 based on Foata normal form. 76/16346 useless extension candidates. Maximal degree in co-relation 96968. Up to 16170 conditions per place. [2021-03-25 12:52:31,020 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 180 selfloop transitions, 7 changer transitions 20/242 dead transitions. [2021-03-25 12:52:31,020 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 242 transitions, 3709 flow [2021-03-25 12:52:31,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 12:52:31,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 12:52:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1467 transitions. [2021-03-25 12:52:31,022 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7025862068965517 [2021-03-25 12:52:31,022 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1467 transitions. [2021-03-25 12:52:31,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1467 transitions. [2021-03-25 12:52:31,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:31,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1467 transitions. [2021-03-25 12:52:31,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 244.5) internal successors, (1467), 6 states have internal predecessors, (1467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:31,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 348.0) internal successors, (2436), 7 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:31,024 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 348.0) internal successors, (2436), 7 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:31,025 INFO L185 Difference]: Start difference. First operand has 133 places, 182 transitions, 2469 flow. Second operand 6 states and 1467 transitions. [2021-03-25 12:52:31,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 242 transitions, 3709 flow [2021-03-25 12:52:31,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 242 transitions, 3648 flow, removed 24 selfloop flow, removed 3 redundant places. [2021-03-25 12:52:31,389 INFO L241 Difference]: Finished difference. Result has 137 places, 183 transitions, 2436 flow [2021-03-25 12:52:31,389 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2408, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2436, PETRI_PLACES=137, PETRI_TRANSITIONS=183} [2021-03-25 12:52:31,390 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 73 predicate places. [2021-03-25 12:52:31,390 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:31,390 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 183 transitions, 2436 flow [2021-03-25 12:52:31,390 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 183 transitions, 2436 flow [2021-03-25 12:52:31,391 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 137 places, 183 transitions, 2436 flow [2021-03-25 12:52:31,607 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([464] L1151-2-->L1152-1: Formula: (= (store |v_#memory_int_76| |v_thread0Thread1of1ForFork4_~#t5~0.base_23| (store (select |v_#memory_int_76| |v_thread0Thread1of1ForFork4_~#t5~0.base_23|) |v_thread0Thread1of1ForFork4_~#t5~0.offset_19| 4)) |v_#memory_int_75|) InVars {#memory_int=|v_#memory_int_76|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_23|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_19|} OutVars{#memory_int=|v_#memory_int_75|, thread0Thread1of1ForFork4_#t~nondet11=|v_thread0Thread1of1ForFork4_#t~nondet11_5|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_23|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_19|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork4_#t~nondet11][15], [Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 386#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), 153#thread3EXITtrue, Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 33#thread2EXITtrue, Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 73#ULTIMATE.startEXITtrue, Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), 464#true, Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 472#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 226#true, Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 356#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 362#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 121#L1152-1true]) [2021-03-25 12:52:31,607 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 12:52:31,607 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 12:52:31,607 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 12:52:31,607 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 12:52:31,858 INFO L129 PetriNetUnfolder]: 3646/6675 cut-off events. [2021-03-25 12:52:31,859 INFO L130 PetriNetUnfolder]: For 39016/39374 co-relation queries the response was YES. [2021-03-25 12:52:31,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22123 conditions, 6675 events. 3646/6675 cut-off events. For 39016/39374 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 51607 event pairs, 61 based on Foata normal form. 139/4751 useless extension candidates. Maximal degree in co-relation 20211. Up to 1610 conditions per place. [2021-03-25 12:52:31,970 INFO L142 LiptonReduction]: Number of co-enabled transitions 2762 [2021-03-25 12:52:31,978 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:31,978 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:31,978 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 588 [2021-03-25 12:52:31,979 INFO L480 AbstractCegarLoop]: Abstraction has has 137 places, 183 transitions, 2436 flow [2021-03-25 12:52:31,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 236.6) internal successors, (1183), 5 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:31,979 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:31,979 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:31,979 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 12:52:31,979 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:31,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:31,980 INFO L82 PathProgramCache]: Analyzing trace with hash -848365179, now seen corresponding path program 2 times [2021-03-25 12:52:31,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:31,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993841108] [2021-03-25 12:52:31,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:32,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:32,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:52:32,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:32,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 12:52:32,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:32,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:52:32,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:32,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:32,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:32,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:32,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993841108] [2021-03-25 12:52:32,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:32,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 12:52:32,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742723521] [2021-03-25 12:52:32,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 12:52:32,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:32,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 12:52:32,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 12:52:32,049 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 348 [2021-03-25 12:52:32,050 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 183 transitions, 2436 flow. Second operand has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:32,050 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:32,050 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 348 [2021-03-25 12:52:32,050 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:34,034 INFO L129 PetriNetUnfolder]: 14866/20885 cut-off events. [2021-03-25 12:52:34,034 INFO L130 PetriNetUnfolder]: For 263855/264172 co-relation queries the response was YES. [2021-03-25 12:52:34,168 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102923 conditions, 20885 events. 14866/20885 cut-off events. For 263855/264172 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 120058 event pairs, 3098 based on Foata normal form. 154/15992 useless extension candidates. Maximal degree in co-relation 96498. Up to 13645 conditions per place. [2021-03-25 12:52:34,211 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 172 selfloop transitions, 17 changer transitions 21/243 dead transitions. [2021-03-25 12:52:34,211 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 243 transitions, 3679 flow [2021-03-25 12:52:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 12:52:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 12:52:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1603 transitions. [2021-03-25 12:52:34,213 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5757902298850575 [2021-03-25 12:52:34,213 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1603 transitions. [2021-03-25 12:52:34,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1603 transitions. [2021-03-25 12:52:34,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:34,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1603 transitions. [2021-03-25 12:52:34,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 200.375) internal successors, (1603), 8 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:34,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:34,216 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:34,216 INFO L185 Difference]: Start difference. First operand has 137 places, 183 transitions, 2436 flow. Second operand 8 states and 1603 transitions. [2021-03-25 12:52:34,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 243 transitions, 3679 flow [2021-03-25 12:52:34,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 243 transitions, 3659 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-03-25 12:52:34,813 INFO L241 Difference]: Finished difference. Result has 142 places, 183 transitions, 2456 flow [2021-03-25 12:52:34,813 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2416, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2456, PETRI_PLACES=142, PETRI_TRANSITIONS=183} [2021-03-25 12:52:34,813 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 78 predicate places. [2021-03-25 12:52:34,813 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:34,814 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 183 transitions, 2456 flow [2021-03-25 12:52:34,814 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 183 transitions, 2456 flow [2021-03-25 12:52:34,815 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 142 places, 183 transitions, 2456 flow [2021-03-25 12:52:35,028 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([464] L1151-2-->L1152-1: Formula: (= (store |v_#memory_int_76| |v_thread0Thread1of1ForFork4_~#t5~0.base_23| (store (select |v_#memory_int_76| |v_thread0Thread1of1ForFork4_~#t5~0.base_23|) |v_thread0Thread1of1ForFork4_~#t5~0.offset_19| 4)) |v_#memory_int_75|) InVars {#memory_int=|v_#memory_int_76|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_23|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_19|} OutVars{#memory_int=|v_#memory_int_75|, thread0Thread1of1ForFork4_#t~nondet11=|v_thread0Thread1of1ForFork4_#t~nondet11_5|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_23|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_19|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork4_#t~nondet11][14], [Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 386#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), 153#thread3EXITtrue, Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 33#thread2EXITtrue, Black: 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 73#ULTIMATE.startEXITtrue, Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 472#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 476#true, 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 226#true, Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 356#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 362#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 480#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 121#L1152-1true]) [2021-03-25 12:52:35,028 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-03-25 12:52:35,029 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 12:52:35,029 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 12:52:35,029 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 12:52:35,208 INFO L129 PetriNetUnfolder]: 3550/6544 cut-off events. [2021-03-25 12:52:35,208 INFO L130 PetriNetUnfolder]: For 37989/38430 co-relation queries the response was YES. [2021-03-25 12:52:35,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21594 conditions, 6544 events. 3550/6544 cut-off events. For 37989/38430 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 50783 event pairs, 60 based on Foata normal form. 179/4728 useless extension candidates. Maximal degree in co-relation 19328. Up to 1594 conditions per place. [2021-03-25 12:52:35,306 INFO L142 LiptonReduction]: Number of co-enabled transitions 2688 [2021-03-25 12:52:35,312 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:35,312 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:35,312 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 499 [2021-03-25 12:52:35,313 INFO L480 AbstractCegarLoop]: Abstraction has has 142 places, 183 transitions, 2456 flow [2021-03-25 12:52:35,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:35,313 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:35,313 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:35,313 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 12:52:35,313 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:35,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:35,314 INFO L82 PathProgramCache]: Analyzing trace with hash -751820630, now seen corresponding path program 1 times [2021-03-25 12:52:35,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:35,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211194633] [2021-03-25 12:52:35,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:35,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:35,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:35,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:35,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 12:52:35,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:35,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 12:52:35,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:35,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:52:35,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:35,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:52:35,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:35,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:52:35,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:35,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:35,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211194633] [2021-03-25 12:52:35,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:35,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 12:52:35,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557456116] [2021-03-25 12:52:35,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 12:52:35,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:35,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 12:52:35,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 12:52:35,407 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 348 [2021-03-25 12:52:35,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 183 transitions, 2456 flow. Second operand has 8 states, 8 states have (on average 215.625) internal successors, (1725), 8 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:35,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:35,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 348 [2021-03-25 12:52:35,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:37,103 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][60], [Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 386#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 42#L1156-1true, Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 472#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 476#true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 354#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 356#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 226#true, 362#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 480#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 506#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 125#L1164-2true]) [2021-03-25 12:52:37,103 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:37,103 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:37,103 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:37,104 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:37,105 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][87], [Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 386#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 42#L1156-1true, Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 472#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 476#true, 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 226#true, Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 356#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 362#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 480#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 502#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 125#L1164-2true]) [2021-03-25 12:52:37,106 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:37,106 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:37,106 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:37,106 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:37,123 INFO L129 PetriNetUnfolder]: 9517/14461 cut-off events. [2021-03-25 12:52:37,124 INFO L130 PetriNetUnfolder]: For 221989/223381 co-relation queries the response was YES. [2021-03-25 12:52:37,221 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77847 conditions, 14461 events. 9517/14461 cut-off events. For 221989/223381 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 93629 event pairs, 422 based on Foata normal form. 407/11741 useless extension candidates. Maximal degree in co-relation 72301. Up to 4277 conditions per place. [2021-03-25 12:52:37,280 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 123 selfloop transitions, 79 changer transitions 4/256 dead transitions. [2021-03-25 12:52:37,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 256 transitions, 3877 flow [2021-03-25 12:52:37,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:52:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:52:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2003 transitions. [2021-03-25 12:52:37,282 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6395274584929758 [2021-03-25 12:52:37,282 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2003 transitions. [2021-03-25 12:52:37,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2003 transitions. [2021-03-25 12:52:37,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:37,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2003 transitions. [2021-03-25 12:52:37,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 222.55555555555554) internal successors, (2003), 9 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:37,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:37,286 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:37,286 INFO L185 Difference]: Start difference. First operand has 142 places, 183 transitions, 2456 flow. Second operand 9 states and 2003 transitions. [2021-03-25 12:52:37,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 256 transitions, 3877 flow [2021-03-25 12:52:37,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 256 transitions, 3838 flow, removed 2 selfloop flow, removed 7 redundant places. [2021-03-25 12:52:37,487 INFO L241 Difference]: Finished difference. Result has 147 places, 216 transitions, 3423 flow [2021-03-25 12:52:37,487 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2419, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3423, PETRI_PLACES=147, PETRI_TRANSITIONS=216} [2021-03-25 12:52:37,487 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 83 predicate places. [2021-03-25 12:52:37,487 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:37,488 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 216 transitions, 3423 flow [2021-03-25 12:52:37,488 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 216 transitions, 3423 flow [2021-03-25 12:52:37,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 216 transitions, 3423 flow [2021-03-25 12:52:37,979 INFO L129 PetriNetUnfolder]: 4085/7572 cut-off events. [2021-03-25 12:52:37,979 INFO L130 PetriNetUnfolder]: For 61169/62186 co-relation queries the response was YES. [2021-03-25 12:52:38,028 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26400 conditions, 7572 events. 4085/7572 cut-off events. For 61169/62186 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 60260 event pairs, 44 based on Foata normal form. 198/5481 useless extension candidates. Maximal degree in co-relation 22768. Up to 1876 conditions per place. [2021-03-25 12:52:38,098 INFO L142 LiptonReduction]: Number of co-enabled transitions 3576 [2021-03-25 12:52:38,107 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:38,108 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:38,108 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 621 [2021-03-25 12:52:38,108 INFO L480 AbstractCegarLoop]: Abstraction has has 147 places, 216 transitions, 3423 flow [2021-03-25 12:52:38,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 215.625) internal successors, (1725), 8 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:38,108 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:38,109 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:38,109 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-25 12:52:38,109 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:38,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:38,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1471250094, now seen corresponding path program 2 times [2021-03-25 12:52:38,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:38,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791561145] [2021-03-25 12:52:38,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:38,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:38,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:52:38,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:38,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:52:38,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:38,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:52:38,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:38,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:52:38,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:38,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:52:38,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:38,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:38,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:38,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:38,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791561145] [2021-03-25 12:52:38,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:38,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 12:52:38,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355393105] [2021-03-25 12:52:38,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 12:52:38,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:38,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 12:52:38,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 12:52:38,187 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 348 [2021-03-25 12:52:38,188 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 216 transitions, 3423 flow. Second operand has 8 states, 8 states have (on average 192.875) internal successors, (1543), 8 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:38,188 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:38,188 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 348 [2021-03-25 12:52:38,188 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:41,033 INFO L129 PetriNetUnfolder]: 18370/25861 cut-off events. [2021-03-25 12:52:41,033 INFO L130 PetriNetUnfolder]: For 443940/444615 co-relation queries the response was YES. [2021-03-25 12:52:41,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142313 conditions, 25861 events. 18370/25861 cut-off events. For 443940/444615 co-relation queries the response was YES. Maximal size of possible extension queue 1258. Compared 156836 event pairs, 3518 based on Foata normal form. 173/19676 useless extension candidates. Maximal degree in co-relation 129069. Up to 14697 conditions per place. [2021-03-25 12:52:41,651 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 278 selfloop transitions, 28 changer transitions 4/343 dead transitions. [2021-03-25 12:52:41,651 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 343 transitions, 6035 flow [2021-03-25 12:52:41,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:52:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:52:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1816 transitions. [2021-03-25 12:52:41,666 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5798212005108557 [2021-03-25 12:52:41,666 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1816 transitions. [2021-03-25 12:52:41,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1816 transitions. [2021-03-25 12:52:41,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:41,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1816 transitions. [2021-03-25 12:52:41,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 201.77777777777777) internal successors, (1816), 9 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:41,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:41,670 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:41,670 INFO L185 Difference]: Start difference. First operand has 147 places, 216 transitions, 3423 flow. Second operand 9 states and 1816 transitions. [2021-03-25 12:52:41,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 343 transitions, 6035 flow [2021-03-25 12:52:42,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 343 transitions, 5883 flow, removed 23 selfloop flow, removed 3 redundant places. [2021-03-25 12:52:42,606 INFO L241 Difference]: Finished difference. Result has 156 places, 229 transitions, 3670 flow [2021-03-25 12:52:42,607 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3324, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3670, PETRI_PLACES=156, PETRI_TRANSITIONS=229} [2021-03-25 12:52:42,607 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 92 predicate places. [2021-03-25 12:52:42,607 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:42,607 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 229 transitions, 3670 flow [2021-03-25 12:52:42,607 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 229 transitions, 3670 flow [2021-03-25 12:52:42,609 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 156 places, 229 transitions, 3670 flow [2021-03-25 12:52:43,299 INFO L129 PetriNetUnfolder]: 4791/8891 cut-off events. [2021-03-25 12:52:43,300 INFO L130 PetriNetUnfolder]: For 62545/63213 co-relation queries the response was YES. [2021-03-25 12:52:43,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30618 conditions, 8891 events. 4791/8891 cut-off events. For 62545/63213 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 73092 event pairs, 49 based on Foata normal form. 101/6244 useless extension candidates. Maximal degree in co-relation 27071. Up to 2210 conditions per place. [2021-03-25 12:52:43,418 INFO L142 LiptonReduction]: Number of co-enabled transitions 3876 [2021-03-25 12:52:43,427 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:43,427 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:43,427 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 820 [2021-03-25 12:52:43,427 INFO L480 AbstractCegarLoop]: Abstraction has has 156 places, 229 transitions, 3670 flow [2021-03-25 12:52:43,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 192.875) internal successors, (1543), 8 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:43,428 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:43,428 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:43,428 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-25 12:52:43,428 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:43,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:43,428 INFO L82 PathProgramCache]: Analyzing trace with hash 290202358, now seen corresponding path program 3 times [2021-03-25 12:52:43,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:43,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621064780] [2021-03-25 12:52:43,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:43,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:43,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:52:43,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:43,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:52:43,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:43,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:52:43,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:43,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:52:43,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:43,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:52:43,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:43,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:43,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:43,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:43,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621064780] [2021-03-25 12:52:43,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:43,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 12:52:43,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680187590] [2021-03-25 12:52:43,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 12:52:43,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:43,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 12:52:43,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 12:52:43,507 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 348 [2021-03-25 12:52:43,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 229 transitions, 3670 flow. Second operand has 8 states, 8 states have (on average 192.875) internal successors, (1543), 8 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:43,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:43,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 348 [2021-03-25 12:52:43,508 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:46,665 INFO L129 PetriNetUnfolder]: 17939/25437 cut-off events. [2021-03-25 12:52:46,665 INFO L130 PetriNetUnfolder]: For 402935/403973 co-relation queries the response was YES. [2021-03-25 12:52:46,799 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138875 conditions, 25437 events. 17939/25437 cut-off events. For 402935/403973 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 156061 event pairs, 3541 based on Foata normal form. 200/19365 useless extension candidates. Maximal degree in co-relation 129334. Up to 18819 conditions per place. [2021-03-25 12:52:46,844 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 219 selfloop transitions, 17 changer transitions 16/285 dead transitions. [2021-03-25 12:52:46,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 285 transitions, 5034 flow [2021-03-25 12:52:46,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:52:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:52:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1404 transitions. [2021-03-25 12:52:46,846 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5763546798029556 [2021-03-25 12:52:46,846 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1404 transitions. [2021-03-25 12:52:46,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1404 transitions. [2021-03-25 12:52:46,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:46,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1404 transitions. [2021-03-25 12:52:46,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 200.57142857142858) internal successors, (1404), 7 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:46,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:46,852 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:46,852 INFO L185 Difference]: Start difference. First operand has 156 places, 229 transitions, 3670 flow. Second operand 7 states and 1404 transitions. [2021-03-25 12:52:46,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 285 transitions, 5034 flow [2021-03-25 12:52:47,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 285 transitions, 4997 flow, removed 16 selfloop flow, removed 2 redundant places. [2021-03-25 12:52:47,524 INFO L241 Difference]: Finished difference. Result has 162 places, 228 transitions, 3660 flow [2021-03-25 12:52:47,524 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3635, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3660, PETRI_PLACES=162, PETRI_TRANSITIONS=228} [2021-03-25 12:52:47,524 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 98 predicate places. [2021-03-25 12:52:47,524 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:47,524 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 228 transitions, 3660 flow [2021-03-25 12:52:47,524 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 228 transitions, 3660 flow [2021-03-25 12:52:47,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 162 places, 228 transitions, 3660 flow [2021-03-25 12:52:48,196 INFO L129 PetriNetUnfolder]: 4765/8869 cut-off events. [2021-03-25 12:52:48,196 INFO L130 PetriNetUnfolder]: For 60810/61461 co-relation queries the response was YES. [2021-03-25 12:52:48,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30308 conditions, 8869 events. 4765/8869 cut-off events. For 60810/61461 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 73277 event pairs, 46 based on Foata normal form. 94/6221 useless extension candidates. Maximal degree in co-relation 27373. Up to 2214 conditions per place. [2021-03-25 12:52:48,466 INFO L142 LiptonReduction]: Number of co-enabled transitions 3864 [2021-03-25 12:52:48,474 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:48,475 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:48,475 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 951 [2021-03-25 12:52:48,475 INFO L480 AbstractCegarLoop]: Abstraction has has 162 places, 228 transitions, 3660 flow [2021-03-25 12:52:48,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 192.875) internal successors, (1543), 8 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:48,475 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:48,475 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:48,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-25 12:52:48,475 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:48,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:48,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1195912476, now seen corresponding path program 1 times [2021-03-25 12:52:48,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:48,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099866923] [2021-03-25 12:52:48,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:48,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:48,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 12:52:48,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:48,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 12:52:48,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:48,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:52:48,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:48,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:52:48,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:48,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:52:48,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:48,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:52:48,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:48,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:52:48,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:48,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:52:48,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:48,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:48,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099866923] [2021-03-25 12:52:48,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:48,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 12:52:48,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071674223] [2021-03-25 12:52:48,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 12:52:48,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:48,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 12:52:48,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-03-25 12:52:48,612 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 348 [2021-03-25 12:52:48,613 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 228 transitions, 3660 flow. Second operand has 10 states, 10 states have (on average 189.5) internal successors, (1895), 10 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:48,613 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:48,613 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 348 [2021-03-25 12:52:48,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:52,312 INFO L129 PetriNetUnfolder]: 19146/27056 cut-off events. [2021-03-25 12:52:52,313 INFO L130 PetriNetUnfolder]: For 440684/441791 co-relation queries the response was YES. [2021-03-25 12:52:52,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148911 conditions, 27056 events. 19146/27056 cut-off events. For 440684/441791 co-relation queries the response was YES. Maximal size of possible extension queue 1326. Compared 166003 event pairs, 3711 based on Foata normal form. 179/20472 useless extension candidates. Maximal degree in co-relation 139181. Up to 18937 conditions per place. [2021-03-25 12:52:52,574 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 228 selfloop transitions, 20 changer transitions 8/289 dead transitions. [2021-03-25 12:52:52,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 289 transitions, 5156 flow [2021-03-25 12:52:52,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:52:52,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:52:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1385 transitions. [2021-03-25 12:52:52,576 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5685550082101807 [2021-03-25 12:52:52,576 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1385 transitions. [2021-03-25 12:52:52,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1385 transitions. [2021-03-25 12:52:52,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:52,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1385 transitions. [2021-03-25 12:52:52,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 197.85714285714286) internal successors, (1385), 7 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:52,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:52,580 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:52,580 INFO L185 Difference]: Start difference. First operand has 162 places, 228 transitions, 3660 flow. Second operand 7 states and 1385 transitions. [2021-03-25 12:52:52,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 289 transitions, 5156 flow [2021-03-25 12:52:53,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 289 transitions, 5055 flow, removed 2 selfloop flow, removed 5 redundant places. [2021-03-25 12:52:53,385 INFO L241 Difference]: Finished difference. Result has 166 places, 233 transitions, 3781 flow [2021-03-25 12:52:53,385 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3582, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3781, PETRI_PLACES=166, PETRI_TRANSITIONS=233} [2021-03-25 12:52:53,385 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 102 predicate places. [2021-03-25 12:52:53,385 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:53,386 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 233 transitions, 3781 flow [2021-03-25 12:52:53,386 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 233 transitions, 3781 flow [2021-03-25 12:52:53,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 166 places, 233 transitions, 3781 flow [2021-03-25 12:52:54,148 INFO L129 PetriNetUnfolder]: 4946/9156 cut-off events. [2021-03-25 12:52:54,148 INFO L130 PetriNetUnfolder]: For 62289/63031 co-relation queries the response was YES. [2021-03-25 12:52:54,214 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31755 conditions, 9156 events. 4946/9156 cut-off events. For 62289/63031 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 75553 event pairs, 30 based on Foata normal form. 114/6443 useless extension candidates. Maximal degree in co-relation 27800. Up to 2278 conditions per place. [2021-03-25 12:52:54,313 INFO L142 LiptonReduction]: Number of co-enabled transitions 4012 [2021-03-25 12:52:54,322 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:54,322 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:54,322 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 937 [2021-03-25 12:52:54,323 INFO L480 AbstractCegarLoop]: Abstraction has has 166 places, 233 transitions, 3781 flow [2021-03-25 12:52:54,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 189.5) internal successors, (1895), 10 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:54,323 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:54,323 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:54,323 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-25 12:52:54,323 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:54,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:54,324 INFO L82 PathProgramCache]: Analyzing trace with hash 120244828, now seen corresponding path program 2 times [2021-03-25 12:52:54,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:54,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091783318] [2021-03-25 12:52:54,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:54,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:54,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:54,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:54,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:52:54,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:54,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:52:54,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:54,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:52:54,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:54,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:52:54,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:54,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:52:54,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:54,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:52:54,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:54,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:54,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091783318] [2021-03-25 12:52:54,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:54,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 12:52:54,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407832609] [2021-03-25 12:52:54,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 12:52:54,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:54,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 12:52:54,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 12:52:54,471 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 348 [2021-03-25 12:52:54,472 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 233 transitions, 3781 flow. Second operand has 9 states, 9 states have (on average 230.44444444444446) internal successors, (2074), 9 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:54,472 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:54,472 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 348 [2021-03-25 12:52:54,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:52:56,677 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][110], [Black: 504#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 506#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 514#true, Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 386#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 529#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 531#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 523#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 527#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 544#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 548#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), 554#true, 42#L1156-1true, Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, Black: 563#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 569#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= thread2Thread1of1ForFork5_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 571#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= thread2Thread1of1ForFork5_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 586#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 356#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 362#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 480#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 502#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 125#L1164-2true, Black: 496#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)))]) [2021-03-25 12:52:56,677 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:52:56,677 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:56,677 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:56,677 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:52:56,702 INFO L129 PetriNetUnfolder]: 11450/17555 cut-off events. [2021-03-25 12:52:56,702 INFO L130 PetriNetUnfolder]: For 325356/328166 co-relation queries the response was YES. [2021-03-25 12:52:56,817 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104379 conditions, 17555 events. 11450/17555 cut-off events. For 325356/328166 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 119125 event pairs, 739 based on Foata normal form. 829/14409 useless extension candidates. Maximal degree in co-relation 91100. Up to 5908 conditions per place. [2021-03-25 12:52:56,886 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 128 selfloop transitions, 93 changer transitions 2/274 dead transitions. [2021-03-25 12:52:56,887 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 274 transitions, 4812 flow [2021-03-25 12:52:56,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:52:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:52:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1661 transitions. [2021-03-25 12:52:56,888 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6818555008210181 [2021-03-25 12:52:56,888 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1661 transitions. [2021-03-25 12:52:56,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1661 transitions. [2021-03-25 12:52:56,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:52:56,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1661 transitions. [2021-03-25 12:52:56,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 237.28571428571428) internal successors, (1661), 7 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:56,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:56,891 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:56,891 INFO L185 Difference]: Start difference. First operand has 166 places, 233 transitions, 3781 flow. Second operand 7 states and 1661 transitions. [2021-03-25 12:52:56,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 274 transitions, 4812 flow [2021-03-25 12:52:57,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 274 transitions, 4754 flow, removed 15 selfloop flow, removed 4 redundant places. [2021-03-25 12:52:57,653 INFO L241 Difference]: Finished difference. Result has 171 places, 247 transitions, 4422 flow [2021-03-25 12:52:57,654 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3723, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4422, PETRI_PLACES=171, PETRI_TRANSITIONS=247} [2021-03-25 12:52:57,654 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 107 predicate places. [2021-03-25 12:52:57,654 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:52:57,654 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 247 transitions, 4422 flow [2021-03-25 12:52:57,654 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 247 transitions, 4422 flow [2021-03-25 12:52:57,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 171 places, 247 transitions, 4422 flow [2021-03-25 12:52:58,560 INFO L129 PetriNetUnfolder]: 4884/9076 cut-off events. [2021-03-25 12:52:58,560 INFO L130 PetriNetUnfolder]: For 76443/76880 co-relation queries the response was YES. [2021-03-25 12:52:58,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33809 conditions, 9076 events. 4884/9076 cut-off events. For 76443/76880 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 75126 event pairs, 34 based on Foata normal form. 89/6396 useless extension candidates. Maximal degree in co-relation 30528. Up to 2250 conditions per place. [2021-03-25 12:52:58,698 INFO L142 LiptonReduction]: Number of co-enabled transitions 4228 [2021-03-25 12:52:58,708 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:52:58,708 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:52:58,708 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1054 [2021-03-25 12:52:58,708 INFO L480 AbstractCegarLoop]: Abstraction has has 171 places, 247 transitions, 4422 flow [2021-03-25 12:52:58,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 230.44444444444446) internal successors, (2074), 9 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:58,709 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:52:58,709 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:52:58,709 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-25 12:52:58,709 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:52:58,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:52:58,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2125628681, now seen corresponding path program 1 times [2021-03-25 12:52:58,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:52:58,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873681469] [2021-03-25 12:52:58,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:52:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:52:58,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:58,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:52:58,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:58,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 12:52:58,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:58,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 12:52:58,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:58,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:52:58,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:58,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:52:58,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:52:58,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:52:58,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:52:58,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873681469] [2021-03-25 12:52:58,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:52:58,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 12:52:58,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815857085] [2021-03-25 12:52:58,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 12:52:58,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:52:58,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 12:52:58,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 12:52:58,787 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 348 [2021-03-25 12:52:58,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 247 transitions, 4422 flow. Second operand has 7 states, 7 states have (on average 226.85714285714286) internal successors, (1588), 7 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:52:58,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:52:58,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 348 [2021-03-25 12:52:58,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:53:00,922 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][94], [Black: 504#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 506#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 514#true, Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 386#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 529#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 531#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 523#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 527#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 544#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 548#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), 42#L1156-1true, Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, Black: 563#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 569#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= thread2Thread1of1ForFork5_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 571#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= thread2Thread1of1ForFork5_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 586#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 588#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 590#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 607#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 356#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 362#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 480#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 502#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 125#L1164-2true, Black: 496#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)))]) [2021-03-25 12:53:00,922 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:53:00,923 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:53:00,923 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:53:00,923 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:53:00,958 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][90], [Black: 504#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 514#true, Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 386#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 529#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 531#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 523#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 527#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 544#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 548#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), 42#L1156-1true, Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, Black: 563#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 569#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= thread2Thread1of1ForFork5_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 571#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= thread2Thread1of1ForFork5_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 590#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 586#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 588#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), 605#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 354#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 356#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 226#true, Black: 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), 362#true, Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 480#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 506#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 125#L1164-2true, Black: 496#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|))), Black: 502#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|))]) [2021-03-25 12:53:00,959 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:53:00,959 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:53:00,959 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:53:00,959 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:53:00,965 INFO L129 PetriNetUnfolder]: 11130/17017 cut-off events. [2021-03-25 12:53:00,965 INFO L130 PetriNetUnfolder]: For 385062/388198 co-relation queries the response was YES. [2021-03-25 12:53:01,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110824 conditions, 17017 events. 11130/17017 cut-off events. For 385062/388198 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 114581 event pairs, 683 based on Foata normal form. 1207/14603 useless extension candidates. Maximal degree in co-relation 99803. Up to 6953 conditions per place. [2021-03-25 12:53:01,427 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 161 selfloop transitions, 61 changer transitions 2/275 dead transitions. [2021-03-25 12:53:01,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 275 transitions, 5184 flow [2021-03-25 12:53:01,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:53:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:53:01,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1630 transitions. [2021-03-25 12:53:01,429 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6691297208538588 [2021-03-25 12:53:01,429 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1630 transitions. [2021-03-25 12:53:01,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1630 transitions. [2021-03-25 12:53:01,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:53:01,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1630 transitions. [2021-03-25 12:53:01,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 232.85714285714286) internal successors, (1630), 7 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:01,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:01,432 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:01,432 INFO L185 Difference]: Start difference. First operand has 171 places, 247 transitions, 4422 flow. Second operand 7 states and 1630 transitions. [2021-03-25 12:53:01,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 275 transitions, 5184 flow [2021-03-25 12:53:02,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 275 transitions, 5098 flow, removed 21 selfloop flow, removed 3 redundant places. [2021-03-25 12:53:02,317 INFO L241 Difference]: Finished difference. Result has 175 places, 251 transitions, 4626 flow [2021-03-25 12:53:02,317 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4336, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4626, PETRI_PLACES=175, PETRI_TRANSITIONS=251} [2021-03-25 12:53:02,317 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 111 predicate places. [2021-03-25 12:53:02,318 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:53:02,318 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 251 transitions, 4626 flow [2021-03-25 12:53:02,318 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 251 transitions, 4626 flow [2021-03-25 12:53:02,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 251 transitions, 4626 flow [2021-03-25 12:53:03,141 INFO L129 PetriNetUnfolder]: 4894/9078 cut-off events. [2021-03-25 12:53:03,141 INFO L130 PetriNetUnfolder]: For 82947/83893 co-relation queries the response was YES. [2021-03-25 12:53:03,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34829 conditions, 9078 events. 4894/9078 cut-off events. For 82947/83893 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 75039 event pairs, 17 based on Foata normal form. 235/6542 useless extension candidates. Maximal degree in co-relation 33029. Up to 2252 conditions per place. [2021-03-25 12:53:03,299 INFO L142 LiptonReduction]: Number of co-enabled transitions 4244 [2021-03-25 12:53:03,310 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:53:03,310 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:53:03,310 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 993 [2021-03-25 12:53:03,310 INFO L480 AbstractCegarLoop]: Abstraction has has 175 places, 251 transitions, 4626 flow [2021-03-25 12:53:03,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 226.85714285714286) internal successors, (1588), 7 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:03,311 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:53:03,311 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:53:03,311 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-25 12:53:03,311 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:53:03,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:53:03,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1621581695, now seen corresponding path program 1 times [2021-03-25 12:53:03,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:53:03,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756170342] [2021-03-25 12:53:03,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:53:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:53:03,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:03,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:53:03,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:03,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 12:53:03,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:03,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:53:03,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:03,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:53:03,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:03,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:53:03,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:03,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:53:03,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:03,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:53:03,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:03,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:53:03,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:03,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:53:03,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:03,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:53:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:53:03,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756170342] [2021-03-25 12:53:03,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:53:03,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 12:53:03,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029702530] [2021-03-25 12:53:03,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 12:53:03,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:53:03,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 12:53:03,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-03-25 12:53:03,526 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-25 12:53:03,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 251 transitions, 4626 flow. Second operand has 10 states, 10 states have (on average 188.6) internal successors, (1886), 10 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:03,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:53:03,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-25 12:53:03,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:53:07,661 INFO L129 PetriNetUnfolder]: 19955/28159 cut-off events. [2021-03-25 12:53:07,661 INFO L130 PetriNetUnfolder]: For 607182/607990 co-relation queries the response was YES. [2021-03-25 12:53:07,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 173395 conditions, 28159 events. 19955/28159 cut-off events. For 607182/607990 co-relation queries the response was YES. Maximal size of possible extension queue 1408. Compared 174134 event pairs, 3837 based on Foata normal form. 535/21759 useless extension candidates. Maximal degree in co-relation 165624. Up to 16769 conditions per place. [2021-03-25 12:53:07,986 INFO L132 encePairwiseOnDemand]: 336/348 looper letters, 243 selfloop transitions, 58 changer transitions 3/337 dead transitions. [2021-03-25 12:53:07,987 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 337 transitions, 6924 flow [2021-03-25 12:53:07,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 12:53:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 12:53:07,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1953 transitions. [2021-03-25 12:53:07,992 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5612068965517242 [2021-03-25 12:53:07,992 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1953 transitions. [2021-03-25 12:53:07,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1953 transitions. [2021-03-25 12:53:07,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:53:07,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1953 transitions. [2021-03-25 12:53:07,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 195.3) internal successors, (1953), 10 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:07,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:07,995 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:07,995 INFO L185 Difference]: Start difference. First operand has 175 places, 251 transitions, 4626 flow. Second operand 10 states and 1953 transitions. [2021-03-25 12:53:07,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 337 transitions, 6924 flow [2021-03-25 12:53:09,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 337 transitions, 6728 flow, removed 29 selfloop flow, removed 5 redundant places. [2021-03-25 12:53:09,285 INFO L241 Difference]: Finished difference. Result has 182 places, 264 transitions, 4958 flow [2021-03-25 12:53:09,286 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4410, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4958, PETRI_PLACES=182, PETRI_TRANSITIONS=264} [2021-03-25 12:53:09,286 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 118 predicate places. [2021-03-25 12:53:09,286 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:53:09,286 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 264 transitions, 4958 flow [2021-03-25 12:53:09,286 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 264 transitions, 4958 flow [2021-03-25 12:53:09,288 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 182 places, 264 transitions, 4958 flow [2021-03-25 12:53:10,014 INFO L129 PetriNetUnfolder]: 5208/9668 cut-off events. [2021-03-25 12:53:10,014 INFO L130 PetriNetUnfolder]: For 81515/82343 co-relation queries the response was YES. [2021-03-25 12:53:10,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35431 conditions, 9668 events. 5208/9668 cut-off events. For 81515/82343 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 80887 event pairs, 13 based on Foata normal form. 200/6913 useless extension candidates. Maximal degree in co-relation 33289. Up to 2442 conditions per place. [2021-03-25 12:53:10,401 INFO L142 LiptonReduction]: Number of co-enabled transitions 4438 [2021-03-25 12:53:10,416 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:53:10,417 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:53:10,417 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1131 [2021-03-25 12:53:10,418 INFO L480 AbstractCegarLoop]: Abstraction has has 182 places, 264 transitions, 4958 flow [2021-03-25 12:53:10,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 188.6) internal successors, (1886), 10 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:10,419 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:53:10,419 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:53:10,419 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-25 12:53:10,419 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:53:10,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:53:10,419 INFO L82 PathProgramCache]: Analyzing trace with hash 644705952, now seen corresponding path program 1 times [2021-03-25 12:53:10,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:53:10,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167875856] [2021-03-25 12:53:10,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:53:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:53:10,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:10,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 12:53:10,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:10,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:53:10,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:10,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 12:53:10,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:10,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:53:10,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:10,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:53:10,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:10,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:53:10,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:10,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:53:10,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:10,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:53:10,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:10,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:53:10,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:10,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:53:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:53:10,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167875856] [2021-03-25 12:53:10,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:53:10,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 12:53:10,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247196724] [2021-03-25 12:53:10,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 12:53:10,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:53:10,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 12:53:10,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-25 12:53:10,601 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-25 12:53:10,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 264 transitions, 4958 flow. Second operand has 10 states, 10 states have (on average 188.6) internal successors, (1886), 10 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:10,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:53:10,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-25 12:53:10,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:53:14,662 INFO L129 PetriNetUnfolder]: 20148/28129 cut-off events. [2021-03-25 12:53:14,662 INFO L130 PetriNetUnfolder]: For 590738/591089 co-relation queries the response was YES. [2021-03-25 12:53:14,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 174730 conditions, 28129 events. 20148/28129 cut-off events. For 590738/591089 co-relation queries the response was YES. Maximal size of possible extension queue 1382. Compared 169791 event pairs, 3993 based on Foata normal form. 172/21600 useless extension candidates. Maximal degree in co-relation 161545. Up to 11029 conditions per place. [2021-03-25 12:53:14,946 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 264 selfloop transitions, 79 changer transitions 6/380 dead transitions. [2021-03-25 12:53:14,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 380 transitions, 7697 flow [2021-03-25 12:53:14,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 12:53:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 12:53:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2156 transitions. [2021-03-25 12:53:14,948 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2021-03-25 12:53:14,948 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2156 transitions. [2021-03-25 12:53:14,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2156 transitions. [2021-03-25 12:53:14,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:53:14,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2156 transitions. [2021-03-25 12:53:14,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 196.0) internal successors, (2156), 11 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:14,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:14,952 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:14,952 INFO L185 Difference]: Start difference. First operand has 182 places, 264 transitions, 4958 flow. Second operand 11 states and 2156 transitions. [2021-03-25 12:53:14,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 380 transitions, 7697 flow [2021-03-25 12:53:16,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 380 transitions, 7513 flow, removed 56 selfloop flow, removed 7 redundant places. [2021-03-25 12:53:16,095 INFO L241 Difference]: Finished difference. Result has 188 places, 271 transitions, 5080 flow [2021-03-25 12:53:16,095 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4719, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5080, PETRI_PLACES=188, PETRI_TRANSITIONS=271} [2021-03-25 12:53:16,095 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 124 predicate places. [2021-03-25 12:53:16,095 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:53:16,096 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 271 transitions, 5080 flow [2021-03-25 12:53:16,096 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 271 transitions, 5080 flow [2021-03-25 12:53:16,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 188 places, 271 transitions, 5080 flow [2021-03-25 12:53:17,015 INFO L129 PetriNetUnfolder]: 5107/9508 cut-off events. [2021-03-25 12:53:17,015 INFO L130 PetriNetUnfolder]: For 77426/78077 co-relation queries the response was YES. [2021-03-25 12:53:17,070 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34360 conditions, 9508 events. 5107/9508 cut-off events. For 77426/78077 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 79502 event pairs, 10 based on Foata normal form. 202/6770 useless extension candidates. Maximal degree in co-relation 31522. Up to 2430 conditions per place. [2021-03-25 12:53:17,147 INFO L142 LiptonReduction]: Number of co-enabled transitions 4392 [2021-03-25 12:53:17,159 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:53:17,159 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:53:17,159 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1064 [2021-03-25 12:53:17,159 INFO L480 AbstractCegarLoop]: Abstraction has has 188 places, 271 transitions, 5080 flow [2021-03-25 12:53:17,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 188.6) internal successors, (1886), 10 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:17,160 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:53:17,160 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:53:17,160 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-03-25 12:53:17,160 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:53:17,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:53:17,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1522625699, now seen corresponding path program 2 times [2021-03-25 12:53:17,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:53:17,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133718411] [2021-03-25 12:53:17,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:53:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:53:17,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:17,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:53:17,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:17,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 12:53:17,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:17,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 12:53:17,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:17,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:53:17,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:17,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:53:17,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:17,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 12:53:17,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:17,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 12:53:17,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:17,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:53:17,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:17,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:53:17,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:17,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:53:17,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:17,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:53:17,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:17,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:53:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:53:17,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133718411] [2021-03-25 12:53:17,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:53:17,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 12:53:17,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135249132] [2021-03-25 12:53:17,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 12:53:17,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:53:17,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 12:53:17,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-03-25 12:53:17,420 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 348 [2021-03-25 12:53:17,421 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 271 transitions, 5080 flow. Second operand has 11 states, 11 states have (on average 187.45454545454547) internal successors, (2062), 11 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:17,421 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:53:17,421 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 348 [2021-03-25 12:53:17,421 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:53:21,461 INFO L129 PetriNetUnfolder]: 18946/26878 cut-off events. [2021-03-25 12:53:21,461 INFO L130 PetriNetUnfolder]: For 548368/549175 co-relation queries the response was YES. [2021-03-25 12:53:21,635 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160879 conditions, 26878 events. 18946/26878 cut-off events. For 548368/549175 co-relation queries the response was YES. Maximal size of possible extension queue 1325. Compared 166184 event pairs, 3156 based on Foata normal form. 298/20693 useless extension candidates. Maximal degree in co-relation 147601. Up to 18329 conditions per place. [2021-03-25 12:53:21,678 INFO L132 encePairwiseOnDemand]: 336/348 looper letters, 218 selfloop transitions, 60 changer transitions 20/332 dead transitions. [2021-03-25 12:53:21,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 332 transitions, 6825 flow [2021-03-25 12:53:21,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 12:53:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 12:53:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1944 transitions. [2021-03-25 12:53:21,680 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5586206896551724 [2021-03-25 12:53:21,680 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1944 transitions. [2021-03-25 12:53:21,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1944 transitions. [2021-03-25 12:53:21,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:53:21,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1944 transitions. [2021-03-25 12:53:21,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 194.4) internal successors, (1944), 10 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:21,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:21,685 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:21,685 INFO L185 Difference]: Start difference. First operand has 188 places, 271 transitions, 5080 flow. Second operand 10 states and 1944 transitions. [2021-03-25 12:53:21,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 332 transitions, 6825 flow [2021-03-25 12:53:22,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 332 transitions, 6613 flow, removed 46 selfloop flow, removed 6 redundant places. [2021-03-25 12:53:22,457 INFO L241 Difference]: Finished difference. Result has 193 places, 253 transitions, 4718 flow [2021-03-25 12:53:22,457 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4672, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4718, PETRI_PLACES=193, PETRI_TRANSITIONS=253} [2021-03-25 12:53:22,457 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 129 predicate places. [2021-03-25 12:53:22,457 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:53:22,457 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 253 transitions, 4718 flow [2021-03-25 12:53:22,457 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 253 transitions, 4718 flow [2021-03-25 12:53:22,459 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 193 places, 253 transitions, 4718 flow [2021-03-25 12:53:23,264 INFO L129 PetriNetUnfolder]: 4836/8999 cut-off events. [2021-03-25 12:53:23,264 INFO L130 PetriNetUnfolder]: For 74580/75958 co-relation queries the response was YES. [2021-03-25 12:53:23,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30770 conditions, 8999 events. 4836/8999 cut-off events. For 74580/75958 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 74725 event pairs, 18 based on Foata normal form. 302/6457 useless extension candidates. Maximal degree in co-relation 28076. Up to 2382 conditions per place. [2021-03-25 12:53:23,429 INFO L142 LiptonReduction]: Number of co-enabled transitions 4176 [2021-03-25 12:53:23,445 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:53:23,445 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:53:23,445 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 988 [2021-03-25 12:53:23,445 INFO L480 AbstractCegarLoop]: Abstraction has has 193 places, 253 transitions, 4718 flow [2021-03-25 12:53:23,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 187.45454545454547) internal successors, (2062), 11 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:23,446 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:53:23,446 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:53:23,446 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-03-25 12:53:23,446 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:53:23,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:53:23,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1469979140, now seen corresponding path program 1 times [2021-03-25 12:53:23,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:53:23,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346534609] [2021-03-25 12:53:23,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:53:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:53:23,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:23,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:53:23,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:23,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-03-25 12:53:23,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:23,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-03-25 12:53:23,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:23,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-03-25 12:53:23,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:23,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:53:23,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:23,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:53:23,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:23,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 12:53:23,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:23,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 12:53:23,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:23,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:53:23,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:23,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:53:23,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:23,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:53:23,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:23,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:53:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:53:23,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346534609] [2021-03-25 12:53:23,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:53:23,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 12:53:23,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442526007] [2021-03-25 12:53:23,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 12:53:23,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:53:23,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 12:53:23,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-03-25 12:53:23,837 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 348 [2021-03-25 12:53:23,838 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 253 transitions, 4718 flow. Second operand has 12 states, 12 states have (on average 185.33333333333334) internal successors, (2224), 12 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:23,838 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:53:23,838 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 348 [2021-03-25 12:53:23,838 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:53:24,302 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2021-03-25 12:53:27,644 INFO L129 PetriNetUnfolder]: 17921/25265 cut-off events. [2021-03-25 12:53:27,644 INFO L130 PetriNetUnfolder]: For 511841/512274 co-relation queries the response was YES. [2021-03-25 12:53:27,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152262 conditions, 25265 events. 17921/25265 cut-off events. For 511841/512274 co-relation queries the response was YES. Maximal size of possible extension queue 1260. Compared 153750 event pairs, 2983 based on Foata normal form. 204/19508 useless extension candidates. Maximal degree in co-relation 138540. Up to 12217 conditions per place. [2021-03-25 12:53:27,874 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 195 selfloop transitions, 76 changer transitions 13/315 dead transitions. [2021-03-25 12:53:27,874 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 315 transitions, 6249 flow [2021-03-25 12:53:27,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:53:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:53:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1738 transitions. [2021-03-25 12:53:27,876 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5549169859514687 [2021-03-25 12:53:27,876 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1738 transitions. [2021-03-25 12:53:27,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1738 transitions. [2021-03-25 12:53:27,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:53:27,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1738 transitions. [2021-03-25 12:53:27,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 193.11111111111111) internal successors, (1738), 9 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:27,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:27,879 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:27,879 INFO L185 Difference]: Start difference. First operand has 193 places, 253 transitions, 4718 flow. Second operand 9 states and 1738 transitions. [2021-03-25 12:53:27,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 315 transitions, 6249 flow [2021-03-25 12:53:28,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 315 transitions, 6106 flow, removed 16 selfloop flow, removed 9 redundant places. [2021-03-25 12:53:28,864 INFO L241 Difference]: Finished difference. Result has 192 places, 250 transitions, 4662 flow [2021-03-25 12:53:28,864 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4537, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4662, PETRI_PLACES=192, PETRI_TRANSITIONS=250} [2021-03-25 12:53:28,864 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 128 predicate places. [2021-03-25 12:53:28,864 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:53:28,864 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 250 transitions, 4662 flow [2021-03-25 12:53:28,864 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 250 transitions, 4662 flow [2021-03-25 12:53:28,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 192 places, 250 transitions, 4662 flow [2021-03-25 12:53:29,497 INFO L129 PetriNetUnfolder]: 4669/8714 cut-off events. [2021-03-25 12:53:29,498 INFO L130 PetriNetUnfolder]: For 71860/73372 co-relation queries the response was YES. [2021-03-25 12:53:29,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28989 conditions, 8714 events. 4669/8714 cut-off events. For 71860/73372 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 72395 event pairs, 12 based on Foata normal form. 308/6313 useless extension candidates. Maximal degree in co-relation 27730. Up to 2304 conditions per place. [2021-03-25 12:53:29,845 INFO L142 LiptonReduction]: Number of co-enabled transitions 4018 [2021-03-25 12:53:29,855 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:53:29,855 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:53:29,855 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 991 [2021-03-25 12:53:29,855 INFO L480 AbstractCegarLoop]: Abstraction has has 192 places, 250 transitions, 4662 flow [2021-03-25 12:53:29,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 185.33333333333334) internal successors, (2224), 12 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:29,855 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:53:29,856 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:53:29,856 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-03-25 12:53:29,856 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:53:29,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:53:29,856 INFO L82 PathProgramCache]: Analyzing trace with hash 253186649, now seen corresponding path program 1 times [2021-03-25 12:53:29,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:53:29,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347413188] [2021-03-25 12:53:29,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:53:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:53:29,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:29,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:53:29,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:29,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 12:53:29,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:29,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:53:29,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:29,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:53:29,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:29,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:53:29,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:29,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:53:29,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:29,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:53:29,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:29,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:53:29,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:29,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:53:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:53:29,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347413188] [2021-03-25 12:53:29,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:53:29,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 12:53:29,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327668038] [2021-03-25 12:53:29,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 12:53:29,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:53:29,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 12:53:29,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-03-25 12:53:29,969 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 348 [2021-03-25 12:53:29,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 250 transitions, 4662 flow. Second operand has 10 states, 10 states have (on average 190.6) internal successors, (1906), 10 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:29,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:53:29,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 348 [2021-03-25 12:53:29,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:53:33,102 INFO L129 PetriNetUnfolder]: 16465/23785 cut-off events. [2021-03-25 12:53:33,102 INFO L130 PetriNetUnfolder]: For 495116/495133 co-relation queries the response was YES. [2021-03-25 12:53:33,259 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141224 conditions, 23785 events. 16465/23785 cut-off events. For 495116/495133 co-relation queries the response was YES. Maximal size of possible extension queue 1245. Compared 151368 event pairs, 3404 based on Foata normal form. 424/18543 useless extension candidates. Maximal degree in co-relation 130926. Up to 9847 conditions per place. [2021-03-25 12:53:33,300 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 226 selfloop transitions, 64 changer transitions 27/352 dead transitions. [2021-03-25 12:53:33,300 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 352 transitions, 6993 flow [2021-03-25 12:53:33,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:53:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:53:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1802 transitions. [2021-03-25 12:53:33,303 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5753512132822478 [2021-03-25 12:53:33,303 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1802 transitions. [2021-03-25 12:53:33,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1802 transitions. [2021-03-25 12:53:33,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:53:33,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1802 transitions. [2021-03-25 12:53:33,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 200.22222222222223) internal successors, (1802), 9 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:33,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:33,307 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:33,307 INFO L185 Difference]: Start difference. First operand has 192 places, 250 transitions, 4662 flow. Second operand 9 states and 1802 transitions. [2021-03-25 12:53:33,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 352 transitions, 6993 flow [2021-03-25 12:53:34,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 352 transitions, 6888 flow, removed 22 selfloop flow, removed 6 redundant places. [2021-03-25 12:53:34,290 INFO L241 Difference]: Finished difference. Result has 197 places, 254 transitions, 4776 flow [2021-03-25 12:53:34,290 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4397, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4776, PETRI_PLACES=197, PETRI_TRANSITIONS=254} [2021-03-25 12:53:34,290 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 133 predicate places. [2021-03-25 12:53:34,290 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:53:34,290 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 254 transitions, 4776 flow [2021-03-25 12:53:34,290 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 254 transitions, 4776 flow [2021-03-25 12:53:34,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 197 places, 254 transitions, 4776 flow [2021-03-25 12:53:34,706 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] thread3ENTRY-->thread3EXIT: Formula: (and (= (store |v_#memory_int_142| v_~v~0.base_49 (store (select |v_#memory_int_142| v_~v~0.base_49) v_~v~0.offset_49 89)) |v_#memory_int_141|) (= |v_thread3Thread1of1ForFork0_#res.base_9| 0) (= v_thread3Thread1of1ForFork0_~arg.offset_11 |v_thread3Thread1of1ForFork0_#in~arg.offset_11|) (= v_thread3Thread1of1ForFork0_~arg.base_11 |v_thread3Thread1of1ForFork0_#in~arg.base_11|) (= |v_thread3Thread1of1ForFork0_#res.offset_9| 0)) InVars {thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, #memory_int=|v_#memory_int_142|, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} OutVars{thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_9|, #memory_int=|v_#memory_int_141|, thread3Thread1of1ForFork0_~arg.offset=v_thread3Thread1of1ForFork0_~arg.offset_11, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_9|, thread3Thread1of1ForFork0_~arg.base=v_thread3Thread1of1ForFork0_~arg.base_11, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, #memory_int, thread3Thread1of1ForFork0_~arg.offset, thread3Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork0_~arg.base][200], [Black: 504#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 529#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 531#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 655#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 523#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 527#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 153#thread3EXITtrue, Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 35#thread2EXITtrue, Black: 544#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 548#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), 43#thread2EXITtrue, Black: 674#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 686#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread2Thread1of1ForFork5_thidvar0 1)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, Black: 563#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 571#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= thread2Thread1of1ForFork5_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 73#ULTIMATE.startEXITtrue, 586#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 715#true, Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 588#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 590#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 601#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 723#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 607#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 730#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 734#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 610#true, Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 362#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 480#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 496#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|))), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 631#(and (or (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|))) (or (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (and (= thread2Thread1of1ForFork5_thidvar0 1) (= |thread0Thread1of1ForFork4_~#t3~0.offset| |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)) (or (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|))))), 123#L1152-2true, Black: 619#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 502#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|))]) [2021-03-25 12:53:34,706 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-25 12:53:34,706 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 12:53:34,706 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 12:53:34,706 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 12:53:34,905 INFO L129 PetriNetUnfolder]: 4638/8674 cut-off events. [2021-03-25 12:53:34,905 INFO L130 PetriNetUnfolder]: For 63786/65159 co-relation queries the response was YES. [2021-03-25 12:53:34,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27487 conditions, 8674 events. 4638/8674 cut-off events. For 63786/65159 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 71981 event pairs, 13 based on Foata normal form. 223/6110 useless extension candidates. Maximal degree in co-relation 26286. Up to 2384 conditions per place. [2021-03-25 12:53:35,258 INFO L142 LiptonReduction]: Number of co-enabled transitions 3818 [2021-03-25 12:53:35,268 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:53:35,268 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:53:35,268 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 978 [2021-03-25 12:53:35,269 INFO L480 AbstractCegarLoop]: Abstraction has has 197 places, 254 transitions, 4776 flow [2021-03-25 12:53:35,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 190.6) internal successors, (1906), 10 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:35,269 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:53:35,269 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:53:35,269 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-03-25 12:53:35,269 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:53:35,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:53:35,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1642776239, now seen corresponding path program 2 times [2021-03-25 12:53:35,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:53:35,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839714108] [2021-03-25 12:53:35,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:53:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:53:35,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:35,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:53:35,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:35,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 12:53:35,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:35,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:53:35,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:35,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:53:35,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:35,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:53:35,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:35,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:53:35,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:35,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:53:35,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:35,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:53:35,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:35,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:53:35,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:53:35,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839714108] [2021-03-25 12:53:35,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:53:35,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 12:53:35,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370395053] [2021-03-25 12:53:35,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 12:53:35,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:53:35,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 12:53:35,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-03-25 12:53:35,385 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 348 [2021-03-25 12:53:35,385 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 254 transitions, 4776 flow. Second operand has 10 states, 10 states have (on average 190.6) internal successors, (1906), 10 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:35,385 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:53:35,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 348 [2021-03-25 12:53:35,386 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:53:38,464 INFO L129 PetriNetUnfolder]: 15318/22180 cut-off events. [2021-03-25 12:53:38,464 INFO L130 PetriNetUnfolder]: For 432220/432298 co-relation queries the response was YES. [2021-03-25 12:53:38,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129070 conditions, 22180 events. 15318/22180 cut-off events. For 432220/432298 co-relation queries the response was YES. Maximal size of possible extension queue 1202. Compared 140990 event pairs, 3324 based on Foata normal form. 100/16902 useless extension candidates. Maximal degree in co-relation 120516. Up to 16710 conditions per place. [2021-03-25 12:53:38,665 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 212 selfloop transitions, 38 changer transitions 3/288 dead transitions. [2021-03-25 12:53:38,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 288 transitions, 5830 flow [2021-03-25 12:53:38,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:53:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:53:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1392 transitions. [2021-03-25 12:53:38,668 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2021-03-25 12:53:38,668 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1392 transitions. [2021-03-25 12:53:38,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1392 transitions. [2021-03-25 12:53:38,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:53:38,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1392 transitions. [2021-03-25 12:53:38,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 198.85714285714286) internal successors, (1392), 7 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:38,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:38,672 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:38,672 INFO L185 Difference]: Start difference. First operand has 197 places, 254 transitions, 4776 flow. Second operand 7 states and 1392 transitions. [2021-03-25 12:53:38,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 288 transitions, 5830 flow [2021-03-25 12:53:39,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 288 transitions, 5799 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 12:53:39,290 INFO L241 Difference]: Finished difference. Result has 203 places, 256 transitions, 4889 flow [2021-03-25 12:53:39,290 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4661, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4889, PETRI_PLACES=203, PETRI_TRANSITIONS=256} [2021-03-25 12:53:39,290 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 139 predicate places. [2021-03-25 12:53:39,290 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:53:39,290 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 256 transitions, 4889 flow [2021-03-25 12:53:39,291 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 256 transitions, 4889 flow [2021-03-25 12:53:39,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 203 places, 256 transitions, 4889 flow [2021-03-25 12:53:40,111 INFO L129 PetriNetUnfolder]: 4619/8644 cut-off events. [2021-03-25 12:53:40,111 INFO L130 PetriNetUnfolder]: For 63955/65397 co-relation queries the response was YES. [2021-03-25 12:53:40,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27123 conditions, 8644 events. 4619/8644 cut-off events. For 63955/65397 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 71602 event pairs, 15 based on Foata normal form. 215/6087 useless extension candidates. Maximal degree in co-relation 25913. Up to 2390 conditions per place. [2021-03-25 12:53:40,266 INFO L142 LiptonReduction]: Number of co-enabled transitions 3754 [2021-03-25 12:53:40,276 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:53:40,276 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:53:40,276 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 986 [2021-03-25 12:53:40,277 INFO L480 AbstractCegarLoop]: Abstraction has has 203 places, 256 transitions, 4889 flow [2021-03-25 12:53:40,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 190.6) internal successors, (1906), 10 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:40,277 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:53:40,277 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:53:40,277 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-03-25 12:53:40,277 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:53:40,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:53:40,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1762518449, now seen corresponding path program 3 times [2021-03-25 12:53:40,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:53:40,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067964537] [2021-03-25 12:53:40,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:53:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:53:40,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:40,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 12:53:40,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:40,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 12:53:40,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:40,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 12:53:40,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:40,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 12:53:40,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:40,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:53:40,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:40,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:53:40,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:40,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:53:40,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:40,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:53:40,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:40,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:53:40,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:40,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:53:40,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:40,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:53:40,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:40,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:53:40,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:53:40,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067964537] [2021-03-25 12:53:40,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:53:40,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 12:53:40,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987087770] [2021-03-25 12:53:40,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 12:53:40,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:53:40,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 12:53:40,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-03-25 12:53:40,524 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 348 [2021-03-25 12:53:40,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 256 transitions, 4889 flow. Second operand has 12 states, 12 states have (on average 187.33333333333334) internal successors, (2248), 12 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:40,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:53:40,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 348 [2021-03-25 12:53:40,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:53:43,891 INFO L129 PetriNetUnfolder]: 15915/23076 cut-off events. [2021-03-25 12:53:43,892 INFO L130 PetriNetUnfolder]: For 442568/442646 co-relation queries the response was YES. [2021-03-25 12:53:44,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132253 conditions, 23076 events. 15915/23076 cut-off events. For 442568/442646 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 147100 event pairs, 3159 based on Foata normal form. 91/17485 useless extension candidates. Maximal degree in co-relation 123806. Up to 15964 conditions per place. [2021-03-25 12:53:44,091 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 231 selfloop transitions, 42 changer transitions 11/319 dead transitions. [2021-03-25 12:53:44,091 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 319 transitions, 6675 flow [2021-03-25 12:53:44,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:53:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:53:44,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1374 transitions. [2021-03-25 12:53:44,093 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5640394088669951 [2021-03-25 12:53:44,093 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1374 transitions. [2021-03-25 12:53:44,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1374 transitions. [2021-03-25 12:53:44,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:53:44,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1374 transitions. [2021-03-25 12:53:44,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 196.28571428571428) internal successors, (1374), 7 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:44,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:44,096 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:44,096 INFO L185 Difference]: Start difference. First operand has 203 places, 256 transitions, 4889 flow. Second operand 7 states and 1374 transitions. [2021-03-25 12:53:44,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 319 transitions, 6675 flow [2021-03-25 12:53:44,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 319 transitions, 6643 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 12:53:44,741 INFO L241 Difference]: Finished difference. Result has 210 places, 261 transitions, 5123 flow [2021-03-25 12:53:44,741 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4848, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5123, PETRI_PLACES=210, PETRI_TRANSITIONS=261} [2021-03-25 12:53:44,741 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 146 predicate places. [2021-03-25 12:53:44,741 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:53:44,741 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 261 transitions, 5123 flow [2021-03-25 12:53:44,741 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 261 transitions, 5123 flow [2021-03-25 12:53:44,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 210 places, 261 transitions, 5123 flow [2021-03-25 12:53:45,364 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] thread3ENTRY-->thread3EXIT: Formula: (and (= (store |v_#memory_int_142| v_~v~0.base_49 (store (select |v_#memory_int_142| v_~v~0.base_49) v_~v~0.offset_49 89)) |v_#memory_int_141|) (= |v_thread3Thread1of1ForFork0_#res.base_9| 0) (= v_thread3Thread1of1ForFork0_~arg.offset_11 |v_thread3Thread1of1ForFork0_#in~arg.offset_11|) (= v_thread3Thread1of1ForFork0_~arg.base_11 |v_thread3Thread1of1ForFork0_#in~arg.base_11|) (= |v_thread3Thread1of1ForFork0_#res.offset_9| 0)) InVars {thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, #memory_int=|v_#memory_int_142|, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} OutVars{thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_9|, #memory_int=|v_#memory_int_141|, thread3Thread1of1ForFork0_~arg.offset=v_thread3Thread1of1ForFork0_~arg.offset_11, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_9|, thread3Thread1of1ForFork0_~arg.base=v_thread3Thread1of1ForFork0_~arg.base_11, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, #memory_int, thread3Thread1of1ForFork0_~arg.offset, thread3Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork0_~arg.base][204], [Black: 504#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 770#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)), Black: 776#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= thread2Thread1of1ForFork1_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 778#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= thread2Thread1of1ForFork1_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 529#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 531#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 655#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 523#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 527#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 153#thread3EXITtrue, Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 35#thread2EXITtrue, Black: 544#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 548#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), 43#thread2EXITtrue, Black: 674#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 686#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread2Thread1of1ForFork5_thidvar0 1)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, Black: 563#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 571#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= thread2Thread1of1ForFork5_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 73#ULTIMATE.startEXITtrue, 586#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 588#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 590#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 601#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 723#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 607#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 730#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 734#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 610#true, Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), 362#true, Black: 480#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 496#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|))), Black: 752#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork1_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 748#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)), Black: 750#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 759#true, Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 631#(and (or (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|))) (or (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (and (= thread2Thread1of1ForFork5_thidvar0 1) (= |thread0Thread1of1ForFork4_~#t3~0.offset| |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)) (or (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|))))), Black: 619#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), 123#L1152-2true, Black: 502#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|))]) [2021-03-25 12:53:45,364 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-25 12:53:45,364 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 12:53:45,364 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 12:53:45,364 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 12:53:45,578 INFO L129 PetriNetUnfolder]: 4765/8899 cut-off events. [2021-03-25 12:53:45,578 INFO L130 PetriNetUnfolder]: For 66186/67615 co-relation queries the response was YES. [2021-03-25 12:53:45,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27894 conditions, 8899 events. 4765/8899 cut-off events. For 66186/67615 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 74007 event pairs, 8 based on Foata normal form. 211/6176 useless extension candidates. Maximal degree in co-relation 26647. Up to 2492 conditions per place. [2021-03-25 12:53:45,737 INFO L142 LiptonReduction]: Number of co-enabled transitions 3834 [2021-03-25 12:53:45,748 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:53:45,748 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:53:45,748 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1007 [2021-03-25 12:53:45,748 INFO L480 AbstractCegarLoop]: Abstraction has has 210 places, 261 transitions, 5123 flow [2021-03-25 12:53:45,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 187.33333333333334) internal successors, (2248), 12 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:45,749 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:53:45,749 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:53:45,749 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-03-25 12:53:45,749 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:53:45,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:53:45,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1071976973, now seen corresponding path program 1 times [2021-03-25 12:53:45,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:53:45,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247598887] [2021-03-25 12:53:45,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:53:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:53:45,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:45,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:53:45,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:45,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 12:53:45,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:45,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 12:53:45,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:45,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 12:53:45,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:45,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:53:45,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:45,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 12:53:45,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:45,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 12:53:45,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:45,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 12:53:46,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:46,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 12:53:46,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:46,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:53:46,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:46,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:53:46,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:46,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:53:46,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:46,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:53:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:53:46,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247598887] [2021-03-25 12:53:46,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:53:46,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 12:53:46,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100383918] [2021-03-25 12:53:46,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 12:53:46,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:53:46,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 12:53:46,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-03-25 12:53:46,092 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 348 [2021-03-25 12:53:46,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 261 transitions, 5123 flow. Second operand has 12 states, 12 states have (on average 185.41666666666666) internal successors, (2225), 12 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:46,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:53:46,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 348 [2021-03-25 12:53:46,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:53:49,746 INFO L129 PetriNetUnfolder]: 15664/22620 cut-off events. [2021-03-25 12:53:49,746 INFO L130 PetriNetUnfolder]: For 460253/460484 co-relation queries the response was YES. [2021-03-25 12:53:49,878 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130640 conditions, 22620 events. 15664/22620 cut-off events. For 460253/460484 co-relation queries the response was YES. Maximal size of possible extension queue 1167. Compared 142098 event pairs, 2844 based on Foata normal form. 118/17188 useless extension candidates. Maximal degree in co-relation 123226. Up to 11161 conditions per place. [2021-03-25 12:53:49,910 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 169 selfloop transitions, 86 changer transitions 23/317 dead transitions. [2021-03-25 12:53:49,910 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 317 transitions, 6533 flow [2021-03-25 12:53:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:53:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:53:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1734 transitions. [2021-03-25 12:53:49,912 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.553639846743295 [2021-03-25 12:53:49,913 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1734 transitions. [2021-03-25 12:53:49,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1734 transitions. [2021-03-25 12:53:49,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:53:49,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1734 transitions. [2021-03-25 12:53:49,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 192.66666666666666) internal successors, (1734), 9 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:49,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:49,917 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:49,917 INFO L185 Difference]: Start difference. First operand has 210 places, 261 transitions, 5123 flow. Second operand 9 states and 1734 transitions. [2021-03-25 12:53:49,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 317 transitions, 6533 flow [2021-03-25 12:53:50,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 317 transitions, 6376 flow, removed 3 selfloop flow, removed 14 redundant places. [2021-03-25 12:53:50,524 INFO L241 Difference]: Finished difference. Result has 204 places, 244 transitions, 4729 flow [2021-03-25 12:53:50,524 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4626, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4729, PETRI_PLACES=204, PETRI_TRANSITIONS=244} [2021-03-25 12:53:50,524 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 140 predicate places. [2021-03-25 12:53:50,524 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:53:50,524 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 244 transitions, 4729 flow [2021-03-25 12:53:50,524 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 244 transitions, 4729 flow [2021-03-25 12:53:50,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 204 places, 244 transitions, 4729 flow [2021-03-25 12:53:51,343 INFO L129 PetriNetUnfolder]: 4485/8423 cut-off events. [2021-03-25 12:53:51,343 INFO L130 PetriNetUnfolder]: For 59455/60588 co-relation queries the response was YES. [2021-03-25 12:53:51,398 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25171 conditions, 8423 events. 4485/8423 cut-off events. For 59455/60588 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 70023 event pairs, 8 based on Foata normal form. 180/5834 useless extension candidates. Maximal degree in co-relation 24421. Up to 2370 conditions per place. [2021-03-25 12:53:51,479 INFO L142 LiptonReduction]: Number of co-enabled transitions 3356 [2021-03-25 12:53:51,488 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:53:51,489 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:53:51,489 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 965 [2021-03-25 12:53:51,489 INFO L480 AbstractCegarLoop]: Abstraction has has 204 places, 244 transitions, 4729 flow [2021-03-25 12:53:51,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 185.41666666666666) internal successors, (2225), 12 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:51,490 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:53:51,490 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:53:51,490 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-03-25 12:53:51,490 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:53:51,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:53:51,490 INFO L82 PathProgramCache]: Analyzing trace with hash 95235625, now seen corresponding path program 1 times [2021-03-25 12:53:51,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:53:51,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120028165] [2021-03-25 12:53:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:53:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:53:51,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:51,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:53:51,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:51,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 12:53:51,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:51,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 12:53:51,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:51,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 12:53:51,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:51,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:53:51,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:51,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:53:51,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:51,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:53:51,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:51,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:53:51,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:51,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:53:51,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:51,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:53:51,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:51,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:53:51,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:51,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:53:51,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:51,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:53:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:53:51,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120028165] [2021-03-25 12:53:51,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:53:51,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 12:53:51,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854195358] [2021-03-25 12:53:51,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 12:53:51,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:53:51,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 12:53:51,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-03-25 12:53:51,789 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 348 [2021-03-25 12:53:51,790 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 244 transitions, 4729 flow. Second operand has 12 states, 12 states have (on average 185.41666666666666) internal successors, (2225), 12 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:51,790 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:53:51,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 348 [2021-03-25 12:53:51,790 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:53:54,927 INFO L129 PetriNetUnfolder]: 13916/20511 cut-off events. [2021-03-25 12:53:54,928 INFO L130 PetriNetUnfolder]: For 400195/400276 co-relation queries the response was YES. [2021-03-25 12:53:55,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114792 conditions, 20511 events. 13916/20511 cut-off events. For 400195/400276 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 132785 event pairs, 2268 based on Foata normal form. 93/15476 useless extension candidates. Maximal degree in co-relation 106907. Up to 13911 conditions per place. [2021-03-25 12:53:55,079 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 194 selfloop transitions, 49 changer transitions 25/303 dead transitions. [2021-03-25 12:53:55,079 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 303 transitions, 6117 flow [2021-03-25 12:53:55,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:53:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:53:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1737 transitions. [2021-03-25 12:53:55,081 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5545977011494253 [2021-03-25 12:53:55,081 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1737 transitions. [2021-03-25 12:53:55,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1737 transitions. [2021-03-25 12:53:55,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:53:55,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1737 transitions. [2021-03-25 12:53:55,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 193.0) internal successors, (1737), 9 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:55,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:55,085 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:55,086 INFO L185 Difference]: Start difference. First operand has 204 places, 244 transitions, 4729 flow. Second operand 9 states and 1737 transitions. [2021-03-25 12:53:55,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 303 transitions, 6117 flow [2021-03-25 12:53:55,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 303 transitions, 5803 flow, removed 84 selfloop flow, removed 7 redundant places. [2021-03-25 12:53:55,651 INFO L241 Difference]: Finished difference. Result has 206 places, 235 transitions, 4346 flow [2021-03-25 12:53:55,651 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4413, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4346, PETRI_PLACES=206, PETRI_TRANSITIONS=235} [2021-03-25 12:53:55,651 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 142 predicate places. [2021-03-25 12:53:55,651 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:53:55,652 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 235 transitions, 4346 flow [2021-03-25 12:53:55,652 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 235 transitions, 4346 flow [2021-03-25 12:53:55,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 206 places, 235 transitions, 4346 flow [2021-03-25 12:53:56,368 INFO L129 PetriNetUnfolder]: 3974/7460 cut-off events. [2021-03-25 12:53:56,368 INFO L130 PetriNetUnfolder]: For 40207/40364 co-relation queries the response was YES. [2021-03-25 12:53:56,425 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20486 conditions, 7460 events. 3974/7460 cut-off events. For 40207/40364 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 60588 event pairs, 29 based on Foata normal form. 68/5027 useless extension candidates. Maximal degree in co-relation 19945. Up to 2136 conditions per place. [2021-03-25 12:53:56,497 INFO L142 LiptonReduction]: Number of co-enabled transitions 3084 [2021-03-25 12:53:56,506 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:53:56,506 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:53:56,506 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 855 [2021-03-25 12:53:56,507 INFO L480 AbstractCegarLoop]: Abstraction has has 206 places, 235 transitions, 4346 flow [2021-03-25 12:53:56,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 185.41666666666666) internal successors, (2225), 12 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:56,507 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:53:56,507 INFO L263 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] [2021-03-25 12:53:56,507 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-03-25 12:53:56,507 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:53:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:53:56,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1291294908, now seen corresponding path program 1 times [2021-03-25 12:53:56,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:53:56,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392382311] [2021-03-25 12:53:56,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:53:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:53:56,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:56,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:53:56,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:56,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 12:53:56,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:56,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:53:56,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:56,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:53:56,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:56,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:53:56,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:53:56,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392382311] [2021-03-25 12:53:56,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:53:56,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 12:53:56,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569921465] [2021-03-25 12:53:56,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 12:53:56,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:53:56,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 12:53:56,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 12:53:56,560 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 348 [2021-03-25 12:53:56,561 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 235 transitions, 4346 flow. Second operand has 6 states, 6 states have (on average 194.83333333333334) internal successors, (1169), 6 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:56,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:53:56,561 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 348 [2021-03-25 12:53:56,561 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:53:58,776 INFO L129 PetriNetUnfolder]: 11178/17014 cut-off events. [2021-03-25 12:53:58,777 INFO L130 PetriNetUnfolder]: For 300811/300849 co-relation queries the response was YES. [2021-03-25 12:53:58,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92520 conditions, 17014 events. 11178/17014 cut-off events. For 300811/300849 co-relation queries the response was YES. Maximal size of possible extension queue 986. Compared 113476 event pairs, 2515 based on Foata normal form. 178/12924 useless extension candidates. Maximal degree in co-relation 86759. Up to 11045 conditions per place. [2021-03-25 12:53:58,908 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 178 selfloop transitions, 5 changer transitions 73/288 dead transitions. [2021-03-25 12:53:58,908 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 288 transitions, 5806 flow [2021-03-25 12:53:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 12:53:58,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 12:53:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1597 transitions. [2021-03-25 12:53:58,911 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5736350574712644 [2021-03-25 12:53:58,911 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1597 transitions. [2021-03-25 12:53:58,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1597 transitions. [2021-03-25 12:53:58,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:53:58,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1597 transitions. [2021-03-25 12:53:58,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 199.625) internal successors, (1597), 8 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:58,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:58,915 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:58,915 INFO L185 Difference]: Start difference. First operand has 206 places, 235 transitions, 4346 flow. Second operand 8 states and 1597 transitions. [2021-03-25 12:53:58,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 288 transitions, 5806 flow [2021-03-25 12:53:59,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 288 transitions, 5250 flow, removed 39 selfloop flow, removed 19 redundant places. [2021-03-25 12:53:59,344 INFO L241 Difference]: Finished difference. Result has 196 places, 214 transitions, 3536 flow [2021-03-25 12:53:59,344 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3741, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3536, PETRI_PLACES=196, PETRI_TRANSITIONS=214} [2021-03-25 12:53:59,344 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 132 predicate places. [2021-03-25 12:53:59,344 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:53:59,344 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 214 transitions, 3536 flow [2021-03-25 12:53:59,345 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 196 places, 214 transitions, 3536 flow [2021-03-25 12:53:59,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 180 places, 214 transitions, 3536 flow [2021-03-25 12:53:59,696 INFO L129 PetriNetUnfolder]: 3043/5689 cut-off events. [2021-03-25 12:53:59,697 INFO L130 PetriNetUnfolder]: For 25856/26401 co-relation queries the response was YES. [2021-03-25 12:53:59,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14662 conditions, 5689 events. 3043/5689 cut-off events. For 25856/26401 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 43967 event pairs, 10 based on Foata normal form. 141/3895 useless extension candidates. Maximal degree in co-relation 14555. Up to 1624 conditions per place. [2021-03-25 12:53:59,785 INFO L142 LiptonReduction]: Number of co-enabled transitions 2804 [2021-03-25 12:53:59,796 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:53:59,796 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:53:59,797 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 453 [2021-03-25 12:53:59,797 INFO L480 AbstractCegarLoop]: Abstraction has has 180 places, 214 transitions, 3536 flow [2021-03-25 12:53:59,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 194.83333333333334) internal successors, (1169), 6 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:53:59,797 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:53:59,797 INFO L263 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] [2021-03-25 12:53:59,798 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-03-25 12:53:59,798 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:53:59,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:53:59,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1251056328, now seen corresponding path program 2 times [2021-03-25 12:53:59,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:53:59,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155197964] [2021-03-25 12:53:59,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:53:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:53:59,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:59,984 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2021-03-25 12:53:59,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:53:59,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:53:59,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:54:00,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:00,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:54:00,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:00,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 12:54:00,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:00,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:54:00,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:00,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:54:00,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:00,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:54:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:54:00,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155197964] [2021-03-25 12:54:00,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:54:00,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 12:54:00,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650662629] [2021-03-25 12:54:00,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 12:54:00,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:54:00,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 12:54:00,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-25 12:54:00,056 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 348 [2021-03-25 12:54:00,057 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 214 transitions, 3536 flow. Second operand has 8 states, 8 states have (on average 193.125) internal successors, (1545), 8 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:00,057 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:54:00,057 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 348 [2021-03-25 12:54:00,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:54:01,852 INFO L129 PetriNetUnfolder]: 9386/14152 cut-off events. [2021-03-25 12:54:01,852 INFO L130 PetriNetUnfolder]: For 195203/195203 co-relation queries the response was YES. [2021-03-25 12:54:01,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71844 conditions, 14152 events. 9386/14152 cut-off events. For 195203/195203 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 90586 event pairs, 2204 based on Foata normal form. 108/10681 useless extension candidates. Maximal degree in co-relation 71693. Up to 9526 conditions per place. [2021-03-25 12:54:01,958 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 157 selfloop transitions, 6 changer transitions 71/265 dead transitions. [2021-03-25 12:54:01,958 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 265 transitions, 4868 flow [2021-03-25 12:54:01,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:54:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:54:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1782 transitions. [2021-03-25 12:54:01,960 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2021-03-25 12:54:01,960 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1782 transitions. [2021-03-25 12:54:01,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1782 transitions. [2021-03-25 12:54:01,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:54:01,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1782 transitions. [2021-03-25 12:54:01,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:01,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:01,963 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:01,963 INFO L185 Difference]: Start difference. First operand has 180 places, 214 transitions, 3536 flow. Second operand 9 states and 1782 transitions. [2021-03-25 12:54:01,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 265 transitions, 4868 flow [2021-03-25 12:54:02,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 265 transitions, 4745 flow, removed 26 selfloop flow, removed 16 redundant places. [2021-03-25 12:54:02,211 INFO L241 Difference]: Finished difference. Result has 174 places, 194 transitions, 3084 flow [2021-03-25 12:54:02,212 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3344, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3084, PETRI_PLACES=174, PETRI_TRANSITIONS=194} [2021-03-25 12:54:02,212 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 110 predicate places. [2021-03-25 12:54:02,212 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:54:02,212 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 194 transitions, 3084 flow [2021-03-25 12:54:02,212 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 194 transitions, 3084 flow [2021-03-25 12:54:02,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 166 places, 194 transitions, 3084 flow [2021-03-25 12:54:02,476 INFO L129 PetriNetUnfolder]: 2546/4732 cut-off events. [2021-03-25 12:54:02,477 INFO L130 PetriNetUnfolder]: For 18909/19331 co-relation queries the response was YES. [2021-03-25 12:54:02,502 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11828 conditions, 4732 events. 2546/4732 cut-off events. For 18909/19331 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 35276 event pairs, 12 based on Foata normal form. 116/3227 useless extension candidates. Maximal degree in co-relation 11744. Up to 1368 conditions per place. [2021-03-25 12:54:02,539 INFO L142 LiptonReduction]: Number of co-enabled transitions 2616 [2021-03-25 12:54:02,546 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:54:02,546 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:54:02,546 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 334 [2021-03-25 12:54:02,546 INFO L480 AbstractCegarLoop]: Abstraction has has 166 places, 194 transitions, 3084 flow [2021-03-25 12:54:02,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 193.125) internal successors, (1545), 8 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:02,546 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:54:02,546 INFO L263 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] [2021-03-25 12:54:02,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-03-25 12:54:02,547 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:54:02,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:54:02,547 INFO L82 PathProgramCache]: Analyzing trace with hash -395795564, now seen corresponding path program 1 times [2021-03-25 12:54:02,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:54:02,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176259700] [2021-03-25 12:54:02,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:54:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:54:02,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:02,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:54:02,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:02,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:54:02,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:02,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:54:02,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:02,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:54:02,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:02,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 12:54:02,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:02,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:54:02,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:02,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:54:02,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:02,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:54:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:54:02,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176259700] [2021-03-25 12:54:02,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:54:02,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 12:54:02,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094314025] [2021-03-25 12:54:02,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 12:54:02,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:54:02,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 12:54:02,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-25 12:54:02,683 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 348 [2021-03-25 12:54:02,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 194 transitions, 3084 flow. Second operand has 9 states, 9 states have (on average 191.88888888888889) internal successors, (1727), 9 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:02,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:54:02,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 348 [2021-03-25 12:54:02,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:54:03,070 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-03-25 12:54:04,441 INFO L129 PetriNetUnfolder]: 7973/11985 cut-off events. [2021-03-25 12:54:04,441 INFO L130 PetriNetUnfolder]: For 154467/154486 co-relation queries the response was YES. [2021-03-25 12:54:04,492 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59800 conditions, 11985 events. 7973/11985 cut-off events. For 154467/154486 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 74675 event pairs, 1910 based on Foata normal form. 116/9051 useless extension candidates. Maximal degree in co-relation 59713. Up to 7967 conditions per place. [2021-03-25 12:54:04,520 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 135 selfloop transitions, 9 changer transitions 64/237 dead transitions. [2021-03-25 12:54:04,520 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 237 transitions, 4142 flow [2021-03-25 12:54:04,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 12:54:04,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 12:54:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1963 transitions. [2021-03-25 12:54:04,522 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5640804597701149 [2021-03-25 12:54:04,522 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1963 transitions. [2021-03-25 12:54:04,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1963 transitions. [2021-03-25 12:54:04,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:54:04,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1963 transitions. [2021-03-25 12:54:04,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 196.3) internal successors, (1963), 10 states have internal predecessors, (1963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:04,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:04,526 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:04,526 INFO L185 Difference]: Start difference. First operand has 166 places, 194 transitions, 3084 flow. Second operand 10 states and 1963 transitions. [2021-03-25 12:54:04,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 237 transitions, 4142 flow [2021-03-25 12:54:04,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 237 transitions, 4058 flow, removed 20 selfloop flow, removed 14 redundant places. [2021-03-25 12:54:04,724 INFO L241 Difference]: Finished difference. Result has 163 places, 172 transitions, 2529 flow [2021-03-25 12:54:04,724 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2920, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2529, PETRI_PLACES=163, PETRI_TRANSITIONS=172} [2021-03-25 12:54:04,724 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 99 predicate places. [2021-03-25 12:54:04,724 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:54:04,724 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 172 transitions, 2529 flow [2021-03-25 12:54:04,724 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 172 transitions, 2529 flow [2021-03-25 12:54:04,725 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 156 places, 172 transitions, 2529 flow [2021-03-25 12:54:04,925 INFO L129 PetriNetUnfolder]: 2026/3753 cut-off events. [2021-03-25 12:54:04,925 INFO L130 PetriNetUnfolder]: For 12785/12873 co-relation queries the response was YES. [2021-03-25 12:54:04,943 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9235 conditions, 3753 events. 2026/3753 cut-off events. For 12785/12873 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 26877 event pairs, 5 based on Foata normal form. 51/2514 useless extension candidates. Maximal degree in co-relation 8349. Up to 1084 conditions per place. [2021-03-25 12:54:04,970 INFO L142 LiptonReduction]: Number of co-enabled transitions 2428 [2021-03-25 12:54:04,976 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:54:04,976 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:54:04,976 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 252 [2021-03-25 12:54:04,976 INFO L480 AbstractCegarLoop]: Abstraction has has 156 places, 172 transitions, 2529 flow [2021-03-25 12:54:04,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 191.88888888888889) internal successors, (1727), 9 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:04,977 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:54:04,977 INFO L263 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] [2021-03-25 12:54:04,977 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-03-25 12:54:04,977 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:54:04,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:54:04,977 INFO L82 PathProgramCache]: Analyzing trace with hash 779695080, now seen corresponding path program 2 times [2021-03-25 12:54:04,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:54:04,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110304999] [2021-03-25 12:54:04,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:54:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:54:05,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:05,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:54:05,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:05,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:54:05,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:05,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:54:05,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:05,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:54:05,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:05,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:54:05,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:05,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 12:54:05,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:05,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:54:05,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:05,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:54:05,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:05,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:54:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:54:05,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110304999] [2021-03-25 12:54:05,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:54:05,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 12:54:05,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454437787] [2021-03-25 12:54:05,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 12:54:05,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:54:05,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 12:54:05,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-25 12:54:05,135 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 348 [2021-03-25 12:54:05,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 172 transitions, 2529 flow. Second operand has 10 states, 10 states have (on average 190.7) internal successors, (1907), 10 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:05,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:54:05,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 348 [2021-03-25 12:54:05,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:54:06,454 INFO L129 PetriNetUnfolder]: 6565/9844 cut-off events. [2021-03-25 12:54:06,454 INFO L130 PetriNetUnfolder]: For 123035/123036 co-relation queries the response was YES. [2021-03-25 12:54:06,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48853 conditions, 9844 events. 6565/9844 cut-off events. For 123035/123036 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 59055 event pairs, 1737 based on Foata normal form. 109/7443 useless extension candidates. Maximal degree in co-relation 43217. Up to 6453 conditions per place. [2021-03-25 12:54:06,516 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 119 selfloop transitions, 12 changer transitions 50/208 dead transitions. [2021-03-25 12:54:06,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 208 transitions, 3408 flow [2021-03-25 12:54:06,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 12:54:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 12:54:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1955 transitions. [2021-03-25 12:54:06,518 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5617816091954023 [2021-03-25 12:54:06,518 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1955 transitions. [2021-03-25 12:54:06,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1955 transitions. [2021-03-25 12:54:06,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:54:06,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1955 transitions. [2021-03-25 12:54:06,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 195.5) internal successors, (1955), 10 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:06,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:06,523 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:06,523 INFO L185 Difference]: Start difference. First operand has 156 places, 172 transitions, 2529 flow. Second operand 10 states and 1955 transitions. [2021-03-25 12:54:06,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 208 transitions, 3408 flow [2021-03-25 12:54:06,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 208 transitions, 3332 flow, removed 17 selfloop flow, removed 12 redundant places. [2021-03-25 12:54:06,695 INFO L241 Difference]: Finished difference. Result has 155 places, 157 transitions, 2158 flow [2021-03-25 12:54:06,695 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2369, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2158, PETRI_PLACES=155, PETRI_TRANSITIONS=157} [2021-03-25 12:54:06,695 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 91 predicate places. [2021-03-25 12:54:06,695 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:54:06,695 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 157 transitions, 2158 flow [2021-03-25 12:54:06,696 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 157 transitions, 2158 flow [2021-03-25 12:54:06,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 145 places, 157 transitions, 2158 flow [2021-03-25 12:54:06,833 INFO L129 PetriNetUnfolder]: 1529/2834 cut-off events. [2021-03-25 12:54:06,834 INFO L130 PetriNetUnfolder]: For 8869/8976 co-relation queries the response was YES. [2021-03-25 12:54:06,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6936 conditions, 2834 events. 1529/2834 cut-off events. For 8869/8976 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 19112 event pairs, 5 based on Foata normal form. 42/1881 useless extension candidates. Maximal degree in co-relation 6785. Up to 816 conditions per place. [2021-03-25 12:54:06,865 INFO L142 LiptonReduction]: Number of co-enabled transitions 2242 [2021-03-25 12:54:06,870 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:54:06,870 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:54:06,870 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 175 [2021-03-25 12:54:06,870 INFO L480 AbstractCegarLoop]: Abstraction has has 145 places, 157 transitions, 2158 flow [2021-03-25 12:54:06,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 190.7) internal successors, (1907), 10 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:06,871 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:54:06,871 INFO L263 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] [2021-03-25 12:54:06,871 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-03-25 12:54:06,871 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:54:06,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:54:06,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1777407144, now seen corresponding path program 3 times [2021-03-25 12:54:06,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:54:06,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688279363] [2021-03-25 12:54:06,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:54:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:54:06,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:06,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:54:06,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:06,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 12:54:06,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:06,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 12:54:06,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:06,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:54:06,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:06,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:54:06,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:06,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:54:06,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:06,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:54:06,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:06,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:54:07,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:07,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:54:07,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:07,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:54:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:54:07,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688279363] [2021-03-25 12:54:07,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:54:07,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 12:54:07,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366303176] [2021-03-25 12:54:07,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 12:54:07,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:54:07,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 12:54:07,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-03-25 12:54:07,022 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-25 12:54:07,023 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 157 transitions, 2158 flow. Second operand has 11 states, 11 states have (on average 188.54545454545453) internal successors, (2074), 11 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:07,023 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:54:07,023 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-25 12:54:07,023 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:54:08,137 INFO L129 PetriNetUnfolder]: 6597/9840 cut-off events. [2021-03-25 12:54:08,137 INFO L130 PetriNetUnfolder]: For 118663/118664 co-relation queries the response was YES. [2021-03-25 12:54:08,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47733 conditions, 9840 events. 6597/9840 cut-off events. For 118663/118664 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 58708 event pairs, 1599 based on Foata normal form. 55/7359 useless extension candidates. Maximal degree in co-relation 45057. Up to 6431 conditions per place. [2021-03-25 12:54:08,207 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 134 selfloop transitions, 18 changer transitions 30/209 dead transitions. [2021-03-25 12:54:08,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 209 transitions, 3046 flow [2021-03-25 12:54:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 12:54:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 12:54:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1581 transitions. [2021-03-25 12:54:08,209 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5678879310344828 [2021-03-25 12:54:08,210 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1581 transitions. [2021-03-25 12:54:08,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1581 transitions. [2021-03-25 12:54:08,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:54:08,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1581 transitions. [2021-03-25 12:54:08,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 197.625) internal successors, (1581), 8 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:08,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:08,213 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:08,213 INFO L185 Difference]: Start difference. First operand has 145 places, 157 transitions, 2158 flow. Second operand 8 states and 1581 transitions. [2021-03-25 12:54:08,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 209 transitions, 3046 flow [2021-03-25 12:54:08,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 209 transitions, 2976 flow, removed 21 selfloop flow, removed 13 redundant places. [2021-03-25 12:54:08,363 INFO L241 Difference]: Finished difference. Result has 143 places, 163 transitions, 2299 flow [2021-03-25 12:54:08,363 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2299, PETRI_PLACES=143, PETRI_TRANSITIONS=163} [2021-03-25 12:54:08,363 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 79 predicate places. [2021-03-25 12:54:08,363 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:54:08,363 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 163 transitions, 2299 flow [2021-03-25 12:54:08,363 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 163 transitions, 2299 flow [2021-03-25 12:54:08,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 141 places, 163 transitions, 2299 flow [2021-03-25 12:54:08,521 INFO L129 PetriNetUnfolder]: 1808/3321 cut-off events. [2021-03-25 12:54:08,522 INFO L130 PetriNetUnfolder]: For 10310/10503 co-relation queries the response was YES. [2021-03-25 12:54:08,535 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7922 conditions, 3321 events. 1808/3321 cut-off events. For 10310/10503 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 23069 event pairs, 6 based on Foata normal form. 53/2205 useless extension candidates. Maximal degree in co-relation 7486. Up to 976 conditions per place. [2021-03-25 12:54:08,560 INFO L142 LiptonReduction]: Number of co-enabled transitions 2340 [2021-03-25 12:54:08,565 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:54:08,565 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:54:08,565 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 202 [2021-03-25 12:54:08,565 INFO L480 AbstractCegarLoop]: Abstraction has has 141 places, 163 transitions, 2299 flow [2021-03-25 12:54:08,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 188.54545454545453) internal successors, (2074), 11 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:08,566 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:54:08,566 INFO L263 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] [2021-03-25 12:54:08,566 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-03-25 12:54:08,566 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:54:08,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:54:08,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1265588041, now seen corresponding path program 1 times [2021-03-25 12:54:08,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:54:08,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766878305] [2021-03-25 12:54:08,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:54:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:54:08,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:08,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:54:08,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:08,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 12:54:08,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:08,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 12:54:08,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:08,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 12:54:08,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:08,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:54:08,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:08,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:54:08,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:08,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:54:08,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:08,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:54:08,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:08,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:54:08,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:08,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:54:08,857 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-03-25 12:54:08,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:54:08,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:08,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:54:08,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:08,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:54:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:54:08,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766878305] [2021-03-25 12:54:08,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:54:08,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-25 12:54:08,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913121129] [2021-03-25 12:54:08,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-25 12:54:08,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:54:08,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-25 12:54:08,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-03-25 12:54:08,888 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 348 [2021-03-25 12:54:08,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 163 transitions, 2299 flow. Second operand has 13 states, 13 states have (on average 186.30769230769232) internal successors, (2422), 13 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:08,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:54:08,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 348 [2021-03-25 12:54:08,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:54:10,387 INFO L129 PetriNetUnfolder]: 7033/10572 cut-off events. [2021-03-25 12:54:10,387 INFO L130 PetriNetUnfolder]: For 126235/126252 co-relation queries the response was YES. [2021-03-25 12:54:10,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50941 conditions, 10572 events. 7033/10572 cut-off events. For 126235/126252 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 65336 event pairs, 364 based on Foata normal form. 114/8147 useless extension candidates. Maximal degree in co-relation 46944. Up to 5290 conditions per place. [2021-03-25 12:54:10,470 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 167 selfloop transitions, 52 changer transitions 19/265 dead transitions. [2021-03-25 12:54:10,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 265 transitions, 4092 flow [2021-03-25 12:54:10,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 12:54:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 12:54:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1951 transitions. [2021-03-25 12:54:10,472 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5606321839080459 [2021-03-25 12:54:10,472 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1951 transitions. [2021-03-25 12:54:10,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1951 transitions. [2021-03-25 12:54:10,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:54:10,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1951 transitions. [2021-03-25 12:54:10,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 195.1) internal successors, (1951), 10 states have internal predecessors, (1951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:10,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:10,476 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:10,477 INFO L185 Difference]: Start difference. First operand has 141 places, 163 transitions, 2299 flow. Second operand 10 states and 1951 transitions. [2021-03-25 12:54:10,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 265 transitions, 4092 flow [2021-03-25 12:54:10,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 265 transitions, 4024 flow, removed 27 selfloop flow, removed 3 redundant places. [2021-03-25 12:54:10,766 INFO L241 Difference]: Finished difference. Result has 150 places, 187 transitions, 2824 flow [2021-03-25 12:54:10,766 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2214, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2824, PETRI_PLACES=150, PETRI_TRANSITIONS=187} [2021-03-25 12:54:10,766 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 86 predicate places. [2021-03-25 12:54:10,766 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:54:10,766 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 187 transitions, 2824 flow [2021-03-25 12:54:10,766 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 187 transitions, 2824 flow [2021-03-25 12:54:10,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 148 places, 187 transitions, 2824 flow [2021-03-25 12:54:10,960 INFO L129 PetriNetUnfolder]: 2105/3932 cut-off events. [2021-03-25 12:54:10,960 INFO L130 PetriNetUnfolder]: For 16794/16841 co-relation queries the response was YES. [2021-03-25 12:54:10,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10311 conditions, 3932 events. 2105/3932 cut-off events. For 16794/16841 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 28336 event pairs, 4 based on Foata normal form. 36/2667 useless extension candidates. Maximal degree in co-relation 9886. Up to 1136 conditions per place. [2021-03-25 12:54:11,006 INFO L142 LiptonReduction]: Number of co-enabled transitions 2600 [2021-03-25 12:54:11,012 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:54:11,012 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:54:11,012 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 246 [2021-03-25 12:54:11,012 INFO L480 AbstractCegarLoop]: Abstraction has has 148 places, 187 transitions, 2824 flow [2021-03-25 12:54:11,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 186.30769230769232) internal successors, (2422), 13 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:11,013 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:54:11,013 INFO L263 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] [2021-03-25 12:54:11,013 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-03-25 12:54:11,013 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:54:11,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:54:11,013 INFO L82 PathProgramCache]: Analyzing trace with hash -26725849, now seen corresponding path program 1 times [2021-03-25 12:54:11,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:54:11,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390568634] [2021-03-25 12:54:11,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:54:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:54:11,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:11,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 12:54:11,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:11,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 12:54:11,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:11,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:54:11,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:11,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:54:11,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:11,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:54:11,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:11,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:54:11,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:11,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:54:11,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:11,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:54:11,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:11,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:54:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:54:11,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390568634] [2021-03-25 12:54:11,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:54:11,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 12:54:11,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576439176] [2021-03-25 12:54:11,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 12:54:11,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:54:11,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 12:54:11,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-03-25 12:54:11,134 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 348 [2021-03-25 12:54:11,135 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 187 transitions, 2824 flow. Second operand has 10 states, 10 states have (on average 189.8) internal successors, (1898), 10 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:11,135 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:54:11,135 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 348 [2021-03-25 12:54:11,135 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:54:12,253 INFO L129 PetriNetUnfolder]: 6818/10093 cut-off events. [2021-03-25 12:54:12,253 INFO L130 PetriNetUnfolder]: For 156433/156524 co-relation queries the response was YES. [2021-03-25 12:54:12,292 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52419 conditions, 10093 events. 6818/10093 cut-off events. For 156433/156524 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 59923 event pairs, 1446 based on Foata normal form. 72/7519 useless extension candidates. Maximal degree in co-relation 51111. Up to 7235 conditions per place. [2021-03-25 12:54:12,313 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 161 selfloop transitions, 10 changer transitions 20/219 dead transitions. [2021-03-25 12:54:12,313 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 219 transitions, 3654 flow [2021-03-25 12:54:12,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:54:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:54:12,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1373 transitions. [2021-03-25 12:54:12,315 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5636288998357963 [2021-03-25 12:54:12,315 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1373 transitions. [2021-03-25 12:54:12,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1373 transitions. [2021-03-25 12:54:12,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:54:12,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1373 transitions. [2021-03-25 12:54:12,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 196.14285714285714) internal successors, (1373), 7 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:12,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:12,317 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:12,317 INFO L185 Difference]: Start difference. First operand has 148 places, 187 transitions, 2824 flow. Second operand 7 states and 1373 transitions. [2021-03-25 12:54:12,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 219 transitions, 3654 flow [2021-03-25 12:54:12,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 219 transitions, 3593 flow, removed 26 selfloop flow, removed 3 redundant places. [2021-03-25 12:54:12,467 INFO L241 Difference]: Finished difference. Result has 153 places, 187 transitions, 2791 flow [2021-03-25 12:54:12,468 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2753, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2791, PETRI_PLACES=153, PETRI_TRANSITIONS=187} [2021-03-25 12:54:12,468 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 89 predicate places. [2021-03-25 12:54:12,468 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:54:12,468 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 187 transitions, 2791 flow [2021-03-25 12:54:12,468 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 187 transitions, 2791 flow [2021-03-25 12:54:12,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 153 places, 187 transitions, 2791 flow [2021-03-25 12:54:12,661 INFO L129 PetriNetUnfolder]: 2080/3897 cut-off events. [2021-03-25 12:54:12,661 INFO L130 PetriNetUnfolder]: For 15956/16022 co-relation queries the response was YES. [2021-03-25 12:54:12,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10004 conditions, 3897 events. 2080/3897 cut-off events. For 15956/16022 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 28120 event pairs, 4 based on Foata normal form. 45/2628 useless extension candidates. Maximal degree in co-relation 9745. Up to 1128 conditions per place. [2021-03-25 12:54:12,707 INFO L142 LiptonReduction]: Number of co-enabled transitions 2558 [2021-03-25 12:54:12,713 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:54:12,713 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:54:12,713 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 245 [2021-03-25 12:54:12,713 INFO L480 AbstractCegarLoop]: Abstraction has has 153 places, 187 transitions, 2791 flow [2021-03-25 12:54:12,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 189.8) internal successors, (1898), 10 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:12,716 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:54:12,716 INFO L263 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] [2021-03-25 12:54:12,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-03-25 12:54:12,716 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:54:12,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:54:12,717 INFO L82 PathProgramCache]: Analyzing trace with hash 416897403, now seen corresponding path program 1 times [2021-03-25 12:54:12,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:54:12,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226399757] [2021-03-25 12:54:12,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:54:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:54:12,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:12,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 12:54:12,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:12,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 12:54:12,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:12,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:54:12,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:12,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:54:12,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:12,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:54:12,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:12,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:54:12,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:12,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:54:12,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:12,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:54:12,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:12,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:54:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:54:12,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226399757] [2021-03-25 12:54:12,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:54:12,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 12:54:12,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130551198] [2021-03-25 12:54:12,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 12:54:12,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:54:12,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 12:54:12,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-03-25 12:54:12,849 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 348 [2021-03-25 12:54:12,849 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 187 transitions, 2791 flow. Second operand has 10 states, 10 states have (on average 189.8) internal successors, (1898), 10 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:12,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:54:12,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 348 [2021-03-25 12:54:12,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:54:13,867 INFO L129 PetriNetUnfolder]: 6326/9517 cut-off events. [2021-03-25 12:54:13,867 INFO L130 PetriNetUnfolder]: For 138432/138453 co-relation queries the response was YES. [2021-03-25 12:54:13,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49467 conditions, 9517 events. 6326/9517 cut-off events. For 138432/138453 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 57934 event pairs, 1455 based on Foata normal form. 38/7115 useless extension candidates. Maximal degree in co-relation 48438. Up to 6873 conditions per place. [2021-03-25 12:54:13,940 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 150 selfloop transitions, 5 changer transitions 35/217 dead transitions. [2021-03-25 12:54:13,940 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 217 transitions, 3609 flow [2021-03-25 12:54:13,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:54:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:54:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1372 transitions. [2021-03-25 12:54:13,942 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2021-03-25 12:54:13,942 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1372 transitions. [2021-03-25 12:54:13,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1372 transitions. [2021-03-25 12:54:13,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:54:13,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1372 transitions. [2021-03-25 12:54:13,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:13,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:13,944 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:13,944 INFO L185 Difference]: Start difference. First operand has 153 places, 187 transitions, 2791 flow. Second operand 7 states and 1372 transitions. [2021-03-25 12:54:13,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 217 transitions, 3609 flow [2021-03-25 12:54:14,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 217 transitions, 3590 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-03-25 12:54:14,087 INFO L241 Difference]: Finished difference. Result has 156 places, 181 transitions, 2706 flow [2021-03-25 12:54:14,087 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2737, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2706, PETRI_PLACES=156, PETRI_TRANSITIONS=181} [2021-03-25 12:54:14,087 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 92 predicate places. [2021-03-25 12:54:14,088 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:54:14,088 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 181 transitions, 2706 flow [2021-03-25 12:54:14,088 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 181 transitions, 2706 flow [2021-03-25 12:54:14,089 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 150 places, 181 transitions, 2706 flow [2021-03-25 12:54:14,269 INFO L129 PetriNetUnfolder]: 1924/3607 cut-off events. [2021-03-25 12:54:14,269 INFO L130 PetriNetUnfolder]: For 15015/15092 co-relation queries the response was YES. [2021-03-25 12:54:14,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9495 conditions, 3607 events. 1924/3607 cut-off events. For 15015/15092 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 25772 event pairs, 4 based on Foata normal form. 38/2405 useless extension candidates. Maximal degree in co-relation 8638. Up to 1040 conditions per place. [2021-03-25 12:54:14,312 INFO L142 LiptonReduction]: Number of co-enabled transitions 2468 [2021-03-25 12:54:14,318 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:54:14,318 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:54:14,318 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 230 [2021-03-25 12:54:14,319 INFO L480 AbstractCegarLoop]: Abstraction has has 150 places, 181 transitions, 2706 flow [2021-03-25 12:54:14,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 189.8) internal successors, (1898), 10 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:14,319 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:54:14,319 INFO L263 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] [2021-03-25 12:54:14,319 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-03-25 12:54:14,319 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:54:14,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:54:14,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1960449529, now seen corresponding path program 2 times [2021-03-25 12:54:14,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:54:14,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938215777] [2021-03-25 12:54:14,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:54:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:54:14,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:14,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:54:14,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:14,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 12:54:14,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:14,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:54:14,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:14,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:54:14,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:14,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:54:14,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:14,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:54:14,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:14,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 12:54:14,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:14,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:54:14,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:14,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:54:14,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:14,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:54:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:54:14,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938215777] [2021-03-25 12:54:14,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:54:14,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 12:54:14,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559015576] [2021-03-25 12:54:14,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 12:54:14,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:54:14,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 12:54:14,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-03-25 12:54:14,497 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-25 12:54:14,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 181 transitions, 2706 flow. Second operand has 10 states, 10 states have (on average 188.8) internal successors, (1888), 10 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:14,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:54:14,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-25 12:54:14,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:54:15,905 INFO L129 PetriNetUnfolder]: 7194/10658 cut-off events. [2021-03-25 12:54:15,906 INFO L130 PetriNetUnfolder]: For 163560/163649 co-relation queries the response was YES. [2021-03-25 12:54:15,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55703 conditions, 10658 events. 7194/10658 cut-off events. For 163560/163649 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 64025 event pairs, 1539 based on Foata normal form. 119/7980 useless extension candidates. Maximal degree in co-relation 51881. Up to 7267 conditions per place. [2021-03-25 12:54:15,986 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 169 selfloop transitions, 25 changer transitions 2/224 dead transitions. [2021-03-25 12:54:15,986 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 224 transitions, 3726 flow [2021-03-25 12:54:15,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 12:54:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 12:54:15,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2120 transitions. [2021-03-25 12:54:15,988 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5538140020898642 [2021-03-25 12:54:15,988 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2120 transitions. [2021-03-25 12:54:15,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2120 transitions. [2021-03-25 12:54:15,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:54:15,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2120 transitions. [2021-03-25 12:54:15,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 192.72727272727272) internal successors, (2120), 11 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:15,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:15,991 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:15,991 INFO L185 Difference]: Start difference. First operand has 150 places, 181 transitions, 2706 flow. Second operand 11 states and 2120 transitions. [2021-03-25 12:54:15,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 224 transitions, 3726 flow [2021-03-25 12:54:16,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 224 transitions, 3657 flow, removed 9 selfloop flow, removed 10 redundant places. [2021-03-25 12:54:16,152 INFO L241 Difference]: Finished difference. Result has 153 places, 188 transitions, 2837 flow [2021-03-25 12:54:16,152 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2651, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2837, PETRI_PLACES=153, PETRI_TRANSITIONS=188} [2021-03-25 12:54:16,152 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 89 predicate places. [2021-03-25 12:54:16,152 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:54:16,152 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 188 transitions, 2837 flow [2021-03-25 12:54:16,153 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 188 transitions, 2837 flow [2021-03-25 12:54:16,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 153 places, 188 transitions, 2837 flow [2021-03-25 12:54:16,408 INFO L129 PetriNetUnfolder]: 2241/4179 cut-off events. [2021-03-25 12:54:16,409 INFO L130 PetriNetUnfolder]: For 16363/16444 co-relation queries the response was YES. [2021-03-25 12:54:16,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10479 conditions, 4179 events. 2241/4179 cut-off events. For 16363/16444 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 30554 event pairs, 5 based on Foata normal form. 49/2807 useless extension candidates. Maximal degree in co-relation 9528. Up to 1228 conditions per place. [2021-03-25 12:54:16,458 INFO L142 LiptonReduction]: Number of co-enabled transitions 2648 [2021-03-25 12:54:16,464 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:54:16,464 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:54:16,464 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 312 [2021-03-25 12:54:16,465 INFO L480 AbstractCegarLoop]: Abstraction has has 153 places, 188 transitions, 2837 flow [2021-03-25 12:54:16,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 188.8) internal successors, (1888), 10 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:16,465 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:54:16,465 INFO L263 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] [2021-03-25 12:54:16,465 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-03-25 12:54:16,465 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:54:16,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:54:16,466 INFO L82 PathProgramCache]: Analyzing trace with hash -956384849, now seen corresponding path program 2 times [2021-03-25 12:54:16,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:54:16,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172208392] [2021-03-25 12:54:16,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:54:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:54:16,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:16,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:54:16,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:16,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 12:54:16,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:16,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:54:16,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:16,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:54:16,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:16,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:54:16,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:16,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:54:16,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:16,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 12:54:16,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:16,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:54:16,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:16,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:54:16,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:16,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:54:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:54:16,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172208392] [2021-03-25 12:54:16,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:54:16,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 12:54:16,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039785437] [2021-03-25 12:54:16,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 12:54:16,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:54:16,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 12:54:16,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-03-25 12:54:16,657 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-25 12:54:16,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 188 transitions, 2837 flow. Second operand has 10 states, 10 states have (on average 188.8) internal successors, (1888), 10 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:16,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:54:16,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-25 12:54:16,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:54:18,109 INFO L129 PetriNetUnfolder]: 6582/9929 cut-off events. [2021-03-25 12:54:18,109 INFO L130 PetriNetUnfolder]: For 143216/143217 co-relation queries the response was YES. [2021-03-25 12:54:18,153 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51233 conditions, 9929 events. 6582/9929 cut-off events. For 143216/143217 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 61183 event pairs, 1500 based on Foata normal form. 63/7431 useless extension candidates. Maximal degree in co-relation 47532. Up to 6835 conditions per place. [2021-03-25 12:54:18,182 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 137 selfloop transitions, 16 changer transitions 40/220 dead transitions. [2021-03-25 12:54:18,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 220 transitions, 3679 flow [2021-03-25 12:54:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 12:54:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 12:54:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2119 transitions. [2021-03-25 12:54:18,184 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5535527690700105 [2021-03-25 12:54:18,184 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2119 transitions. [2021-03-25 12:54:18,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2119 transitions. [2021-03-25 12:54:18,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:54:18,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2119 transitions. [2021-03-25 12:54:18,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 192.63636363636363) internal successors, (2119), 11 states have internal predecessors, (2119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:18,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:18,187 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:18,187 INFO L185 Difference]: Start difference. First operand has 153 places, 188 transitions, 2837 flow. Second operand 11 states and 2119 transitions. [2021-03-25 12:54:18,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 220 transitions, 3679 flow [2021-03-25 12:54:18,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 220 transitions, 3638 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-03-25 12:54:18,342 INFO L241 Difference]: Finished difference. Result has 161 places, 178 transitions, 2673 flow [2021-03-25 12:54:18,342 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2718, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2673, PETRI_PLACES=161, PETRI_TRANSITIONS=178} [2021-03-25 12:54:18,342 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 97 predicate places. [2021-03-25 12:54:18,342 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:54:18,342 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 178 transitions, 2673 flow [2021-03-25 12:54:18,342 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 178 transitions, 2673 flow [2021-03-25 12:54:18,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 155 places, 178 transitions, 2673 flow [2021-03-25 12:54:18,521 INFO L129 PetriNetUnfolder]: 1920/3581 cut-off events. [2021-03-25 12:54:18,521 INFO L130 PetriNetUnfolder]: For 14898/14968 co-relation queries the response was YES. [2021-03-25 12:54:18,538 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9327 conditions, 3581 events. 1920/3581 cut-off events. For 14898/14968 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 25404 event pairs, 5 based on Foata normal form. 49/2423 useless extension candidates. Maximal degree in co-relation 8474. Up to 1044 conditions per place. [2021-03-25 12:54:18,563 INFO L142 LiptonReduction]: Number of co-enabled transitions 2468 [2021-03-25 12:54:18,569 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:54:18,569 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:54:18,569 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 227 [2021-03-25 12:54:18,569 INFO L480 AbstractCegarLoop]: Abstraction has has 155 places, 178 transitions, 2673 flow [2021-03-25 12:54:18,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 188.8) internal successors, (1888), 10 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:18,570 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:54:18,570 INFO L263 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] [2021-03-25 12:54:18,570 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-03-25 12:54:18,570 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:54:18,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:54:18,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1349041989, now seen corresponding path program 3 times [2021-03-25 12:54:18,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:54:18,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793989916] [2021-03-25 12:54:18,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:54:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:54:18,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:18,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 12:54:18,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:18,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:54:18,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:18,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:54:18,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:18,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 12:54:18,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:18,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:54:18,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:18,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:54:18,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:18,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:54:18,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:18,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 12:54:18,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:18,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:54:18,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:18,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:54:18,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:18,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:54:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:54:18,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793989916] [2021-03-25 12:54:18,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:54:18,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 12:54:18,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454866252] [2021-03-25 12:54:18,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 12:54:18,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:54:18,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 12:54:18,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-03-25 12:54:18,724 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 348 [2021-03-25 12:54:18,725 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 178 transitions, 2673 flow. Second operand has 11 states, 11 states have (on average 187.63636363636363) internal successors, (2064), 11 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:18,725 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:54:18,725 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 348 [2021-03-25 12:54:18,725 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:54:19,707 INFO L129 PetriNetUnfolder]: 5322/7952 cut-off events. [2021-03-25 12:54:19,707 INFO L130 PetriNetUnfolder]: For 123654/123717 co-relation queries the response was YES. [2021-03-25 12:54:19,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40240 conditions, 7952 events. 5322/7952 cut-off events. For 123654/123717 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 45516 event pairs, 1094 based on Foata normal form. 243/6165 useless extension candidates. Maximal degree in co-relation 40197. Up to 2759 conditions per place. [2021-03-25 12:54:19,751 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 127 selfloop transitions, 33 changer transitions 37/222 dead transitions. [2021-03-25 12:54:19,752 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 222 transitions, 3719 flow [2021-03-25 12:54:19,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 12:54:19,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 12:54:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1569 transitions. [2021-03-25 12:54:19,754 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5635775862068966 [2021-03-25 12:54:19,754 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1569 transitions. [2021-03-25 12:54:19,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1569 transitions. [2021-03-25 12:54:19,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:54:19,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1569 transitions. [2021-03-25 12:54:19,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 196.125) internal successors, (1569), 8 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:19,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:19,757 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:19,757 INFO L185 Difference]: Start difference. First operand has 155 places, 178 transitions, 2673 flow. Second operand 8 states and 1569 transitions. [2021-03-25 12:54:19,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 222 transitions, 3719 flow [2021-03-25 12:54:19,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 222 transitions, 3560 flow, removed 30 selfloop flow, removed 17 redundant places. [2021-03-25 12:54:19,876 INFO L241 Difference]: Finished difference. Result has 144 places, 129 transitions, 1780 flow [2021-03-25 12:54:19,876 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1780, PETRI_PLACES=144, PETRI_TRANSITIONS=129} [2021-03-25 12:54:19,876 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 80 predicate places. [2021-03-25 12:54:19,876 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:54:19,876 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 129 transitions, 1780 flow [2021-03-25 12:54:19,876 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 129 transitions, 1780 flow [2021-03-25 12:54:19,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 143 places, 129 transitions, 1780 flow [2021-03-25 12:54:19,986 INFO L129 PetriNetUnfolder]: 1314/2550 cut-off events. [2021-03-25 12:54:19,986 INFO L130 PetriNetUnfolder]: For 8218/8249 co-relation queries the response was YES. [2021-03-25 12:54:19,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6059 conditions, 2550 events. 1314/2550 cut-off events. For 8218/8249 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 17638 event pairs, 3 based on Foata normal form. 9/1653 useless extension candidates. Maximal degree in co-relation 5603. Up to 804 conditions per place. [2021-03-25 12:54:20,008 INFO L142 LiptonReduction]: Number of co-enabled transitions 1524 [2021-03-25 12:54:20,261 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2021-03-25 12:54:20,581 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2021-03-25 12:54:21,319 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2021-03-25 12:54:21,371 INFO L154 LiptonReduction]: Checked pairs total: 168 [2021-03-25 12:54:21,372 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 12:54:21,372 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1496 [2021-03-25 12:54:21,372 INFO L480 AbstractCegarLoop]: Abstraction has has 143 places, 129 transitions, 1788 flow [2021-03-25 12:54:21,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 187.63636363636363) internal successors, (2064), 11 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:21,372 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:54:21,372 INFO L263 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] [2021-03-25 12:54:21,373 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-03-25 12:54:21,373 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:54:21,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:54:21,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2005765651, now seen corresponding path program 1 times [2021-03-25 12:54:21,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:54:21,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925943539] [2021-03-25 12:54:21,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:54:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:54:21,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:21,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:54:21,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:21,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 12:54:21,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:21,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 12:54:21,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:21,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:54:21,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:21,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:54:21,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:21,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:54:21,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:21,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:54:21,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:21,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 12:54:21,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:21,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:54:21,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:21,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:54:21,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:21,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:54:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:54:21,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925943539] [2021-03-25 12:54:21,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:54:21,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 12:54:21,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612280866] [2021-03-25 12:54:21,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 12:54:21,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:54:21,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 12:54:21,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-03-25 12:54:21,617 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 353 [2021-03-25 12:54:21,618 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 129 transitions, 1788 flow. Second operand has 11 states, 11 states have (on average 187.63636363636363) internal successors, (2064), 11 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:21,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:54:21,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 353 [2021-03-25 12:54:21,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:54:22,791 INFO L129 PetriNetUnfolder]: 4340/6911 cut-off events. [2021-03-25 12:54:22,791 INFO L130 PetriNetUnfolder]: For 86750/86770 co-relation queries the response was YES. [2021-03-25 12:54:22,817 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32485 conditions, 6911 events. 4340/6911 cut-off events. For 86750/86770 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 44256 event pairs, 1069 based on Foata normal form. 79/5219 useless extension candidates. Maximal degree in co-relation 29946. Up to 4276 conditions per place. [2021-03-25 12:54:22,824 INFO L132 encePairwiseOnDemand]: 342/353 looper letters, 63 selfloop transitions, 25 changer transitions 51/167 dead transitions. [2021-03-25 12:54:22,824 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 167 transitions, 2649 flow [2021-03-25 12:54:22,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-25 12:54:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-25 12:54:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2299 transitions. [2021-03-25 12:54:22,826 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5427289896128423 [2021-03-25 12:54:22,826 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2299 transitions. [2021-03-25 12:54:22,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2299 transitions. [2021-03-25 12:54:22,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:54:22,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2299 transitions. [2021-03-25 12:54:22,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 191.58333333333334) internal successors, (2299), 12 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:22,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 353.0) internal successors, (4589), 13 states have internal predecessors, (4589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:22,830 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 353.0) internal successors, (4589), 13 states have internal predecessors, (4589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:22,830 INFO L185 Difference]: Start difference. First operand has 143 places, 129 transitions, 1788 flow. Second operand 12 states and 2299 transitions. [2021-03-25 12:54:22,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 167 transitions, 2649 flow [2021-03-25 12:54:22,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 167 transitions, 2530 flow, removed 27 selfloop flow, removed 6 redundant places. [2021-03-25 12:54:22,903 INFO L241 Difference]: Finished difference. Result has 151 places, 114 transitions, 1538 flow [2021-03-25 12:54:22,903 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1693, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1538, PETRI_PLACES=151, PETRI_TRANSITIONS=114} [2021-03-25 12:54:22,903 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 87 predicate places. [2021-03-25 12:54:22,903 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:54:22,903 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 114 transitions, 1538 flow [2021-03-25 12:54:22,904 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 114 transitions, 1538 flow [2021-03-25 12:54:22,904 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 114 transitions, 1538 flow [2021-03-25 12:54:22,969 INFO L129 PetriNetUnfolder]: 689/1393 cut-off events. [2021-03-25 12:54:22,969 INFO L130 PetriNetUnfolder]: For 6195/6214 co-relation queries the response was YES. [2021-03-25 12:54:22,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4103 conditions, 1393 events. 689/1393 cut-off events. For 6195/6214 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 8718 event pairs, 0 based on Foata normal form. 12/954 useless extension candidates. Maximal degree in co-relation 3995. Up to 388 conditions per place. [2021-03-25 12:54:22,982 INFO L142 LiptonReduction]: Number of co-enabled transitions 1420 [2021-03-25 12:54:23,228 INFO L154 LiptonReduction]: Checked pairs total: 46 [2021-03-25 12:54:23,228 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 12:54:23,228 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 325 [2021-03-25 12:54:23,228 INFO L480 AbstractCegarLoop]: Abstraction has has 146 places, 113 transitions, 1524 flow [2021-03-25 12:54:23,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 187.63636363636363) internal successors, (2064), 11 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:23,228 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:54:23,228 INFO L263 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] [2021-03-25 12:54:23,229 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-03-25 12:54:23,229 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:54:23,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:54:23,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1939492427, now seen corresponding path program 3 times [2021-03-25 12:54:23,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:54:23,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591671779] [2021-03-25 12:54:23,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:54:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:54:23,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:23,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 12:54:23,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:23,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-03-25 12:54:23,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:23,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 12:54:23,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:23,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 12:54:23,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:23,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 12:54:23,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:23,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:54:23,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:23,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:54:23,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:23,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:54:23,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:23,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 12:54:23,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:23,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:54:23,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:23,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:54:23,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:23,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:54:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:54:23,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591671779] [2021-03-25 12:54:23,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:54:23,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 12:54:23,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894987628] [2021-03-25 12:54:23,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 12:54:23,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:54:23,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 12:54:23,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-03-25 12:54:23,528 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 354 [2021-03-25 12:54:23,529 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 113 transitions, 1524 flow. Second operand has 12 states, 12 states have (on average 185.5) internal successors, (2226), 12 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:23,529 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:54:23,529 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 354 [2021-03-25 12:54:23,529 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:54:24,202 INFO L129 PetriNetUnfolder]: 2723/4363 cut-off events. [2021-03-25 12:54:24,202 INFO L130 PetriNetUnfolder]: For 50335/50342 co-relation queries the response was YES. [2021-03-25 12:54:24,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22155 conditions, 4363 events. 2723/4363 cut-off events. For 50335/50342 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 26912 event pairs, 606 based on Foata normal form. 49/3417 useless extension candidates. Maximal degree in co-relation 21776. Up to 2365 conditions per place. [2021-03-25 12:54:24,226 INFO L132 encePairwiseOnDemand]: 341/354 looper letters, 77 selfloop transitions, 11 changer transitions 30/146 dead transitions. [2021-03-25 12:54:24,226 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 146 transitions, 2209 flow [2021-03-25 12:54:24,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 12:54:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 12:54:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1155 transitions. [2021-03-25 12:54:24,227 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5437853107344632 [2021-03-25 12:54:24,228 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1155 transitions. [2021-03-25 12:54:24,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1155 transitions. [2021-03-25 12:54:24,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:54:24,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1155 transitions. [2021-03-25 12:54:24,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 192.5) internal successors, (1155), 6 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:24,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 354.0) internal successors, (2478), 7 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:24,230 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 354.0) internal successors, (2478), 7 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:24,230 INFO L185 Difference]: Start difference. First operand has 146 places, 113 transitions, 1524 flow. Second operand 6 states and 1155 transitions. [2021-03-25 12:54:24,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 146 transitions, 2209 flow [2021-03-25 12:54:24,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 146 transitions, 1971 flow, removed 18 selfloop flow, removed 11 redundant places. [2021-03-25 12:54:24,280 INFO L241 Difference]: Finished difference. Result has 142 places, 108 transitions, 1298 flow [2021-03-25 12:54:24,281 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=354, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1298, PETRI_PLACES=142, PETRI_TRANSITIONS=108} [2021-03-25 12:54:24,281 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 78 predicate places. [2021-03-25 12:54:24,281 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:54:24,281 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 108 transitions, 1298 flow [2021-03-25 12:54:24,281 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 108 transitions, 1298 flow [2021-03-25 12:54:24,282 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 139 places, 108 transitions, 1298 flow [2021-03-25 12:54:24,348 INFO L129 PetriNetUnfolder]: 772/1567 cut-off events. [2021-03-25 12:54:24,348 INFO L130 PetriNetUnfolder]: For 4546/4548 co-relation queries the response was YES. [2021-03-25 12:54:24,353 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3890 conditions, 1567 events. 772/1567 cut-off events. For 4546/4548 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10126 event pairs, 2 based on Foata normal form. 0/1049 useless extension candidates. Maximal degree in co-relation 3393. Up to 456 conditions per place. [2021-03-25 12:54:24,360 INFO L142 LiptonReduction]: Number of co-enabled transitions 1264 [2021-03-25 12:54:24,363 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:54:24,363 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:54:24,363 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 82 [2021-03-25 12:54:24,363 INFO L480 AbstractCegarLoop]: Abstraction has has 139 places, 108 transitions, 1298 flow [2021-03-25 12:54:24,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 185.5) internal successors, (2226), 12 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:24,364 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:54:24,364 INFO L263 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] [2021-03-25 12:54:24,364 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-03-25 12:54:24,364 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 12:54:24,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:54:24,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1291727909, now seen corresponding path program 2 times [2021-03-25 12:54:24,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:54:24,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006301085] [2021-03-25 12:54:24,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:54:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:54:24,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:24,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 12:54:24,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:24,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:54:24,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:24,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 12:54:24,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:24,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 12:54:24,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:24,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 12:54:24,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:24,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 12:54:24,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:24,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:54:24,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:24,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:54:24,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:24,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:54:24,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:24,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:54:24,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:24,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:54:24,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:54:24,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:54:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:54:24,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006301085] [2021-03-25 12:54:24,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:54:24,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 12:54:24,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924097782] [2021-03-25 12:54:24,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 12:54:24,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:54:24,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 12:54:24,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-03-25 12:54:24,588 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 354 [2021-03-25 12:54:24,589 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 108 transitions, 1298 flow. Second operand has 12 states, 12 states have (on average 185.5) internal successors, (2226), 12 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:24,589 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:54:24,589 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 354 [2021-03-25 12:54:24,589 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:54:25,017 INFO L129 PetriNetUnfolder]: 1295/2324 cut-off events. [2021-03-25 12:54:25,017 INFO L130 PetriNetUnfolder]: For 18281/18288 co-relation queries the response was YES. [2021-03-25 12:54:25,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10131 conditions, 2324 events. 1295/2324 cut-off events. For 18281/18288 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 14285 event pairs, 270 based on Foata normal form. 243/2030 useless extension candidates. Maximal degree in co-relation 10100. Up to 1038 conditions per place. [2021-03-25 12:54:25,026 INFO L132 encePairwiseOnDemand]: 347/354 looper letters, 0 selfloop transitions, 0 changer transitions 117/117 dead transitions. [2021-03-25 12:54:25,027 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 117 transitions, 1591 flow [2021-03-25 12:54:25,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:54:25,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:54:25,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1325 transitions. [2021-03-25 12:54:25,028 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5347054075867635 [2021-03-25 12:54:25,028 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1325 transitions. [2021-03-25 12:54:25,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1325 transitions. [2021-03-25 12:54:25,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:54:25,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1325 transitions. [2021-03-25 12:54:25,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 189.28571428571428) internal successors, (1325), 7 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:25,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 354.0) internal successors, (2832), 8 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:25,030 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 354.0) internal successors, (2832), 8 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:25,030 INFO L185 Difference]: Start difference. First operand has 139 places, 108 transitions, 1298 flow. Second operand 7 states and 1325 transitions. [2021-03-25 12:54:25,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 117 transitions, 1591 flow [2021-03-25 12:54:25,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 117 transitions, 1406 flow, removed 25 selfloop flow, removed 11 redundant places. [2021-03-25 12:54:25,046 INFO L241 Difference]: Finished difference. Result has 128 places, 0 transitions, 0 flow [2021-03-25 12:54:25,047 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=354, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=128, PETRI_TRANSITIONS=0} [2021-03-25 12:54:25,047 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 64 predicate places. [2021-03-25 12:54:25,047 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:54:25,047 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 0 transitions, 0 flow [2021-03-25 12:54:25,047 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 0 transitions, 0 flow [2021-03-25 12:54:25,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2021-03-25 12:54:25,047 INFO L129 PetriNetUnfolder]: 0/0 cut-off events. [2021-03-25 12:54:25,047 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 12:54:25,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2021-03-25 12:54:25,047 INFO L142 LiptonReduction]: Number of co-enabled transitions 0 [2021-03-25 12:54:25,047 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:54:25,047 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:54:25,048 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1 [2021-03-25 12:54:25,048 INFO L480 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2021-03-25 12:54:25,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 185.5) internal successors, (2226), 12 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 12:54:25,048 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-03-25 12:54:25,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 12:54:25 BasicIcfg [2021-03-25 12:54:25,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 12:54:25,051 INFO L168 Benchmark]: Toolchain (without parser) took 149407.35 ms. Allocated memory was 255.9 MB in the beginning and 15.5 GB in the end (delta: 15.2 GB). Free memory was 233.7 MB in the beginning and 7.3 GB in the end (delta: -7.0 GB). Peak memory consumption was 8.2 GB. Max. memory is 16.0 GB. [2021-03-25 12:54:25,052 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory was 237.6 MB in the beginning and 237.5 MB in the end (delta: 174.9 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 12:54:25,052 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.75 ms. Allocated memory was 255.9 MB in the beginning and 377.5 MB in the end (delta: 121.6 MB). Free memory was 233.7 MB in the beginning and 358.5 MB in the end (delta: -124.8 MB). Peak memory consumption was 58.7 MB. Max. memory is 16.0 GB. [2021-03-25 12:54:25,052 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.73 ms. Allocated memory is still 377.5 MB. Free memory was 358.5 MB in the beginning and 356.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 12:54:25,052 INFO L168 Benchmark]: Boogie Preprocessor took 19.73 ms. Allocated memory is still 377.5 MB. Free memory was 356.4 MB in the beginning and 354.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 12:54:25,052 INFO L168 Benchmark]: RCFGBuilder took 520.78 ms. Allocated memory is still 377.5 MB. Free memory was 354.3 MB in the beginning and 327.0 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.0 GB. [2021-03-25 12:54:25,052 INFO L168 Benchmark]: TraceAbstraction took 148107.70 ms. Allocated memory was 377.5 MB in the beginning and 15.5 GB in the end (delta: 15.1 GB). Free memory was 326.1 MB in the beginning and 7.3 GB in the end (delta: -7.0 GB). Peak memory consumption was 8.1 GB. Max. memory is 16.0 GB. [2021-03-25 12:54:25,053 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.11 ms. Allocated memory is still 255.9 MB. Free memory was 237.6 MB in the beginning and 237.5 MB in the end (delta: 174.9 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 718.75 ms. Allocated memory was 255.9 MB in the beginning and 377.5 MB in the end (delta: 121.6 MB). Free memory was 233.7 MB in the beginning and 358.5 MB in the end (delta: -124.8 MB). Peak memory consumption was 58.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 35.73 ms. Allocated memory is still 377.5 MB. Free memory was 358.5 MB in the beginning and 356.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 19.73 ms. Allocated memory is still 377.5 MB. Free memory was 356.4 MB in the beginning and 354.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 520.78 ms. Allocated memory is still 377.5 MB. Free memory was 354.3 MB in the beginning and 327.0 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 148107.70 ms. Allocated memory was 377.5 MB in the beginning and 15.5 GB in the end (delta: 15.1 GB). Free memory was 326.1 MB in the beginning and 7.3 GB in the end (delta: -7.0 GB). Peak memory consumption was 8.1 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2986.6ms, 125 PlacesBefore, 64 PlacesAfterwards, 147 TransitionsBefore, 85 TransitionsAfterwards, 4982 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, 2660 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2309, positive: 2302, positive conditional: 0, positive unconditional: 2302, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2161, positive: 2154, positive conditional: 0, positive unconditional: 2154, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2161, positive: 2154, positive conditional: 0, positive unconditional: 2154, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2161, positive: 2152, positive conditional: 0, positive unconditional: 2152, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2309, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2161, unknown conditional: 0, unknown unconditional: 2161] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1740.3ms, 62 PlacesBefore, 50 PlacesAfterwards, 86 TransitionsBefore, 75 TransitionsAfterwards, 1484 CoEnabledTransitionPairs, 4 FixpointIterations, 2 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 323 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 246, positive: 244, positive conditional: 0, positive unconditional: 244, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 203, positive: 202, positive conditional: 0, positive unconditional: 202, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 203, positive: 202, positive conditional: 0, positive unconditional: 202, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 203, positive: 202, positive conditional: 0, positive unconditional: 202, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 246, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 203, unknown conditional: 0, unknown unconditional: 203] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.9ms, 54 PlacesBefore, 54 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1154 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.2ms, 61 PlacesBefore, 61 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 1222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 219.9ms, 67 PlacesBefore, 67 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 1914 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 352.9ms, 74 PlacesBefore, 74 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 1910 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 275.5ms, 79 PlacesBefore, 79 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 1902 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 230.4ms, 83 PlacesBefore, 81 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 2076 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 252.6ms, 82 PlacesBefore, 82 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 2306 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 261.9ms, 90 PlacesBefore, 88 PlacesAfterwards, 113 TransitionsBefore, 113 TransitionsAfterwards, 2216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 296.7ms, 92 PlacesBefore, 92 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 2482 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 261.2ms, 95 PlacesBefore, 95 PlacesAfterwards, 133 TransitionsBefore, 133 TransitionsAfterwards, 2512 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 262.4ms, 102 PlacesBefore, 102 PlacesAfterwards, 151 TransitionsBefore, 151 TransitionsAfterwards, 2734 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 342.8ms, 116 PlacesBefore, 116 PlacesAfterwards, 186 TransitionsBefore, 186 TransitionsAfterwards, 2894 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 415.2ms, 127 PlacesBefore, 127 PlacesAfterwards, 146 TransitionsBefore, 146 TransitionsAfterwards, 2534 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 429.8ms, 128 PlacesBefore, 128 PlacesAfterwards, 157 TransitionsBefore, 157 TransitionsAfterwards, 2660 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 689.7ms, 133 PlacesBefore, 133 PlacesAfterwards, 182 TransitionsBefore, 182 TransitionsAfterwards, 2778 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 587.9ms, 137 PlacesBefore, 137 PlacesAfterwards, 183 TransitionsBefore, 183 TransitionsAfterwards, 2762 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 498.6ms, 142 PlacesBefore, 142 PlacesAfterwards, 183 TransitionsBefore, 183 TransitionsAfterwards, 2688 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 619.7ms, 147 PlacesBefore, 147 PlacesAfterwards, 216 TransitionsBefore, 216 TransitionsAfterwards, 3576 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 819.8ms, 156 PlacesBefore, 156 PlacesAfterwards, 229 TransitionsBefore, 229 TransitionsAfterwards, 3876 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 950.1ms, 162 PlacesBefore, 162 PlacesAfterwards, 228 TransitionsBefore, 228 TransitionsAfterwards, 3864 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 936.6ms, 166 PlacesBefore, 166 PlacesAfterwards, 233 TransitionsBefore, 233 TransitionsAfterwards, 4012 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1053.5ms, 171 PlacesBefore, 171 PlacesAfterwards, 247 TransitionsBefore, 247 TransitionsAfterwards, 4228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 992.1ms, 175 PlacesBefore, 175 PlacesAfterwards, 251 TransitionsBefore, 251 TransitionsAfterwards, 4244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1130.2ms, 182 PlacesBefore, 182 PlacesAfterwards, 264 TransitionsBefore, 264 TransitionsAfterwards, 4438 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1063.1ms, 188 PlacesBefore, 188 PlacesAfterwards, 271 TransitionsBefore, 271 TransitionsAfterwards, 4392 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 987.8ms, 193 PlacesBefore, 193 PlacesAfterwards, 253 TransitionsBefore, 253 TransitionsAfterwards, 4176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 990.5ms, 192 PlacesBefore, 192 PlacesAfterwards, 250 TransitionsBefore, 250 TransitionsAfterwards, 4018 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 977.7ms, 197 PlacesBefore, 197 PlacesAfterwards, 254 TransitionsBefore, 254 TransitionsAfterwards, 3818 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 985.5ms, 203 PlacesBefore, 203 PlacesAfterwards, 256 TransitionsBefore, 256 TransitionsAfterwards, 3754 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1006.2ms, 210 PlacesBefore, 210 PlacesAfterwards, 261 TransitionsBefore, 261 TransitionsAfterwards, 3834 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 964.2ms, 204 PlacesBefore, 204 PlacesAfterwards, 244 TransitionsBefore, 244 TransitionsAfterwards, 3356 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 854.3ms, 206 PlacesBefore, 206 PlacesAfterwards, 235 TransitionsBefore, 235 TransitionsAfterwards, 3084 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 451.9ms, 196 PlacesBefore, 180 PlacesAfterwards, 214 TransitionsBefore, 214 TransitionsAfterwards, 2804 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 333.8ms, 174 PlacesBefore, 166 PlacesAfterwards, 194 TransitionsBefore, 194 TransitionsAfterwards, 2616 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 251.6ms, 163 PlacesBefore, 156 PlacesAfterwards, 172 TransitionsBefore, 172 TransitionsAfterwards, 2428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 174.1ms, 155 PlacesBefore, 145 PlacesAfterwards, 157 TransitionsBefore, 157 TransitionsAfterwards, 2242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 201.5ms, 143 PlacesBefore, 141 PlacesAfterwards, 163 TransitionsBefore, 163 TransitionsAfterwards, 2340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 245.7ms, 150 PlacesBefore, 148 PlacesAfterwards, 187 TransitionsBefore, 187 TransitionsAfterwards, 2600 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 245.1ms, 153 PlacesBefore, 153 PlacesAfterwards, 187 TransitionsBefore, 187 TransitionsAfterwards, 2558 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 230.5ms, 156 PlacesBefore, 150 PlacesAfterwards, 181 TransitionsBefore, 181 TransitionsAfterwards, 2468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 311.8ms, 153 PlacesBefore, 153 PlacesAfterwards, 188 TransitionsBefore, 188 TransitionsAfterwards, 2648 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 226.6ms, 161 PlacesBefore, 155 PlacesAfterwards, 178 TransitionsBefore, 178 TransitionsAfterwards, 2468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1495.0ms, 144 PlacesBefore, 143 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 1524 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 168 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 138, positive: 136, positive conditional: 0, positive unconditional: 136, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, positive: 104, positive conditional: 0, positive unconditional: 104, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 33, unknown conditional: 0, unknown unconditional: 33] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 324.1ms, 151 PlacesBefore, 146 PlacesAfterwards, 114 TransitionsBefore, 113 TransitionsAfterwards, 1420 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 46 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 82.1ms, 142 PlacesBefore, 139 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 1264 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5ms, 128 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - PositiveResult [Line: 1123]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 147751.4ms, OverallIterations: 47, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 111047.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3102.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1252 SDtfs, 2414 SDslu, 2747 SDs, 0 SdLazy, 10553 SolverSat, 998 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7564.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 592 GetRequests, 49 SyntacticMatches, 17 SemanticMatches, 526 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 12764.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5123occurred in iteration=31, InterpolantAutomatonStates: 381, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 74.1ms SsaConstructionTime, 406.4ms SatisfiabilityAnalysisTime, 6625.3ms InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 853 ConstructedInterpolants, 0 QuantifiedInterpolants, 12624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 47 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...