/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-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 04:43:33,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 04:43:33,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 04:43:33,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 04:43:33,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 04:43:33,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 04:43:33,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 04:43:33,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 04:43:33,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 04:43:33,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 04:43:33,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 04:43:33,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 04:43:33,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 04:43:33,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 04:43:33,541 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 04:43:33,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 04:43:33,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 04:43:33,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 04:43:33,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 04:43:33,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 04:43:33,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 04:43:33,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 04:43:33,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 04:43:33,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 04:43:33,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 04:43:33,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 04:43:33,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 04:43:33,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 04:43:33,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 04:43:33,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 04:43:33,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 04:43:33,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 04:43:33,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 04:43:33,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 04:43:33,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 04:43:33,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 04:43:33,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 04:43:33,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 04:43:33,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 04:43:33,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 04:43:33,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 04:43:33,572 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-06-11 04:43:33,605 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 04:43:33,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 04:43:33,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 04:43:33,608 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 04:43:33,608 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 04:43:33,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 04:43:33,608 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 04:43:33,609 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 04:43:33,609 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 04:43:33,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 04:43:33,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 04:43:33,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 04:43:33,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 04:43:33,610 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 04:43:33,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 04:43:33,610 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 04:43:33,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 04:43:33,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 04:43:33,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 04:43:33,611 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 04:43:33,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 04:43:33,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 04:43:33,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 04:43:33,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 04:43:33,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 04:43:33,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 04:43:33,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 04:43:33,612 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 04:43:33,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 04:43:33,612 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-06-11 04:43:33,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 04:43:33,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 04:43:33,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 04:43:33,903 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 04:43:33,904 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 04:43:33,905 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-06-11 04:43:33,962 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a98a353d/3bc7989eb92549e68efc0c641765a449/FLAG9c5ab15d3 [2021-06-11 04:43:34,557 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 04:43:34,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i [2021-06-11 04:43:34,582 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a98a353d/3bc7989eb92549e68efc0c641765a449/FLAG9c5ab15d3 [2021-06-11 04:43:34,961 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a98a353d/3bc7989eb92549e68efc0c641765a449 [2021-06-11 04:43:34,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 04:43:34,964 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 04:43:34,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 04:43:34,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 04:43:34,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 04:43:34,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:43:34" (1/1) ... [2021-06-11 04:43:34,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31435b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:43:34, skipping insertion in model container [2021-06-11 04:43:34,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:43:34" (1/1) ... [2021-06-11 04:43:34,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 04:43:35,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 04:43:35,226 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-11 04:43:35,397 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-06-11 04:43:35,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 04:43:35,422 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 04:43:35,434 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-11 04:43:35,460 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-06-11 04:43:35,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 04:43:35,623 INFO L208 MainTranslator]: Completed translation [2021-06-11 04:43:35,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:43:35 WrapperNode [2021-06-11 04:43:35,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 04:43:35,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 04:43:35,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 04:43:35,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 04:43:35,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:43:35" (1/1) ... [2021-06-11 04:43:35,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:43:35" (1/1) ... [2021-06-11 04:43:35,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 04:43:35,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 04:43:35,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 04:43:35,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 04:43:35,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:43:35" (1/1) ... [2021-06-11 04:43:35,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:43:35" (1/1) ... [2021-06-11 04:43:35,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:43:35" (1/1) ... [2021-06-11 04:43:35,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:43:35" (1/1) ... [2021-06-11 04:43:35,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:43:35" (1/1) ... [2021-06-11 04:43:35,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:43:35" (1/1) ... [2021-06-11 04:43:35,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:43:35" (1/1) ... [2021-06-11 04:43:35,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 04:43:35,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 04:43:35,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 04:43:35,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 04:43:35,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:43:35" (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-06-11 04:43:35,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 04:43:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 04:43:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 04:43:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 04:43:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-11 04:43:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2021-06-11 04:43:35,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2021-06-11 04:43:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-11 04:43:35,794 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-11 04:43:35,794 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-11 04:43:35,794 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-11 04:43:35,794 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-11 04:43:35,794 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-11 04:43:35,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 04:43:35,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-06-11 04:43:35,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 04:43:35,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 04:43:35,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 04:43:35,796 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 04:43:36,189 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 04:43:36,189 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-06-11 04:43:36,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:43:36 BoogieIcfgContainer [2021-06-11 04:43:36,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 04:43:36,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 04:43:36,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 04:43:36,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 04:43:36,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 04:43:34" (1/3) ... [2021-06-11 04:43:36,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a44a708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:43:36, skipping insertion in model container [2021-06-11 04:43:36,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:43:35" (2/3) ... [2021-06-11 04:43:36,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a44a708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:43:36, skipping insertion in model container [2021-06-11 04:43:36,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:43:36" (3/3) ... [2021-06-11 04:43:36,197 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.i [2021-06-11 04:43:36,202 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 04:43:36,206 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-06-11 04:43:36,207 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 04:43:36,279 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,280 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,280 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,280 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,280 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,280 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,280 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,281 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,281 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,281 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,281 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,281 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,281 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,281 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,282 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,282 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,282 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,282 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,282 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,282 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,282 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,282 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,283 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,283 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,283 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,283 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,283 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,283 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,283 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,285 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,285 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,285 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,285 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,290 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,290 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,290 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,290 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,290 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,290 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,290 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,291 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,291 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,291 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,291 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,291 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,291 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,291 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,291 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,291 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,294 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,294 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,294 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,294 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,294 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,294 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,294 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,294 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,294 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,295 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,295 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,295 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,295 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,295 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,295 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,295 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,296 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,296 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,296 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,296 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,296 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,296 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,296 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,297 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,297 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,297 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,297 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,297 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,297 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,297 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,298 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,298 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,298 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,298 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,298 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,298 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,298 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,299 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,299 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,299 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,299 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,299 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,299 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,300 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,300 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,300 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,300 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,300 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,300 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,301 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,301 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,301 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,301 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,301 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,301 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,301 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,301 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,302 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,302 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,302 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,302 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,302 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,302 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,302 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,302 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,303 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,303 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,303 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,303 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,303 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,303 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,304 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,304 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,304 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,304 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,304 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,304 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,304 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,305 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,305 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,305 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,305 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,305 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,305 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,306 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,306 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,306 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,306 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,306 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,306 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,306 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,307 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,307 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,308 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,309 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,309 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,309 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,313 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,313 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,314 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,314 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,315 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,315 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,316 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,316 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,317 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,318 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,318 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,318 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,318 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,318 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,320 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,320 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,320 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,320 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,320 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,322 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,322 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,322 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,322 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,322 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,322 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,322 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,323 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,323 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,323 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,323 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,323 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,325 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,325 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,325 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,326 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,327 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,327 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,327 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,328 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,328 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,328 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,330 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,330 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,330 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,330 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,332 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,332 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,332 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,332 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,333 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,334 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,334 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,334 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,335 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,336 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,336 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,336 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 04:43:36,454 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2021-06-11 04:43:36,469 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-06-11 04:43:36,485 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 04:43:36,485 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 04:43:36,485 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 04:43:36,485 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 04:43:36,485 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 04:43:36,485 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 04:43:36,486 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 04:43:36,486 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 04:43:36,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 255 transitions, 890 flow [2021-06-11 04:43:36,571 INFO L129 PetriNetUnfolder]: 67/316 cut-off events. [2021-06-11 04:43:36,571 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-11 04:43:36,583 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-06-11 04:43:36,583 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 255 transitions, 890 flow [2021-06-11 04:43:36,591 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 147 transitions, 447 flow [2021-06-11 04:43:36,592 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:43:36,602 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 147 transitions, 447 flow [2021-06-11 04:43:36,605 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 147 transitions, 447 flow [2021-06-11 04:43:36,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 147 transitions, 447 flow [2021-06-11 04:43:36,648 INFO L129 PetriNetUnfolder]: 67/316 cut-off events. [2021-06-11 04:43:36,648 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-11 04:43:36,651 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-06-11 04:43:36,661 INFO L151 LiptonReduction]: Number of co-enabled transitions 4982 [2021-06-11 04:43:36,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:36,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:36,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:36,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:36,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:36,793 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:36,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:36,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:43:36,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 04:43:36,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:36,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:36,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:36,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:36,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:36,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:36,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:36,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:36,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,011 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:37,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:43:37,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 04:43:37,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,165 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:37,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:43:37,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 04:43:37,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,505 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:37,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:43:37,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 04:43:37,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,769 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:37,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:43:37,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 04:43:37,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:37,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:37,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:38,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:38,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,162 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:38,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 04:43:38,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 04:43:38,221 INFO L142 QuantifierPusher]: treesize reduction 5, result has 73.7 percent of original size [2021-06-11 04:43:38,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:38,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:38,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:38,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,477 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:38,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:43:38,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 04:43:38,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:38,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,586 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:38,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:38,589 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:38,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:38,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:38,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:38,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,741 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:38,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:43:38,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 04:43:38,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:38,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:38,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:38,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,986 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:38,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:38,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:43:38,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 04:43:39,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:39,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:39,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:39,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:39,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:39,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:39,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:39,407 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:39,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:39,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 04:43:39,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:43:39,411 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:39,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:39,413 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:39,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:39,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-06-11 04:43:39,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:43:39,418 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:39,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:39,420 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:39,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:39,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 04:43:39,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:43:39,425 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:39,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:39,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-06-11 04:43:39,435 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:39,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:39,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:43:39,440 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:39,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:39,443 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:39,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:39,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 04:43:39,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 04:43:39,446 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:39,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:39,447 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:39,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:39,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 04:43:39,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 04:43:39,450 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:39,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:39,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:43:39,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 91 [2021-06-11 04:43:40,070 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-11 04:43:40,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:40,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:40,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:40,268 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2021-06-11 04:43:40,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:40,463 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:40,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:40,466 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:40,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:40,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 04:43:40,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 04:43:40,467 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:40,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:40,469 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:40,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:40,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 04:43:40,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 04:43:40,470 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:40,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:40,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:43:40,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-06-11 04:43:40,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:40,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:40,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:40,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:40,748 INFO L142 QuantifierPusher]: treesize reduction 17, result has 83.0 percent of original size [2021-06-11 04:43:40,762 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:40,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:40,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:40,764 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 04:43:40,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:40,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:40,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:40,825 INFO L163 LiptonReduction]: Checked pairs total: 3415 [2021-06-11 04:43:40,825 INFO L165 LiptonReduction]: Total number of compositions: 86 [2021-06-11 04:43:40,828 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4237 [2021-06-11 04:43:40,835 INFO L129 PetriNetUnfolder]: 2/20 cut-off events. [2021-06-11 04:43:40,836 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-06-11 04:43:40,836 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:43:40,836 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 04:43:40,837 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-06-11 04:43:40,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:43:40,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1229790910, now seen corresponding path program 1 times [2021-06-11 04:43:40,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:43:40,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237080895] [2021-06-11 04:43:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:43:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:43:41,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:41,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:43:41,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:41,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:43:41,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:41,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 04:43:41,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:41,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:43:41,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:41,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:43:41,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237080895] [2021-06-11 04:43:41,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:43:41,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 04:43:41,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054547132] [2021-06-11 04:43:41,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 04:43:41,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:43:41,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 04:43:41,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-11 04:43:41,063 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 352 [2021-06-11 04:43:41,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 79 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 197.33333333333334) internal successors, (1184), 6 states have internal predecessors, (1184), 0 states have call successors, (0), 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-06-11 04:43:41,069 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:43:41,069 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 352 [2021-06-11 04:43:41,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:43:41,635 INFO L129 PetriNetUnfolder]: 3099/4401 cut-off events. [2021-06-11 04:43:41,636 INFO L130 PetriNetUnfolder]: For 1400/1400 co-relation queries the response was YES. [2021-06-11 04:43:41,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9473 conditions, 4401 events. 3099/4401 cut-off events. For 1400/1400 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 20292 event pairs, 1536 based on Foata normal form. 2/3268 useless extension candidates. Maximal degree in co-relation 9446. Up to 2348 conditions per place. [2021-06-11 04:43:41,675 INFO L132 encePairwiseOnDemand]: 343/352 looper letters, 60 selfloop transitions, 6 changer transitions 7/111 dead transitions. [2021-06-11 04:43:41,675 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 111 transitions, 552 flow [2021-06-11 04:43:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 04:43:41,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 04:43:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1253 transitions. [2021-06-11 04:43:41,689 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5932765151515151 [2021-06-11 04:43:41,690 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1253 transitions. [2021-06-11 04:43:41,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1253 transitions. [2021-06-11 04:43:41,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:43:41,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1253 transitions. [2021-06-11 04:43:41,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 208.83333333333334) internal successors, (1253), 6 states have internal predecessors, (1253), 0 states have call successors, (0), 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-06-11 04:43:41,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 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-06-11 04:43:41,708 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 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-06-11 04:43:41,709 INFO L185 Difference]: Start difference. First operand has 59 places, 79 transitions, 311 flow. Second operand 6 states and 1253 transitions. [2021-06-11 04:43:41,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 111 transitions, 552 flow [2021-06-11 04:43:41,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 111 transitions, 428 flow, removed 0 selfloop flow, removed 12 redundant places. [2021-06-11 04:43:41,725 INFO L241 Difference]: Finished difference. Result has 54 places, 76 transitions, 232 flow [2021-06-11 04:43:41,727 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=54, PETRI_TRANSITIONS=76} [2021-06-11 04:43:41,727 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2021-06-11 04:43:41,728 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:43:41,728 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 76 transitions, 232 flow [2021-06-11 04:43:41,728 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 76 transitions, 232 flow [2021-06-11 04:43:41,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 76 transitions, 232 flow [2021-06-11 04:43:41,741 INFO L129 PetriNetUnfolder]: 115/245 cut-off events. [2021-06-11 04:43:41,741 INFO L130 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2021-06-11 04:43:41,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 245 events. 115/245 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 682 event pairs, 1 based on Foata normal form. 1/168 useless extension candidates. Maximal degree in co-relation 145. Up to 48 conditions per place. [2021-06-11 04:43:41,744 INFO L151 LiptonReduction]: Number of co-enabled transitions 1084 [2021-06-11 04:43:41,752 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:43:41,752 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:43:41,753 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-06-11 04:43:41,753 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 76 transitions, 232 flow [2021-06-11 04:43:41,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 197.33333333333334) internal successors, (1184), 6 states have internal predecessors, (1184), 0 states have call successors, (0), 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-06-11 04:43:41,754 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:43:41,754 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 04:43:41,755 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-11 04:43:41,755 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-06-11 04:43:41,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:43:41,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1570548576, now seen corresponding path program 1 times [2021-06-11 04:43:41,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:43:41,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470376439] [2021-06-11 04:43:41,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:43:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:43:41,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:41,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:43:41,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:41,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:43:41,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:41,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:43:41,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:41,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:43:41,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470376439] [2021-06-11 04:43:41,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:43:41,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 04:43:41,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104545258] [2021-06-11 04:43:41,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 04:43:41,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:43:41,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 04:43:41,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-11 04:43:41,823 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 352 [2021-06-11 04:43:41,825 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 76 transitions, 232 flow. Second operand has 5 states, 5 states have (on average 239.4) internal successors, (1197), 5 states have internal predecessors, (1197), 0 states have call successors, (0), 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-06-11 04:43:41,825 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:43:41,825 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 352 [2021-06-11 04:43:41,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:43:42,398 INFO L129 PetriNetUnfolder]: 4010/5629 cut-off events. [2021-06-11 04:43:42,398 INFO L130 PetriNetUnfolder]: For 752/752 co-relation queries the response was YES. [2021-06-11 04:43:42,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10478 conditions, 5629 events. 4010/5629 cut-off events. For 752/752 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 26545 event pairs, 2003 based on Foata normal form. 2/4278 useless extension candidates. Maximal degree in co-relation 8023. Up to 3289 conditions per place. [2021-06-11 04:43:42,443 INFO L132 encePairwiseOnDemand]: 345/352 looper letters, 58 selfloop transitions, 6 changer transitions 0/104 dead transitions. [2021-06-11 04:43:42,443 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 104 transitions, 438 flow [2021-06-11 04:43:42,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 04:43:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 04:43:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1491 transitions. [2021-06-11 04:43:42,446 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7059659090909091 [2021-06-11 04:43:42,447 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1491 transitions. [2021-06-11 04:43:42,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1491 transitions. [2021-06-11 04:43:42,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:43:42,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1491 transitions. [2021-06-11 04:43:42,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 248.5) internal successors, (1491), 6 states have internal predecessors, (1491), 0 states have call successors, (0), 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-06-11 04:43:42,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 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-06-11 04:43:42,456 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 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-06-11 04:43:42,456 INFO L185 Difference]: Start difference. First operand has 49 places, 76 transitions, 232 flow. Second operand 6 states and 1491 transitions. [2021-06-11 04:43:42,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 104 transitions, 438 flow [2021-06-11 04:43:42,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 104 transitions, 431 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 04:43:42,462 INFO L241 Difference]: Finished difference. Result has 55 places, 80 transitions, 271 flow [2021-06-11 04:43:42,462 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=55, PETRI_TRANSITIONS=80} [2021-06-11 04:43:42,463 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2021-06-11 04:43:42,463 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:43:42,463 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 80 transitions, 271 flow [2021-06-11 04:43:42,463 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 80 transitions, 271 flow [2021-06-11 04:43:42,464 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 80 transitions, 271 flow [2021-06-11 04:43:42,483 INFO L129 PetriNetUnfolder]: 174/359 cut-off events. [2021-06-11 04:43:42,484 INFO L130 PetriNetUnfolder]: For 23/24 co-relation queries the response was YES. [2021-06-11 04:43:42,485 INFO L84 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 359 events. 174/359 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1187 event pairs, 1 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 296. Up to 72 conditions per place. [2021-06-11 04:43:42,488 INFO L151 LiptonReduction]: Number of co-enabled transitions 1158 [2021-06-11 04:43:42,498 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:43:42,498 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:43:42,498 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-06-11 04:43:42,499 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 80 transitions, 271 flow [2021-06-11 04:43:42,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 239.4) internal successors, (1197), 5 states have internal predecessors, (1197), 0 states have call successors, (0), 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-06-11 04:43:42,500 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:43:42,500 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 04:43:42,500 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-11 04:43:42,500 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-06-11 04:43:42,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:43:42,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1873871156, now seen corresponding path program 2 times [2021-06-11 04:43:42,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:43:42,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853044393] [2021-06-11 04:43:42,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:43:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:43:42,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:42,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:43:42,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:42,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:43:42,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:42,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:43:42,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:42,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:43:42,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:42,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:43:42,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853044393] [2021-06-11 04:43:42,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:43:42,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 04:43:42,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204787025] [2021-06-11 04:43:42,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 04:43:42,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:43:42,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 04:43:42,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-11 04:43:42,574 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 352 [2021-06-11 04:43:42,575 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 80 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 197.33333333333334) internal successors, (1184), 6 states have internal predecessors, (1184), 0 states have call successors, (0), 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-06-11 04:43:42,575 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:43:42,575 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 352 [2021-06-11 04:43:42,575 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:43:43,185 INFO L129 PetriNetUnfolder]: 4974/6930 cut-off events. [2021-06-11 04:43:43,186 INFO L130 PetriNetUnfolder]: For 1741/1741 co-relation queries the response was YES. [2021-06-11 04:43:43,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13255 conditions, 6930 events. 4974/6930 cut-off events. For 1741/1741 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 32696 event pairs, 2253 based on Foata normal form. 2/5167 useless extension candidates. Maximal degree in co-relation 10925. Up to 2520 conditions per place. [2021-06-11 04:43:43,242 INFO L132 encePairwiseOnDemand]: 345/352 looper letters, 82 selfloop transitions, 12 changer transitions 0/132 dead transitions. [2021-06-11 04:43:43,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 132 transitions, 590 flow [2021-06-11 04:43:43,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 04:43:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 04:43:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1464 transitions. [2021-06-11 04:43:43,247 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5941558441558441 [2021-06-11 04:43:43,247 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1464 transitions. [2021-06-11 04:43:43,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1464 transitions. [2021-06-11 04:43:43,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:43:43,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1464 transitions. [2021-06-11 04:43:43,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 209.14285714285714) internal successors, (1464), 7 states have internal predecessors, (1464), 0 states have call successors, (0), 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-06-11 04:43:43,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:43:43,255 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:43:43,256 INFO L185 Difference]: Start difference. First operand has 55 places, 80 transitions, 271 flow. Second operand 7 states and 1464 transitions. [2021-06-11 04:43:43,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 132 transitions, 590 flow [2021-06-11 04:43:43,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 132 transitions, 579 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-06-11 04:43:43,266 INFO L241 Difference]: Finished difference. Result has 62 places, 82 transitions, 313 flow [2021-06-11 04:43:43,266 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=313, PETRI_PLACES=62, PETRI_TRANSITIONS=82} [2021-06-11 04:43:43,266 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2021-06-11 04:43:43,266 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:43:43,266 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 82 transitions, 313 flow [2021-06-11 04:43:43,267 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 82 transitions, 313 flow [2021-06-11 04:43:43,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 82 transitions, 313 flow [2021-06-11 04:43:43,291 INFO L129 PetriNetUnfolder]: 230/460 cut-off events. [2021-06-11 04:43:43,291 INFO L130 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2021-06-11 04:43:43,293 INFO L84 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 460 events. 230/460 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1665 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 413. Up to 96 conditions per place. [2021-06-11 04:43:43,296 INFO L151 LiptonReduction]: Number of co-enabled transitions 1226 [2021-06-11 04:43:43,308 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:43:43,309 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:43:43,309 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 43 [2021-06-11 04:43:43,312 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 82 transitions, 313 flow [2021-06-11 04:43:43,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 197.33333333333334) internal successors, (1184), 6 states have internal predecessors, (1184), 0 states have call successors, (0), 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-06-11 04:43:43,313 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:43:43,313 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 04:43:43,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-11 04:43:43,314 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-06-11 04:43:43,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:43:43,314 INFO L82 PathProgramCache]: Analyzing trace with hash 744533338, now seen corresponding path program 1 times [2021-06-11 04:43:43,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:43:43,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009681655] [2021-06-11 04:43:43,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:43:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:43:43,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:43,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:43:43,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:43,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:43:43,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:43,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:43:43,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:43,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:43:43,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009681655] [2021-06-11 04:43:43,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:43:43,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 04:43:43,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649613301] [2021-06-11 04:43:43,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 04:43:43,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:43:43,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 04:43:43,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-11 04:43:43,377 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 352 [2021-06-11 04:43:43,379 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 82 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 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-06-11 04:43:43,379 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:43:43,379 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 352 [2021-06-11 04:43:43,379 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:43:43,926 INFO L129 PetriNetUnfolder]: 5196/7154 cut-off events. [2021-06-11 04:43:43,926 INFO L130 PetriNetUnfolder]: For 2947/2947 co-relation queries the response was YES. [2021-06-11 04:43:43,945 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14615 conditions, 7154 events. 5196/7154 cut-off events. For 2947/2947 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 32750 event pairs, 2409 based on Foata normal form. 42/5282 useless extension candidates. Maximal degree in co-relation 10313. Up to 4758 conditions per place. [2021-06-11 04:43:43,976 INFO L132 encePairwiseOnDemand]: 345/352 looper letters, 69 selfloop transitions, 6 changer transitions 0/111 dead transitions. [2021-06-11 04:43:43,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 111 transitions, 542 flow [2021-06-11 04:43:43,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 04:43:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 04:43:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1493 transitions. [2021-06-11 04:43:43,979 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7069128787878788 [2021-06-11 04:43:43,980 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1493 transitions. [2021-06-11 04:43:43,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1493 transitions. [2021-06-11 04:43:43,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:43:43,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1493 transitions. [2021-06-11 04:43:43,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 248.83333333333334) internal successors, (1493), 6 states have internal predecessors, (1493), 0 states have call successors, (0), 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-06-11 04:43:43,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 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-06-11 04:43:43,986 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 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-06-11 04:43:43,986 INFO L185 Difference]: Start difference. First operand has 62 places, 82 transitions, 313 flow. Second operand 6 states and 1493 transitions. [2021-06-11 04:43:43,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 111 transitions, 542 flow [2021-06-11 04:43:43,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 111 transitions, 529 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-06-11 04:43:43,994 INFO L241 Difference]: Finished difference. Result has 67 places, 83 transitions, 325 flow [2021-06-11 04:43:43,994 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=325, PETRI_PLACES=67, PETRI_TRANSITIONS=83} [2021-06-11 04:43:43,994 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 8 predicate places. [2021-06-11 04:43:43,994 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:43:43,994 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 83 transitions, 325 flow [2021-06-11 04:43:43,994 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 83 transitions, 325 flow [2021-06-11 04:43:43,995 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 83 transitions, 325 flow [2021-06-11 04:43:44,018 INFO L129 PetriNetUnfolder]: 228/457 cut-off events. [2021-06-11 04:43:44,018 INFO L130 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2021-06-11 04:43:44,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 457 events. 228/457 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1656 event pairs, 0 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 433. Up to 96 conditions per place. [2021-06-11 04:43:44,023 INFO L151 LiptonReduction]: Number of co-enabled transitions 1222 [2021-06-11 04:43:44,027 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:43:44,027 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:43:44,027 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-06-11 04:43:44,030 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 83 transitions, 325 flow [2021-06-11 04:43:44,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 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-06-11 04:43:44,030 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:43:44,030 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 04:43:44,031 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-11 04:43:44,031 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-06-11 04:43:44,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:43:44,031 INFO L82 PathProgramCache]: Analyzing trace with hash 53999404, now seen corresponding path program 2 times [2021-06-11 04:43:44,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:43:44,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051605768] [2021-06-11 04:43:44,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:43:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:43:44,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:44,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:44,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:44,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:43:44,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:44,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:43:44,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051605768] [2021-06-11 04:43:44,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:43:44,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 04:43:44,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998404465] [2021-06-11 04:43:44,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 04:43:44,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:43:44,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 04:43:44,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 04:43:44,089 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 352 [2021-06-11 04:43:44,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 83 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 262.25) internal successors, (1049), 4 states have internal predecessors, (1049), 0 states have call successors, (0), 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-06-11 04:43:44,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:43:44,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 352 [2021-06-11 04:43:44,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:43:44,676 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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: 213#(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: 218#(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: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 227#true, Black: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 42#L1156-1true, Black: 230#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 235#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 239#true, Black: 200#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 125#L1164-2true]) [2021-06-11 04:43:44,676 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-06-11 04:43:44,677 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:44,677 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:44,677 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:44,679 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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: 213#(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: 218#(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: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 227#true, Black: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 42#L1156-1true, Black: 230#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 235#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 239#true, Black: 200#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 125#L1164-2true]) [2021-06-11 04:43:44,679 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-06-11 04:43:44,679 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:44,679 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:44,679 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:44,686 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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: 213#(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: 218#(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: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 227#true, Black: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 42#L1156-1true, Black: 230#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 235#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 239#true, Black: 200#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 125#L1164-2true]) [2021-06-11 04:43:44,687 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-06-11 04:43:44,687 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-06-11 04:43:44,687 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-06-11 04:43:44,687 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-06-11 04:43:44,689 INFO L129 PetriNetUnfolder]: 5440/8078 cut-off events. [2021-06-11 04:43:44,689 INFO L130 PetriNetUnfolder]: For 4481/4481 co-relation queries the response was YES. [2021-06-11 04:43:44,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16279 conditions, 8078 events. 5440/8078 cut-off events. For 4481/4481 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 45115 event pairs, 433 based on Foata normal form. 0/6155 useless extension candidates. Maximal degree in co-relation 13752. Up to 2383 conditions per place. [2021-06-11 04:43:44,753 INFO L132 encePairwiseOnDemand]: 342/352 looper letters, 48 selfloop transitions, 20 changer transitions 2/124 dead transitions. [2021-06-11 04:43:44,753 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 124 transitions, 570 flow [2021-06-11 04:43:44,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 04:43:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 04:43:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1360 transitions. [2021-06-11 04:43:44,756 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7727272727272727 [2021-06-11 04:43:44,757 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1360 transitions. [2021-06-11 04:43:44,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1360 transitions. [2021-06-11 04:43:44,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:43:44,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1360 transitions. [2021-06-11 04:43:44,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 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-06-11 04:43:44,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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-06-11 04:43:44,762 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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-06-11 04:43:44,762 INFO L185 Difference]: Start difference. First operand has 67 places, 83 transitions, 325 flow. Second operand 5 states and 1360 transitions. [2021-06-11 04:43:44,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 124 transitions, 570 flow [2021-06-11 04:43:44,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 124 transitions, 558 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-06-11 04:43:44,770 INFO L241 Difference]: Finished difference. Result has 71 places, 103 transitions, 494 flow [2021-06-11 04:43:44,770 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=494, PETRI_PLACES=71, PETRI_TRANSITIONS=103} [2021-06-11 04:43:44,771 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 12 predicate places. [2021-06-11 04:43:44,771 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:43:44,771 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 103 transitions, 494 flow [2021-06-11 04:43:44,771 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 103 transitions, 494 flow [2021-06-11 04:43:44,772 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 103 transitions, 494 flow [2021-06-11 04:43:45,016 INFO L129 PetriNetUnfolder]: 1935/3413 cut-off events. [2021-06-11 04:43:45,016 INFO L130 PetriNetUnfolder]: For 1905/1938 co-relation queries the response was YES. [2021-06-11 04:43:45,034 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6229 conditions, 3413 events. 1935/3413 cut-off events. For 1905/1938 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 22215 event pairs, 94 based on Foata normal form. 29/2348 useless extension candidates. Maximal degree in co-relation 4149. Up to 740 conditions per place. [2021-06-11 04:43:45,066 INFO L151 LiptonReduction]: Number of co-enabled transitions 1914 [2021-06-11 04:43:45,071 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:43:45,071 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:43:45,071 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 300 [2021-06-11 04:43:45,076 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 103 transitions, 494 flow [2021-06-11 04:43:45,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 262.25) internal successors, (1049), 4 states have internal predecessors, (1049), 0 states have call successors, (0), 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-06-11 04:43:45,076 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:43:45,076 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 04:43:45,077 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 04:43:45,077 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-06-11 04:43:45,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:43:45,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1675824820, now seen corresponding path program 1 times [2021-06-11 04:43:45,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:43:45,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106252469] [2021-06-11 04:43:45,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:43:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:43:45,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:45,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:43:45,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:45,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 04:43:45,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:45,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:43:45,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:45,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:43:45,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:45,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:45,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:43:45,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106252469] [2021-06-11 04:43:45,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:43:45,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 04:43:45,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396894757] [2021-06-11 04:43:45,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 04:43:45,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:43:45,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 04:43:45,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-11 04:43:45,156 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 352 [2021-06-11 04:43:45,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 103 transitions, 494 flow. Second operand has 6 states, 6 states have (on average 195.16666666666666) internal successors, (1171), 6 states have internal predecessors, (1171), 0 states have call successors, (0), 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-06-11 04:43:45,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:43:45,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 352 [2021-06-11 04:43:45,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:43:46,205 INFO L129 PetriNetUnfolder]: 8991/12414 cut-off events. [2021-06-11 04:43:46,205 INFO L130 PetriNetUnfolder]: For 16297/16471 co-relation queries the response was YES. [2021-06-11 04:43:46,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33888 conditions, 12414 events. 8991/12414 cut-off events. For 16297/16471 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 63248 event pairs, 2441 based on Foata normal form. 150/9347 useless extension candidates. Maximal degree in co-relation 25638. Up to 5405 conditions per place. [2021-06-11 04:43:46,289 INFO L132 encePairwiseOnDemand]: 344/352 looper letters, 90 selfloop transitions, 17 changer transitions 0/140 dead transitions. [2021-06-11 04:43:46,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 140 transitions, 854 flow [2021-06-11 04:43:46,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-11 04:43:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-11 04:43:46,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1621 transitions. [2021-06-11 04:43:46,294 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5756392045454546 [2021-06-11 04:43:46,294 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1621 transitions. [2021-06-11 04:43:46,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1621 transitions. [2021-06-11 04:43:46,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:43:46,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1621 transitions. [2021-06-11 04:43:46,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 202.625) internal successors, (1621), 8 states have internal predecessors, (1621), 0 states have call successors, (0), 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-06-11 04:43:46,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 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-06-11 04:43:46,302 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 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-06-11 04:43:46,302 INFO L185 Difference]: Start difference. First operand has 71 places, 103 transitions, 494 flow. Second operand 8 states and 1621 transitions. [2021-06-11 04:43:46,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 140 transitions, 854 flow [2021-06-11 04:43:46,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 140 transitions, 854 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 04:43:46,323 INFO L241 Difference]: Finished difference. Result has 80 places, 104 transitions, 551 flow [2021-06-11 04:43:46,323 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=551, PETRI_PLACES=80, PETRI_TRANSITIONS=104} [2021-06-11 04:43:46,323 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 21 predicate places. [2021-06-11 04:43:46,323 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:43:46,323 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 104 transitions, 551 flow [2021-06-11 04:43:46,324 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 104 transitions, 551 flow [2021-06-11 04:43:46,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 104 transitions, 551 flow [2021-06-11 04:43:46,554 INFO L129 PetriNetUnfolder]: 1867/3327 cut-off events. [2021-06-11 04:43:46,554 INFO L130 PetriNetUnfolder]: For 2316/2349 co-relation queries the response was YES. [2021-06-11 04:43:46,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6345 conditions, 3327 events. 1867/3327 cut-off events. For 2316/2349 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 22103 event pairs, 94 based on Foata normal form. 29/2296 useless extension candidates. Maximal degree in co-relation 4358. Up to 732 conditions per place. [2021-06-11 04:43:46,581 INFO L151 LiptonReduction]: Number of co-enabled transitions 1906 [2021-06-11 04:43:46,584 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:43:46,584 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:43:46,585 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 262 [2021-06-11 04:43:46,585 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 104 transitions, 551 flow [2021-06-11 04:43:46,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 195.16666666666666) internal successors, (1171), 6 states have internal predecessors, (1171), 0 states have call successors, (0), 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-06-11 04:43:46,586 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:43:46,586 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 04:43:46,586 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 04:43:46,586 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-06-11 04:43:46,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:43:46,586 INFO L82 PathProgramCache]: Analyzing trace with hash 2033856654, now seen corresponding path program 2 times [2021-06-11 04:43:46,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:43:46,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670924384] [2021-06-11 04:43:46,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:43:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:43:46,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:46,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:46,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:46,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 04:43:46,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:46,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:43:46,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:46,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:43:46,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:46,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:43:46,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:46,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:43:46,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670924384] [2021-06-11 04:43:46,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:43:46,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 04:43:46,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902410722] [2021-06-11 04:43:46,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 04:43:46,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:43:46,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 04:43:46,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-11 04:43:46,658 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 352 [2021-06-11 04:43:46,659 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 104 transitions, 551 flow. Second operand has 7 states, 7 states have (on average 236.57142857142858) internal successors, (1656), 7 states have internal predecessors, (1656), 0 states have call successors, (0), 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-06-11 04:43:46,660 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:43:46,660 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 352 [2021-06-11 04:43:46,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:43:47,252 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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][52], [Black: 213#(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: 218#(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: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 263#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 42#L1156-1true, Black: 254#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 230#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 235#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 239#true, Black: 200#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 275#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 241#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 242#|ULTIMATE.start_main_#t~short21|, Black: 244#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 250#true, 125#L1164-2true]) [2021-06-11 04:43:47,252 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-06-11 04:43:47,252 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:47,253 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:47,253 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:47,336 INFO L129 PetriNetUnfolder]: 5349/8029 cut-off events. [2021-06-11 04:43:47,337 INFO L130 PetriNetUnfolder]: For 16113/16416 co-relation queries the response was YES. [2021-06-11 04:43:47,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24223 conditions, 8029 events. 5349/8029 cut-off events. For 16113/16416 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 46832 event pairs, 626 based on Foata normal form. 182/6375 useless extension candidates. Maximal degree in co-relation 17029. Up to 2483 conditions per place. [2021-06-11 04:43:47,394 INFO L132 encePairwiseOnDemand]: 340/352 looper letters, 56 selfloop transitions, 34 changer transitions 10/153 dead transitions. [2021-06-11 04:43:47,394 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 153 transitions, 1042 flow [2021-06-11 04:43:47,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 04:43:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 04:43:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2187 transitions. [2021-06-11 04:43:47,399 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6903409090909091 [2021-06-11 04:43:47,399 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2187 transitions. [2021-06-11 04:43:47,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2187 transitions. [2021-06-11 04:43:47,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:43:47,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2187 transitions. [2021-06-11 04:43:47,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 243.0) internal successors, (2187), 9 states have internal predecessors, (2187), 0 states have call successors, (0), 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-06-11 04:43:47,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:43:47,409 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:43:47,409 INFO L185 Difference]: Start difference. First operand has 80 places, 104 transitions, 551 flow. Second operand 9 states and 2187 transitions. [2021-06-11 04:43:47,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 153 transitions, 1042 flow [2021-06-11 04:43:47,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 153 transitions, 997 flow, removed 3 selfloop flow, removed 7 redundant places. [2021-06-11 04:43:47,426 INFO L241 Difference]: Finished difference. Result has 84 places, 116 transitions, 728 flow [2021-06-11 04:43:47,427 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=728, PETRI_PLACES=84, PETRI_TRANSITIONS=116} [2021-06-11 04:43:47,427 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 25 predicate places. [2021-06-11 04:43:47,427 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:43:47,427 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 116 transitions, 728 flow [2021-06-11 04:43:47,427 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 116 transitions, 728 flow [2021-06-11 04:43:47,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 116 transitions, 728 flow [2021-06-11 04:43:47,637 INFO L129 PetriNetUnfolder]: 1999/3632 cut-off events. [2021-06-11 04:43:47,637 INFO L130 PetriNetUnfolder]: For 4840/4896 co-relation queries the response was YES. [2021-06-11 04:43:47,653 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7924 conditions, 3632 events. 1999/3632 cut-off events. For 4840/4896 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 24817 event pairs, 62 based on Foata normal form. 34/2581 useless extension candidates. Maximal degree in co-relation 5533. Up to 786 conditions per place. [2021-06-11 04:43:47,684 INFO L151 LiptonReduction]: Number of co-enabled transitions 2080 [2021-06-11 04:43:47,690 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:43:47,690 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:43:47,690 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 263 [2021-06-11 04:43:47,690 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 116 transitions, 728 flow [2021-06-11 04:43:47,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 236.57142857142858) internal successors, (1656), 7 states have internal predecessors, (1656), 0 states have call successors, (0), 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-06-11 04:43:47,691 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:43:47,691 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 04:43:47,691 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 04:43:47,691 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-06-11 04:43:47,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:43:47,692 INFO L82 PathProgramCache]: Analyzing trace with hash 613781687, now seen corresponding path program 1 times [2021-06-11 04:43:47,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:43:47,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931813449] [2021-06-11 04:43:47,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:43:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:43:47,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:47,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:43:47,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:47,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:43:47,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:47,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:43:47,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:47,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:43:47,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931813449] [2021-06-11 04:43:47,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:43:47,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 04:43:47,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932605516] [2021-06-11 04:43:47,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 04:43:47,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:43:47,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 04:43:47,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-11 04:43:47,740 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 352 [2021-06-11 04:43:47,741 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 116 transitions, 728 flow. Second operand has 5 states, 5 states have (on average 239.2) internal successors, (1196), 5 states have internal predecessors, (1196), 0 states have call successors, (0), 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-06-11 04:43:47,741 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:43:47,741 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 352 [2021-06-11 04:43:47,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:43:48,569 INFO L129 PetriNetUnfolder]: 8506/11910 cut-off events. [2021-06-11 04:43:48,570 INFO L130 PetriNetUnfolder]: For 34199/34433 co-relation queries the response was YES. [2021-06-11 04:43:48,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38544 conditions, 11910 events. 8506/11910 cut-off events. For 34199/34433 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 62669 event pairs, 2093 based on Foata normal form. 78/8978 useless extension candidates. Maximal degree in co-relation 31502. Up to 8488 conditions per place. [2021-06-11 04:43:48,637 INFO L132 encePairwiseOnDemand]: 345/352 looper letters, 107 selfloop transitions, 7 changer transitions 1/153 dead transitions. [2021-06-11 04:43:48,637 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 153 transitions, 1154 flow [2021-06-11 04:43:48,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 04:43:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 04:43:48,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1492 transitions. [2021-06-11 04:43:48,640 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7064393939393939 [2021-06-11 04:43:48,640 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1492 transitions. [2021-06-11 04:43:48,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1492 transitions. [2021-06-11 04:43:48,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:43:48,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1492 transitions. [2021-06-11 04:43:48,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 248.66666666666666) internal successors, (1492), 6 states have internal predecessors, (1492), 0 states have call successors, (0), 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-06-11 04:43:48,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 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-06-11 04:43:48,647 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 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-06-11 04:43:48,647 INFO L185 Difference]: Start difference. First operand has 82 places, 116 transitions, 728 flow. Second operand 6 states and 1492 transitions. [2021-06-11 04:43:48,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 153 transitions, 1154 flow [2021-06-11 04:43:48,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 153 transitions, 1148 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 04:43:48,685 INFO L241 Difference]: Finished difference. Result has 87 places, 116 transitions, 740 flow [2021-06-11 04:43:48,686 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=740, PETRI_PLACES=87, PETRI_TRANSITIONS=116} [2021-06-11 04:43:48,686 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 28 predicate places. [2021-06-11 04:43:48,686 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:43:48,686 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 116 transitions, 740 flow [2021-06-11 04:43:48,686 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 116 transitions, 740 flow [2021-06-11 04:43:48,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 116 transitions, 740 flow [2021-06-11 04:43:48,899 INFO L129 PetriNetUnfolder]: 1942/3559 cut-off events. [2021-06-11 04:43:48,899 INFO L130 PetriNetUnfolder]: For 4775/4836 co-relation queries the response was YES. [2021-06-11 04:43:48,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7827 conditions, 3559 events. 1942/3559 cut-off events. For 4775/4836 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 24495 event pairs, 61 based on Foata normal form. 34/2523 useless extension candidates. Maximal degree in co-relation 6746. Up to 784 conditions per place. [2021-06-11 04:43:48,949 INFO L151 LiptonReduction]: Number of co-enabled transitions 2046 [2021-06-11 04:43:48,954 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:43:48,954 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:43:48,955 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 269 [2021-06-11 04:43:48,955 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 116 transitions, 740 flow [2021-06-11 04:43:48,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 239.2) internal successors, (1196), 5 states have internal predecessors, (1196), 0 states have call successors, (0), 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-06-11 04:43:48,956 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:43:48,956 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 04:43:48,956 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 04:43:48,957 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-06-11 04:43:48,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:43:48,957 INFO L82 PathProgramCache]: Analyzing trace with hash -641006685, now seen corresponding path program 2 times [2021-06-11 04:43:48,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:43:48,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588307728] [2021-06-11 04:43:48,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:43:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:43:48,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:48,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:48,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:48,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:43:48,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:43:48,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588307728] [2021-06-11 04:43:48,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:43:48,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 04:43:48,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657198420] [2021-06-11 04:43:48,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 04:43:48,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:43:48,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 04:43:48,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 04:43:48,986 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 352 [2021-06-11 04:43:48,987 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 116 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 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-06-11 04:43:48,987 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:43:48,987 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 352 [2021-06-11 04:43:48,987 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:43:49,532 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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], [288#true, Black: 213#(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: 218#(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: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 263#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 254#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 291#(= |ULTIMATE.start_main_#t~mem18| 5), 42#L1156-1true, Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 300#true, Black: 230#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 244#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 241#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), 279#(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: 242#|ULTIMATE.start_main_#t~short21|, Black: 239#true, Black: 277#(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: 281#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|)]) [2021-06-11 04:43:49,532 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-06-11 04:43:49,533 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:49,533 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:49,533 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:49,539 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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], [288#true, Black: 213#(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: 218#(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: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 263#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 42#L1156-1true, Black: 254#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 291#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 230#(= |ULTIMATE.start_main_#t~mem18| 5), 302#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 239#true, Black: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 275#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 241#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 242#|ULTIMATE.start_main_#t~short21|, Black: 244#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 125#L1164-2true, Black: 277#(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: 279#(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: 281#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|)]) [2021-06-11 04:43:49,539 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-06-11 04:43:49,539 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:49,539 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:49,539 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:49,541 INFO L129 PetriNetUnfolder]: 5641/8570 cut-off events. [2021-06-11 04:43:49,541 INFO L130 PetriNetUnfolder]: For 32892/33442 co-relation queries the response was YES. [2021-06-11 04:43:49,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30261 conditions, 8570 events. 5641/8570 cut-off events. For 32892/33442 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 51616 event pairs, 681 based on Foata normal form. 83/6876 useless extension candidates. Maximal degree in co-relation 26633. Up to 4277 conditions per place. [2021-06-11 04:43:49,606 INFO L132 encePairwiseOnDemand]: 345/352 looper letters, 66 selfloop transitions, 15 changer transitions 1/137 dead transitions. [2021-06-11 04:43:49,606 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 137 transitions, 1070 flow [2021-06-11 04:43:49,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 04:43:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 04:43:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 858 transitions. [2021-06-11 04:43:49,624 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8125 [2021-06-11 04:43:49,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 858 transitions. [2021-06-11 04:43:49,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 858 transitions. [2021-06-11 04:43:49,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:43:49,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 858 transitions. [2021-06-11 04:43:49,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 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-06-11 04:43:49,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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-06-11 04:43:49,629 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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-06-11 04:43:49,629 INFO L185 Difference]: Start difference. First operand has 87 places, 116 transitions, 740 flow. Second operand 3 states and 858 transitions. [2021-06-11 04:43:49,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 137 transitions, 1070 flow [2021-06-11 04:43:49,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 137 transitions, 1056 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-06-11 04:43:49,676 INFO L241 Difference]: Finished difference. Result has 86 places, 124 transitions, 873 flow [2021-06-11 04:43:49,677 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=873, PETRI_PLACES=86, PETRI_TRANSITIONS=124} [2021-06-11 04:43:49,677 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 27 predicate places. [2021-06-11 04:43:49,677 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:43:49,677 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 124 transitions, 873 flow [2021-06-11 04:43:49,677 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 124 transitions, 873 flow [2021-06-11 04:43:49,678 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 124 transitions, 873 flow [2021-06-11 04:43:49,869 INFO L129 PetriNetUnfolder]: 2167/3973 cut-off events. [2021-06-11 04:43:49,870 INFO L130 PetriNetUnfolder]: For 7296/7491 co-relation queries the response was YES. [2021-06-11 04:43:49,883 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9540 conditions, 3973 events. 2167/3973 cut-off events. For 7296/7491 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 28124 event pairs, 50 based on Foata normal form. 31/2883 useless extension candidates. Maximal degree in co-relation 6921. Up to 872 conditions per place. [2021-06-11 04:43:49,916 INFO L151 LiptonReduction]: Number of co-enabled transitions 2262 [2021-06-11 04:43:49,922 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:43:49,922 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:43:49,923 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 246 [2021-06-11 04:43:49,923 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 124 transitions, 873 flow [2021-06-11 04:43:49,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 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-06-11 04:43:49,923 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:43:49,924 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 04:43:49,924 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 04:43:49,924 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-06-11 04:43:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:43:49,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1778022517, now seen corresponding path program 1 times [2021-06-11 04:43:49,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:43:49,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763770882] [2021-06-11 04:43:49,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:43:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:43:49,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:49,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:43:49,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:49,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 04:43:49,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:49,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:43:49,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:49,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:43:49,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:49,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:43:49,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763770882] [2021-06-11 04:43:49,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:43:49,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 04:43:49,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983886758] [2021-06-11 04:43:49,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 04:43:49,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:43:49,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 04:43:49,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-11 04:43:49,987 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 352 [2021-06-11 04:43:49,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 124 transitions, 873 flow. Second operand has 6 states, 6 states have (on average 195.33333333333334) internal successors, (1172), 6 states have internal predecessors, (1172), 0 states have call successors, (0), 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-06-11 04:43:49,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:43:49,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 352 [2021-06-11 04:43:49,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:43:50,870 INFO L129 PetriNetUnfolder]: 9008/12665 cut-off events. [2021-06-11 04:43:50,870 INFO L130 PetriNetUnfolder]: For 52911/53697 co-relation queries the response was YES. [2021-06-11 04:43:50,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45288 conditions, 12665 events. 9008/12665 cut-off events. For 52911/53697 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 67775 event pairs, 1983 based on Foata normal form. 188/9944 useless extension candidates. Maximal degree in co-relation 37390. Up to 6259 conditions per place. [2021-06-11 04:43:50,946 INFO L132 encePairwiseOnDemand]: 344/352 looper letters, 83 selfloop transitions, 17 changer transitions 37/166 dead transitions. [2021-06-11 04:43:50,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 166 transitions, 1406 flow [2021-06-11 04:43:50,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-11 04:43:50,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-11 04:43:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1618 transitions. [2021-06-11 04:43:50,950 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5745738636363636 [2021-06-11 04:43:50,950 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1618 transitions. [2021-06-11 04:43:50,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1618 transitions. [2021-06-11 04:43:50,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:43:50,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1618 transitions. [2021-06-11 04:43:50,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 202.25) internal successors, (1618), 8 states have internal predecessors, (1618), 0 states have call successors, (0), 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-06-11 04:43:50,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 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-06-11 04:43:50,958 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 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-06-11 04:43:50,958 INFO L185 Difference]: Start difference. First operand has 86 places, 124 transitions, 873 flow. Second operand 8 states and 1618 transitions. [2021-06-11 04:43:50,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 166 transitions, 1406 flow [2021-06-11 04:43:51,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 166 transitions, 1383 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 04:43:51,033 INFO L241 Difference]: Finished difference. Result has 94 places, 94 transitions, 648 flow [2021-06-11 04:43:51,033 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=648, PETRI_PLACES=94, PETRI_TRANSITIONS=94} [2021-06-11 04:43:51,033 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 35 predicate places. [2021-06-11 04:43:51,034 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:43:51,034 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 94 transitions, 648 flow [2021-06-11 04:43:51,034 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 94 transitions, 648 flow [2021-06-11 04:43:51,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 94 transitions, 648 flow [2021-06-11 04:43:51,180 INFO L129 PetriNetUnfolder]: 1661/3133 cut-off events. [2021-06-11 04:43:51,180 INFO L130 PetriNetUnfolder]: For 5942/6287 co-relation queries the response was YES. [2021-06-11 04:43:51,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7157 conditions, 3133 events. 1661/3133 cut-off events. For 5942/6287 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 21834 event pairs, 68 based on Foata normal form. 12/2193 useless extension candidates. Maximal degree in co-relation 5803. Up to 754 conditions per place. [2021-06-11 04:43:51,213 INFO L151 LiptonReduction]: Number of co-enabled transitions 1760 [2021-06-11 04:43:51,218 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:43:51,219 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:43:51,219 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 185 [2021-06-11 04:43:51,219 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 94 transitions, 648 flow [2021-06-11 04:43:51,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 195.33333333333334) internal successors, (1172), 6 states have internal predecessors, (1172), 0 states have call successors, (0), 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-06-11 04:43:51,220 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:43:51,220 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 04:43:51,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 04:43:51,220 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-06-11 04:43:51,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:43:51,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1629343272, now seen corresponding path program 1 times [2021-06-11 04:43:51,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:43:51,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892910688] [2021-06-11 04:43:51,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:43:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:43:51,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:51,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:51,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:51,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 04:43:51,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:51,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:43:51,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:51,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:43:51,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:51,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:43:51,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:51,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:43:51,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892910688] [2021-06-11 04:43:51,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:43:51,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 04:43:51,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624633871] [2021-06-11 04:43:51,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 04:43:51,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:43:51,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 04:43:51,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-11 04:43:51,272 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 352 [2021-06-11 04:43:51,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 94 transitions, 648 flow. Second operand has 7 states, 7 states have (on average 235.71428571428572) internal successors, (1650), 7 states have internal predecessors, (1650), 0 states have call successors, (0), 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-06-11 04:43:51,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:43:51,274 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 352 [2021-06-11 04:43:51,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:43:51,896 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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: 309#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 318#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 263#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 254#(= |ULTIMATE.start_main_#t~mem18| 5), 330#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 275#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 277#(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: 279#(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: 281#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 213#(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: 218#(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: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 291#(= |ULTIMATE.start_main_#t~mem18| 5), 42#L1156-1true, Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 230#(= |ULTIMATE.start_main_#t~mem18| 5), 302#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 239#true, 305#true, Black: 241#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 242#|ULTIMATE.start_main_#t~short21|, Black: 244#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 125#L1164-2true]) [2021-06-11 04:43:51,896 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-06-11 04:43:51,896 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:51,896 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:51,896 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:51,903 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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][37], [Black: 309#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 318#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 263#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 254#(= |ULTIMATE.start_main_#t~mem18| 5), 334#(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: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 279#(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: 277#(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: 281#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 213#(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: 218#(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: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 291#(= |ULTIMATE.start_main_#t~mem18| 5), 42#L1156-1true, Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 230#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 302#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 305#true, 244#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 241#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 242#|ULTIMATE.start_main_#t~short21|, Black: 239#true, 125#L1164-2true]) [2021-06-11 04:43:51,904 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-06-11 04:43:51,904 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:51,904 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:51,904 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:51,905 INFO L129 PetriNetUnfolder]: 5163/7996 cut-off events. [2021-06-11 04:43:51,905 INFO L130 PetriNetUnfolder]: For 38617/39252 co-relation queries the response was YES. [2021-06-11 04:43:51,938 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29146 conditions, 7996 events. 5163/7996 cut-off events. For 38617/39252 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 49193 event pairs, 412 based on Foata normal form. 239/6570 useless extension candidates. Maximal degree in co-relation 23283. Up to 2632 conditions per place. [2021-06-11 04:43:51,966 INFO L132 encePairwiseOnDemand]: 341/352 looper letters, 54 selfloop transitions, 29 changer transitions 2/131 dead transitions. [2021-06-11 04:43:51,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 131 transitions, 1079 flow [2021-06-11 04:43:51,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 04:43:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 04:43:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1698 transitions. [2021-06-11 04:43:51,969 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6891233766233766 [2021-06-11 04:43:51,969 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1698 transitions. [2021-06-11 04:43:51,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1698 transitions. [2021-06-11 04:43:51,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:43:51,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1698 transitions. [2021-06-11 04:43:51,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 242.57142857142858) internal successors, (1698), 7 states have internal predecessors, (1698), 0 states have call successors, (0), 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-06-11 04:43:51,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:43:51,977 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:43:51,977 INFO L185 Difference]: Start difference. First operand has 90 places, 94 transitions, 648 flow. Second operand 7 states and 1698 transitions. [2021-06-11 04:43:51,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 131 transitions, 1079 flow [2021-06-11 04:43:52,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 131 transitions, 1000 flow, removed 20 selfloop flow, removed 9 redundant places. [2021-06-11 04:43:52,013 INFO L241 Difference]: Finished difference. Result has 91 places, 108 transitions, 859 flow [2021-06-11 04:43:52,013 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=859, PETRI_PLACES=91, PETRI_TRANSITIONS=108} [2021-06-11 04:43:52,014 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 32 predicate places. [2021-06-11 04:43:52,014 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:43:52,014 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 108 transitions, 859 flow [2021-06-11 04:43:52,014 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 108 transitions, 859 flow [2021-06-11 04:43:52,015 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 108 transitions, 859 flow [2021-06-11 04:43:52,193 INFO L129 PetriNetUnfolder]: 1868/3528 cut-off events. [2021-06-11 04:43:52,193 INFO L130 PetriNetUnfolder]: For 9279/9493 co-relation queries the response was YES. [2021-06-11 04:43:52,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9185 conditions, 3528 events. 1868/3528 cut-off events. For 9279/9493 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 25109 event pairs, 47 based on Foata normal form. 41/2561 useless extension candidates. Maximal degree in co-relation 7037. Up to 820 conditions per place. [2021-06-11 04:43:52,228 INFO L151 LiptonReduction]: Number of co-enabled transitions 2024 [2021-06-11 04:43:52,234 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:43:52,234 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:43:52,234 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 220 [2021-06-11 04:43:52,235 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 108 transitions, 859 flow [2021-06-11 04:43:52,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 235.71428571428572) internal successors, (1650), 7 states have internal predecessors, (1650), 0 states have call successors, (0), 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-06-11 04:43:52,235 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:43:52,235 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 04:43:52,235 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 04:43:52,235 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-06-11 04:43:52,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:43:52,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1206720050, now seen corresponding path program 2 times [2021-06-11 04:43:52,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:43:52,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785368187] [2021-06-11 04:43:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:43:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:43:52,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:52,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:52,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:52,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 04:43:52,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:52,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 04:43:52,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:52,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:43:52,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:52,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:43:52,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:52,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:43:52,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:52,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:43:52,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785368187] [2021-06-11 04:43:52,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:43:52,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 04:43:52,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490215872] [2021-06-11 04:43:52,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 04:43:52,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:43:52,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 04:43:52,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-11 04:43:52,302 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 352 [2021-06-11 04:43:52,303 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 108 transitions, 859 flow. Second operand has 8 states, 8 states have (on average 232.5) internal successors, (1860), 8 states have internal predecessors, (1860), 0 states have call successors, (0), 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-06-11 04:43:52,303 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:43:52,303 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 352 [2021-06-11 04:43:52,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:43:53,020 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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][37], [Black: 309#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 318#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 263#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 254#(= |ULTIMATE.start_main_#t~mem18| 5), 334#(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: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 330#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 332#(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))), 279#(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: 277#(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: 213#(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: 218#(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: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 355#(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: 291#(= |ULTIMATE.start_main_#t~mem18| 5), 42#L1156-1true, Black: 230#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 302#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 244#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 241#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 242#|ULTIMATE.start_main_#t~short21|, Black: 239#true, 125#L1164-2true]) [2021-06-11 04:43:53,020 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-06-11 04:43:53,021 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:53,021 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:53,021 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:53,021 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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][54], [Black: 309#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 318#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 263#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 254#(= |ULTIMATE.start_main_#t~mem18| 5), 330#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 275#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 332#(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: 334#(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: 277#(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|)), 351#(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: 213#(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: 218#(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: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 291#(= |ULTIMATE.start_main_#t~mem18| 5), 42#L1156-1true, Black: 230#(= |ULTIMATE.start_main_#t~mem18| 5), 302#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 239#true, Black: 241#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 242#|ULTIMATE.start_main_#t~short21|, Black: 244#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 125#L1164-2true]) [2021-06-11 04:43:53,021 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-06-11 04:43:53,021 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:53,021 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:53,022 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:53,030 INFO L129 PetriNetUnfolder]: 5360/8223 cut-off events. [2021-06-11 04:43:53,030 INFO L130 PetriNetUnfolder]: For 56193/57023 co-relation queries the response was YES. [2021-06-11 04:43:53,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33420 conditions, 8223 events. 5360/8223 cut-off events. For 56193/57023 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 49137 event pairs, 413 based on Foata normal form. 288/6784 useless extension candidates. Maximal degree in co-relation 21942. Up to 2632 conditions per place. [2021-06-11 04:43:53,096 INFO L132 encePairwiseOnDemand]: 342/352 looper letters, 55 selfloop transitions, 42 changer transitions 3/146 dead transitions. [2021-06-11 04:43:53,096 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 146 transitions, 1377 flow [2021-06-11 04:43:53,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 04:43:53,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 04:43:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1677 transitions. [2021-06-11 04:43:53,100 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6806006493506493 [2021-06-11 04:43:53,100 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1677 transitions. [2021-06-11 04:43:53,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1677 transitions. [2021-06-11 04:43:53,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:43:53,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1677 transitions. [2021-06-11 04:43:53,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 239.57142857142858) internal successors, (1677), 7 states have internal predecessors, (1677), 0 states have call successors, (0), 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-06-11 04:43:53,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:43:53,107 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:43:53,108 INFO L185 Difference]: Start difference. First operand has 91 places, 108 transitions, 859 flow. Second operand 7 states and 1677 transitions. [2021-06-11 04:43:53,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 146 transitions, 1377 flow [2021-06-11 04:43:53,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 146 transitions, 1370 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 04:43:53,150 INFO L241 Difference]: Finished difference. Result has 99 places, 122 transitions, 1220 flow [2021-06-11 04:43:53,150 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1220, PETRI_PLACES=99, PETRI_TRANSITIONS=122} [2021-06-11 04:43:53,150 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 40 predicate places. [2021-06-11 04:43:53,150 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:43:53,150 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 122 transitions, 1220 flow [2021-06-11 04:43:53,150 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 122 transitions, 1220 flow [2021-06-11 04:43:53,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 122 transitions, 1220 flow [2021-06-11 04:43:53,352 INFO L129 PetriNetUnfolder]: 1922/3625 cut-off events. [2021-06-11 04:43:53,352 INFO L130 PetriNetUnfolder]: For 16708/17252 co-relation queries the response was YES. [2021-06-11 04:43:53,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10847 conditions, 3625 events. 1922/3625 cut-off events. For 16708/17252 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 25803 event pairs, 75 based on Foata normal form. 57/2627 useless extension candidates. Maximal degree in co-relation 8239. Up to 866 conditions per place. [2021-06-11 04:43:53,394 INFO L151 LiptonReduction]: Number of co-enabled transitions 2248 [2021-06-11 04:43:53,398 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:43:53,398 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:43:53,399 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 249 [2021-06-11 04:43:53,399 INFO L480 AbstractCegarLoop]: Abstraction has has 99 places, 122 transitions, 1220 flow [2021-06-11 04:43:53,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 232.5) internal successors, (1860), 8 states have internal predecessors, (1860), 0 states have call successors, (0), 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-06-11 04:43:53,400 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:43:53,400 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 04:43:53,400 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 04:43:53,400 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-06-11 04:43:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:43:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash 637207635, now seen corresponding path program 1 times [2021-06-11 04:43:53,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:43:53,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848104460] [2021-06-11 04:43:53,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:43:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:43:53,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:53,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 04:43:53,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:53,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 04:43:53,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:53,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-06-11 04:43:53,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:53,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:43:53,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:53,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:43:53,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:53,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:43:53,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:53,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:43:53,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:53,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-06-11 04:43:53,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:53,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:43:53,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:53,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:43:53,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848104460] [2021-06-11 04:43:53,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:43:53,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-11 04:43:53,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493100974] [2021-06-11 04:43:53,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-11 04:43:53,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:43:53,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-11 04:43:53,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-11 04:43:53,605 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 352 [2021-06-11 04:43:53,606 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 122 transitions, 1220 flow. Second operand has 11 states, 11 states have (on average 190.27272727272728) internal successors, (2093), 11 states have internal predecessors, (2093), 0 states have call successors, (0), 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-06-11 04:43:53,606 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:43:53,606 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 352 [2021-06-11 04:43:53,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:43:55,128 INFO L129 PetriNetUnfolder]: 9996/14072 cut-off events. [2021-06-11 04:43:55,128 INFO L130 PetriNetUnfolder]: For 137251/137935 co-relation queries the response was YES. [2021-06-11 04:43:55,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63922 conditions, 14072 events. 9996/14072 cut-off events. For 137251/137935 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 77637 event pairs, 1895 based on Foata normal form. 94/10904 useless extension candidates. Maximal degree in co-relation 53185. Up to 9968 conditions per place. [2021-06-11 04:43:55,214 INFO L132 encePairwiseOnDemand]: 341/352 looper letters, 133 selfloop transitions, 31 changer transitions 7/200 dead transitions. [2021-06-11 04:43:55,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 200 transitions, 2429 flow [2021-06-11 04:43:55,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 04:43:55,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 04:43:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2180 transitions. [2021-06-11 04:43:55,220 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5630165289256198 [2021-06-11 04:43:55,220 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2180 transitions. [2021-06-11 04:43:55,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2180 transitions. [2021-06-11 04:43:55,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:43:55,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2180 transitions. [2021-06-11 04:43:55,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 198.1818181818182) internal successors, (2180), 11 states have internal predecessors, (2180), 0 states have call successors, (0), 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-06-11 04:43:55,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 352.0) internal successors, (4224), 12 states have internal predecessors, (4224), 0 states have call successors, (0), 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-06-11 04:43:55,230 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 352.0) internal successors, (4224), 12 states have internal predecessors, (4224), 0 states have call successors, (0), 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-06-11 04:43:55,230 INFO L185 Difference]: Start difference. First operand has 99 places, 122 transitions, 1220 flow. Second operand 11 states and 2180 transitions. [2021-06-11 04:43:55,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 200 transitions, 2429 flow [2021-06-11 04:43:55,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 200 transitions, 2418 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-06-11 04:43:55,336 INFO L241 Difference]: Finished difference. Result has 113 places, 145 transitions, 1665 flow [2021-06-11 04:43:55,336 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1665, PETRI_PLACES=113, PETRI_TRANSITIONS=145} [2021-06-11 04:43:55,336 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 54 predicate places. [2021-06-11 04:43:55,337 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:43:55,337 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 145 transitions, 1665 flow [2021-06-11 04:43:55,337 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 145 transitions, 1665 flow [2021-06-11 04:43:55,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 145 transitions, 1665 flow [2021-06-11 04:43:55,589 INFO L129 PetriNetUnfolder]: 2386/4460 cut-off events. [2021-06-11 04:43:55,589 INFO L130 PetriNetUnfolder]: For 24706/25399 co-relation queries the response was YES. [2021-06-11 04:43:55,611 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14094 conditions, 4460 events. 2386/4460 cut-off events. For 24706/25399 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 32595 event pairs, 60 based on Foata normal form. 70/3215 useless extension candidates. Maximal degree in co-relation 11342. Up to 1026 conditions per place. [2021-06-11 04:43:55,647 INFO L151 LiptonReduction]: Number of co-enabled transitions 2414 [2021-06-11 04:43:55,652 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:43:55,652 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:43:55,652 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 315 [2021-06-11 04:43:55,653 INFO L480 AbstractCegarLoop]: Abstraction has has 113 places, 145 transitions, 1665 flow [2021-06-11 04:43:55,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 190.27272727272728) internal successors, (2093), 11 states have internal predecessors, (2093), 0 states have call successors, (0), 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-06-11 04:43:55,653 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:43:55,654 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 04:43:55,654 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 04:43:55,654 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-06-11 04:43:55,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:43:55,654 INFO L82 PathProgramCache]: Analyzing trace with hash 773047729, now seen corresponding path program 2 times [2021-06-11 04:43:55,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:43:55,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766208145] [2021-06-11 04:43:55,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:43:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:43:55,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:55,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:43:55,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:55,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:43:55,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:55,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:43:55,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:55,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:43:55,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:55,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:43:55,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:55,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:43:55,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:55,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:43:55,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:55,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:55,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:43:55,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766208145] [2021-06-11 04:43:55,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:43:55,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-11 04:43:55,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621445241] [2021-06-11 04:43:55,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 04:43:55,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:43:55,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 04:43:55,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-11 04:43:55,735 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 352 [2021-06-11 04:43:55,736 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 145 transitions, 1665 flow. Second operand has 9 states, 9 states have (on average 192.55555555555554) internal successors, (1733), 9 states have internal predecessors, (1733), 0 states have call successors, (0), 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-06-11 04:43:55,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:43:55,737 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 352 [2021-06-11 04:43:55,737 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:43:57,582 INFO L129 PetriNetUnfolder]: 13151/18238 cut-off events. [2021-06-11 04:43:57,582 INFO L130 PetriNetUnfolder]: For 202995/203772 co-relation queries the response was YES. [2021-06-11 04:43:57,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86115 conditions, 18238 events. 13151/18238 cut-off events. For 202995/203772 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 100955 event pairs, 2711 based on Foata normal form. 96/13938 useless extension candidates. Maximal degree in co-relation 74975. Up to 7837 conditions per place. [2021-06-11 04:43:57,686 INFO L132 encePairwiseOnDemand]: 342/352 looper letters, 166 selfloop transitions, 39 changer transitions 7/241 dead transitions. [2021-06-11 04:43:57,687 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 241 transitions, 3199 flow [2021-06-11 04:43:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 04:43:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 04:43:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1824 transitions. [2021-06-11 04:43:57,690 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2021-06-11 04:43:57,690 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1824 transitions. [2021-06-11 04:43:57,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1824 transitions. [2021-06-11 04:43:57,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:43:57,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1824 transitions. [2021-06-11 04:43:57,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 202.66666666666666) internal successors, (1824), 9 states have internal predecessors, (1824), 0 states have call successors, (0), 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-06-11 04:43:57,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:43:57,698 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:43:57,698 INFO L185 Difference]: Start difference. First operand has 113 places, 145 transitions, 1665 flow. Second operand 9 states and 1824 transitions. [2021-06-11 04:43:57,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 241 transitions, 3199 flow [2021-06-11 04:43:57,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 241 transitions, 3054 flow, removed 71 selfloop flow, removed 1 redundant places. [2021-06-11 04:43:57,879 INFO L241 Difference]: Finished difference. Result has 124 places, 159 transitions, 1949 flow [2021-06-11 04:43:57,879 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1949, PETRI_PLACES=124, PETRI_TRANSITIONS=159} [2021-06-11 04:43:57,879 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 65 predicate places. [2021-06-11 04:43:57,879 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:43:57,879 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 159 transitions, 1949 flow [2021-06-11 04:43:57,880 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 159 transitions, 1949 flow [2021-06-11 04:43:57,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 159 transitions, 1949 flow [2021-06-11 04:43:58,374 INFO L129 PetriNetUnfolder]: 2942/5452 cut-off events. [2021-06-11 04:43:58,374 INFO L130 PetriNetUnfolder]: For 32141/32990 co-relation queries the response was YES. [2021-06-11 04:43:58,397 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17492 conditions, 5452 events. 2942/5452 cut-off events. For 32141/32990 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 40965 event pairs, 75 based on Foata normal form. 85/3890 useless extension candidates. Maximal degree in co-relation 14795. Up to 1270 conditions per place. [2021-06-11 04:43:58,435 INFO L151 LiptonReduction]: Number of co-enabled transitions 2664 [2021-06-11 04:43:58,440 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:43:58,440 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:43:58,440 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 561 [2021-06-11 04:43:58,441 INFO L480 AbstractCegarLoop]: Abstraction has has 124 places, 159 transitions, 1949 flow [2021-06-11 04:43:58,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 192.55555555555554) internal successors, (1733), 9 states have internal predecessors, (1733), 0 states have call successors, (0), 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-06-11 04:43:58,441 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:43:58,441 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 04:43:58,441 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 04:43:58,441 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-06-11 04:43:58,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:43:58,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1888421025, now seen corresponding path program 1 times [2021-06-11 04:43:58,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:43:58,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318829700] [2021-06-11 04:43:58,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:43:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:43:58,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:58,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:43:58,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:58,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 04:43:58,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:58,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:43:58,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:58,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:43:58,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:43:58,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:43:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:43:58,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318829700] [2021-06-11 04:43:58,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:43:58,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 04:43:58,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171359195] [2021-06-11 04:43:58,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 04:43:58,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:43:58,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 04:43:58,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 04:43:58,508 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 352 [2021-06-11 04:43:58,509 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 159 transitions, 1949 flow. Second operand has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-06-11 04:43:58,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:43:58,509 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 352 [2021-06-11 04:43:58,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:43:59,674 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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][82], [Black: 309#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 318#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 385#(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: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 387#(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: 373#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 379#(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: 381#(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: 263#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 330#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 383#(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: 254#(= |ULTIMATE.start_main_#t~mem18| 5), 395#true, Black: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 275#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 332#(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: 334#(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: 277#(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|)), 351#(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: 402#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 213#(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: 407#(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: 409#(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: 218#(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: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 413#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 353#(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: 355#(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: 357#(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|)), 42#L1156-1true, Black: 291#(= |ULTIMATE.start_main_#t~mem18| 5), 363#true, 428#(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: 230#(= |ULTIMATE.start_main_#t~mem18| 5), 302#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 239#true, Black: 241#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 242#|ULTIMATE.start_main_#t~short21|, Black: 244#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 125#L1164-2true]) [2021-06-11 04:43:59,675 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-06-11 04:43:59,675 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:59,675 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:59,675 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:59,677 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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][50], [Black: 309#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 318#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 385#(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: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 387#(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: 373#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 379#(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: 263#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 381#(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: 383#(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: 254#(= |ULTIMATE.start_main_#t~mem18| 5), 395#true, 334#(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: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 336#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 330#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 332#(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))), 279#(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: 277#(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: 402#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 213#(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: 407#(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: 409#(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: 218#(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: 413#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 355#(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: 353#(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: 357#(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|)), 426#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 351#(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|)), 42#L1156-1true, Black: 291#(= |ULTIMATE.start_main_#t~mem18| 5), 363#true, Black: 230#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 302#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 244#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 241#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 242#|ULTIMATE.start_main_#t~short21|, Black: 239#true, 125#L1164-2true]) [2021-06-11 04:43:59,677 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-06-11 04:43:59,677 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:59,677 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:59,677 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:43:59,688 INFO L129 PetriNetUnfolder]: 7215/11043 cut-off events. [2021-06-11 04:43:59,689 INFO L130 PetriNetUnfolder]: For 149669/150995 co-relation queries the response was YES. [2021-06-11 04:43:59,753 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58654 conditions, 11043 events. 7215/11043 cut-off events. For 149669/150995 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 69666 event pairs, 685 based on Foata normal form. 534/9323 useless extension candidates. Maximal degree in co-relation 49267. Up to 5396 conditions per place. [2021-06-11 04:43:59,806 INFO L132 encePairwiseOnDemand]: 344/352 looper letters, 102 selfloop transitions, 28 changer transitions 0/181 dead transitions. [2021-06-11 04:43:59,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 181 transitions, 2477 flow [2021-06-11 04:43:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 04:43:59,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 04:43:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1277 transitions. [2021-06-11 04:43:59,809 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7255681818181818 [2021-06-11 04:43:59,809 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1277 transitions. [2021-06-11 04:43:59,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1277 transitions. [2021-06-11 04:43:59,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:43:59,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1277 transitions. [2021-06-11 04:43:59,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 255.4) internal successors, (1277), 5 states have internal predecessors, (1277), 0 states have call successors, (0), 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-06-11 04:43:59,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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-06-11 04:43:59,814 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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-06-11 04:43:59,814 INFO L185 Difference]: Start difference. First operand has 124 places, 159 transitions, 1949 flow. Second operand 5 states and 1277 transitions. [2021-06-11 04:43:59,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 181 transitions, 2477 flow [2021-06-11 04:44:00,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 181 transitions, 2432 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-06-11 04:44:00,012 INFO L241 Difference]: Finished difference. Result has 126 places, 163 transitions, 2075 flow [2021-06-11 04:44:00,012 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2075, PETRI_PLACES=126, PETRI_TRANSITIONS=163} [2021-06-11 04:44:00,012 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 67 predicate places. [2021-06-11 04:44:00,012 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:44:00,012 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 163 transitions, 2075 flow [2021-06-11 04:44:00,013 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 163 transitions, 2075 flow [2021-06-11 04:44:00,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 163 transitions, 2075 flow [2021-06-11 04:44:00,414 INFO L129 PetriNetUnfolder]: 3009/5580 cut-off events. [2021-06-11 04:44:00,415 INFO L130 PetriNetUnfolder]: For 32465/33021 co-relation queries the response was YES. [2021-06-11 04:44:00,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18093 conditions, 5580 events. 3009/5580 cut-off events. For 32465/33021 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 42203 event pairs, 63 based on Foata normal form. 100/3995 useless extension candidates. Maximal degree in co-relation 15116. Up to 1326 conditions per place. [2021-06-11 04:44:00,504 INFO L151 LiptonReduction]: Number of co-enabled transitions 2690 [2021-06-11 04:44:00,510 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:44:00,510 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:44:00,510 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 498 [2021-06-11 04:44:00,510 INFO L480 AbstractCegarLoop]: Abstraction has has 126 places, 163 transitions, 2075 flow [2021-06-11 04:44:00,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-06-11 04:44:00,511 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:44:00,511 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 04:44:00,511 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 04:44:00,511 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-06-11 04:44:00,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:44:00,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1260243037, now seen corresponding path program 1 times [2021-06-11 04:44:00,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:44:00,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139067404] [2021-06-11 04:44:00,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:44:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:44:00,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:00,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 04:44:00,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:00,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 04:44:00,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:00,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:44:00,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:00,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:44:00,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:00,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:44:00,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:00,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:44:00,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:00,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 04:44:00,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:00,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:44:00,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:00,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:44:00,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:44:00,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139067404] [2021-06-11 04:44:00,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:44:00,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-11 04:44:00,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980469868] [2021-06-11 04:44:00,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 04:44:00,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:44:00,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 04:44:00,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-11 04:44:00,721 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 352 [2021-06-11 04:44:00,723 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 163 transitions, 2075 flow. Second operand has 10 states, 10 states have (on average 191.5) internal successors, (1915), 10 states have internal predecessors, (1915), 0 states have call successors, (0), 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-06-11 04:44:00,723 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:44:00,723 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 352 [2021-06-11 04:44:00,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:44:03,066 INFO L129 PetriNetUnfolder]: 14785/20597 cut-off events. [2021-06-11 04:44:03,066 INFO L130 PetriNetUnfolder]: For 259660/260008 co-relation queries the response was YES. [2021-06-11 04:44:03,156 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99701 conditions, 20597 events. 14785/20597 cut-off events. For 259660/260008 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 116409 event pairs, 3204 based on Foata normal form. 88/15661 useless extension candidates. Maximal degree in co-relation 88304. Up to 14994 conditions per place. [2021-06-11 04:44:03,198 INFO L132 encePairwiseOnDemand]: 339/352 looper letters, 138 selfloop transitions, 33 changer transitions 3/203 dead transitions. [2021-06-11 04:44:03,198 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 203 transitions, 2933 flow [2021-06-11 04:44:03,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 04:44:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 04:44:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1789 transitions. [2021-06-11 04:44:03,201 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5647095959595959 [2021-06-11 04:44:03,201 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1789 transitions. [2021-06-11 04:44:03,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1789 transitions. [2021-06-11 04:44:03,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:44:03,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1789 transitions. [2021-06-11 04:44:03,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.77777777777777) internal successors, (1789), 9 states have internal predecessors, (1789), 0 states have call successors, (0), 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-06-11 04:44:03,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:44:03,207 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:44:03,207 INFO L185 Difference]: Start difference. First operand has 126 places, 163 transitions, 2075 flow. Second operand 9 states and 1789 transitions. [2021-06-11 04:44:03,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 203 transitions, 2933 flow [2021-06-11 04:44:03,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 203 transitions, 2894 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 04:44:03,534 INFO L241 Difference]: Finished difference. Result has 134 places, 174 transitions, 2390 flow [2021-06-11 04:44:03,534 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=2044, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2390, PETRI_PLACES=134, PETRI_TRANSITIONS=174} [2021-06-11 04:44:03,534 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 75 predicate places. [2021-06-11 04:44:03,534 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:44:03,534 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 174 transitions, 2390 flow [2021-06-11 04:44:03,534 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 174 transitions, 2390 flow [2021-06-11 04:44:03,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 174 transitions, 2390 flow [2021-06-11 04:44:04,000 INFO L129 PetriNetUnfolder]: 3257/6009 cut-off events. [2021-06-11 04:44:04,000 INFO L130 PetriNetUnfolder]: For 40626/41452 co-relation queries the response was YES. [2021-06-11 04:44:04,035 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19962 conditions, 6009 events. 3257/6009 cut-off events. For 40626/41452 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 45832 event pairs, 67 based on Foata normal form. 80/4253 useless extension candidates. Maximal degree in co-relation 17078. Up to 1414 conditions per place. [2021-06-11 04:44:04,090 INFO L151 LiptonReduction]: Number of co-enabled transitions 2816 [2021-06-11 04:44:04,096 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:44:04,096 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:44:04,096 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 562 [2021-06-11 04:44:04,097 INFO L480 AbstractCegarLoop]: Abstraction has has 134 places, 174 transitions, 2390 flow [2021-06-11 04:44:04,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 191.5) internal successors, (1915), 10 states have internal predecessors, (1915), 0 states have call successors, (0), 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-06-11 04:44:04,097 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:44:04,097 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 04:44:04,097 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 04:44:04,097 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-06-11 04:44:04,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:44:04,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1588430761, now seen corresponding path program 2 times [2021-06-11 04:44:04,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:44:04,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263776690] [2021-06-11 04:44:04,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:44:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:44:04,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:04,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 04:44:04,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:04,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-06-11 04:44:04,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:04,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-06-11 04:44:04,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:04,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 04:44:04,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:04,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:44:04,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:04,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:44:04,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:04,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-06-11 04:44:04,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:04,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-06-11 04:44:04,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:04,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 04:44:04,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:04,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:44:04,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:04,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:44:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:44:04,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263776690] [2021-06-11 04:44:04,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:44:04,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-11 04:44:04,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642669786] [2021-06-11 04:44:04,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-11 04:44:04,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:44:04,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-11 04:44:04,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-06-11 04:44:04,311 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 352 [2021-06-11 04:44:04,312 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 174 transitions, 2390 flow. Second operand has 11 states, 11 states have (on average 188.36363636363637) internal successors, (2072), 11 states have internal predecessors, (2072), 0 states have call successors, (0), 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-06-11 04:44:04,312 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:44:04,312 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 352 [2021-06-11 04:44:04,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:44:04,471 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2021-06-11 04:44:07,215 INFO L129 PetriNetUnfolder]: 16119/22346 cut-off events. [2021-06-11 04:44:07,215 INFO L130 PetriNetUnfolder]: For 300945/301950 co-relation queries the response was YES. [2021-06-11 04:44:07,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109890 conditions, 22346 events. 16119/22346 cut-off events. For 300945/301950 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 126344 event pairs, 2708 based on Foata normal form. 111/16883 useless extension candidates. Maximal degree in co-relation 98234. Up to 14405 conditions per place. [2021-06-11 04:44:07,368 INFO L132 encePairwiseOnDemand]: 339/352 looper letters, 195 selfloop transitions, 56 changer transitions 15/295 dead transitions. [2021-06-11 04:44:07,368 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 295 transitions, 4750 flow [2021-06-11 04:44:07,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-11 04:44:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-11 04:44:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1975 transitions. [2021-06-11 04:44:07,370 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5610795454545454 [2021-06-11 04:44:07,370 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1975 transitions. [2021-06-11 04:44:07,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1975 transitions. [2021-06-11 04:44:07,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:44:07,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1975 transitions. [2021-06-11 04:44:07,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 197.5) internal successors, (1975), 10 states have internal predecessors, (1975), 0 states have call successors, (0), 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-06-11 04:44:07,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 352.0) internal successors, (3872), 11 states have internal predecessors, (3872), 0 states have call successors, (0), 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-06-11 04:44:07,376 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 352.0) internal successors, (3872), 11 states have internal predecessors, (3872), 0 states have call successors, (0), 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-06-11 04:44:07,376 INFO L185 Difference]: Start difference. First operand has 134 places, 174 transitions, 2390 flow. Second operand 10 states and 1975 transitions. [2021-06-11 04:44:07,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 295 transitions, 4750 flow [2021-06-11 04:44:07,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 295 transitions, 4559 flow, removed 70 selfloop flow, removed 5 redundant places. [2021-06-11 04:44:07,782 INFO L241 Difference]: Finished difference. Result has 142 places, 198 transitions, 2846 flow [2021-06-11 04:44:07,782 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=2231, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2846, PETRI_PLACES=142, PETRI_TRANSITIONS=198} [2021-06-11 04:44:07,782 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 83 predicate places. [2021-06-11 04:44:07,782 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:44:07,782 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 198 transitions, 2846 flow [2021-06-11 04:44:07,783 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 198 transitions, 2846 flow [2021-06-11 04:44:07,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 142 places, 198 transitions, 2846 flow [2021-06-11 04:44:08,309 INFO L129 PetriNetUnfolder]: 3459/6368 cut-off events. [2021-06-11 04:44:08,309 INFO L130 PetriNetUnfolder]: For 44706/45361 co-relation queries the response was YES. [2021-06-11 04:44:08,352 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21373 conditions, 6368 events. 3459/6368 cut-off events. For 44706/45361 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 48850 event pairs, 35 based on Foata normal form. 171/4564 useless extension candidates. Maximal degree in co-relation 18492. Up to 1524 conditions per place. [2021-06-11 04:44:08,409 INFO L151 LiptonReduction]: Number of co-enabled transitions 2918 [2021-06-11 04:44:08,417 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:44:08,417 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:44:08,417 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 635 [2021-06-11 04:44:08,417 INFO L480 AbstractCegarLoop]: Abstraction has has 142 places, 198 transitions, 2846 flow [2021-06-11 04:44:08,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 188.36363636363637) internal successors, (2072), 11 states have internal predecessors, (2072), 0 states have call successors, (0), 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-06-11 04:44:08,418 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:44:08,418 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-06-11 04:44:08,418 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 04:44:08,418 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-06-11 04:44:08,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:44:08,418 INFO L82 PathProgramCache]: Analyzing trace with hash 106885866, now seen corresponding path program 1 times [2021-06-11 04:44:08,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:44:08,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445200271] [2021-06-11 04:44:08,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:44:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:44:08,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:08,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:44:08,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:08,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:44:08,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:08,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:44:08,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:08,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:44:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:44:08,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445200271] [2021-06-11 04:44:08,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:44:08,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 04:44:08,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697223719] [2021-06-11 04:44:08,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 04:44:08,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:44:08,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 04:44:08,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-11 04:44:08,456 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 352 [2021-06-11 04:44:08,456 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 198 transitions, 2846 flow. Second operand has 5 states, 5 states have (on average 239.6) internal successors, (1198), 5 states have internal predecessors, (1198), 0 states have call successors, (0), 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-06-11 04:44:08,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:44:08,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 352 [2021-06-11 04:44:08,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:44:10,806 INFO L129 PetriNetUnfolder]: 15323/21473 cut-off events. [2021-06-11 04:44:10,807 INFO L130 PetriNetUnfolder]: For 293093/293622 co-relation queries the response was YES. [2021-06-11 04:44:10,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106619 conditions, 21473 events. 15323/21473 cut-off events. For 293093/293622 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 123842 event pairs, 3273 based on Foata normal form. 77/16235 useless extension candidates. Maximal degree in co-relation 91234. Up to 16192 conditions per place. [2021-06-11 04:44:10,949 INFO L132 encePairwiseOnDemand]: 345/352 looper letters, 194 selfloop transitions, 7 changer transitions 20/259 dead transitions. [2021-06-11 04:44:10,949 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 259 transitions, 4158 flow [2021-06-11 04:44:10,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 04:44:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 04:44:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1485 transitions. [2021-06-11 04:44:10,954 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.703125 [2021-06-11 04:44:10,954 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1485 transitions. [2021-06-11 04:44:10,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1485 transitions. [2021-06-11 04:44:10,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:44:10,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1485 transitions. [2021-06-11 04:44:10,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 247.5) internal successors, (1485), 6 states have internal predecessors, (1485), 0 states have call successors, (0), 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-06-11 04:44:10,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 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-06-11 04:44:10,958 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 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-06-11 04:44:10,958 INFO L185 Difference]: Start difference. First operand has 142 places, 198 transitions, 2846 flow. Second operand 6 states and 1485 transitions. [2021-06-11 04:44:10,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 259 transitions, 4158 flow [2021-06-11 04:44:11,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 259 transitions, 4044 flow, removed 36 selfloop flow, removed 4 redundant places. [2021-06-11 04:44:11,324 INFO L241 Difference]: Finished difference. Result has 145 places, 199 transitions, 2769 flow [2021-06-11 04:44:11,324 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=2741, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2769, PETRI_PLACES=145, PETRI_TRANSITIONS=199} [2021-06-11 04:44:11,324 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 86 predicate places. [2021-06-11 04:44:11,324 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:44:11,325 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 199 transitions, 2769 flow [2021-06-11 04:44:11,325 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 199 transitions, 2769 flow [2021-06-11 04:44:11,326 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 145 places, 199 transitions, 2769 flow [2021-06-11 04:44:11,871 INFO L129 PetriNetUnfolder]: 3468/6384 cut-off events. [2021-06-11 04:44:11,871 INFO L130 PetriNetUnfolder]: For 42948/43735 co-relation queries the response was YES. [2021-06-11 04:44:11,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21194 conditions, 6384 events. 3468/6384 cut-off events. For 42948/43735 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 48912 event pairs, 39 based on Foata normal form. 239/4658 useless extension candidates. Maximal degree in co-relation 19506. Up to 1544 conditions per place. [2021-06-11 04:44:11,968 INFO L151 LiptonReduction]: Number of co-enabled transitions 2902 [2021-06-11 04:44:11,976 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:44:11,976 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:44:11,977 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 653 [2021-06-11 04:44:11,977 INFO L480 AbstractCegarLoop]: Abstraction has has 145 places, 199 transitions, 2769 flow [2021-06-11 04:44:11,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 239.6) internal successors, (1198), 5 states have internal predecessors, (1198), 0 states have call successors, (0), 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-06-11 04:44:11,977 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:44:11,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] [2021-06-11 04:44:11,978 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 04:44:11,978 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-06-11 04:44:11,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:44:11,978 INFO L82 PathProgramCache]: Analyzing trace with hash -860719780, now seen corresponding path program 2 times [2021-06-11 04:44:11,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:44:11,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068736135] [2021-06-11 04:44:11,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:44:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:44:11,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:11,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:44:12,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:12,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 04:44:12,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:12,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:44:12,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:12,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:44:12,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:12,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:44:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:44:12,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068736135] [2021-06-11 04:44:12,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:44:12,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 04:44:12,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151356863] [2021-06-11 04:44:12,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 04:44:12,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:44:12,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 04:44:12,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-11 04:44:12,020 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 352 [2021-06-11 04:44:12,020 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 199 transitions, 2769 flow. Second operand has 6 states, 6 states have (on average 195.5) internal successors, (1173), 6 states have internal predecessors, (1173), 0 states have call successors, (0), 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-06-11 04:44:12,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:44:12,021 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 352 [2021-06-11 04:44:12,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:44:14,311 INFO L129 PetriNetUnfolder]: 14813/20829 cut-off events. [2021-06-11 04:44:14,311 INFO L130 PetriNetUnfolder]: For 274741/275163 co-relation queries the response was YES. [2021-06-11 04:44:14,429 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103524 conditions, 20829 events. 14813/20829 cut-off events. For 274741/275163 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 119966 event pairs, 3203 based on Foata normal form. 155/15892 useless extension candidates. Maximal degree in co-relation 95042. Up to 13668 conditions per place. [2021-06-11 04:44:14,475 INFO L132 encePairwiseOnDemand]: 344/352 looper letters, 187 selfloop transitions, 17 changer transitions 20/260 dead transitions. [2021-06-11 04:44:14,475 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 260 transitions, 4077 flow [2021-06-11 04:44:14,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-11 04:44:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-11 04:44:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1611 transitions. [2021-06-11 04:44:14,477 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5720880681818182 [2021-06-11 04:44:14,478 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1611 transitions. [2021-06-11 04:44:14,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1611 transitions. [2021-06-11 04:44:14,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:44:14,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1611 transitions. [2021-06-11 04:44:14,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 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-06-11 04:44:14,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 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-06-11 04:44:14,482 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 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-06-11 04:44:14,482 INFO L185 Difference]: Start difference. First operand has 145 places, 199 transitions, 2769 flow. Second operand 8 states and 1611 transitions. [2021-06-11 04:44:14,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 260 transitions, 4077 flow [2021-06-11 04:44:14,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 260 transitions, 3994 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-06-11 04:44:14,838 INFO L241 Difference]: Finished difference. Result has 149 places, 200 transitions, 2768 flow [2021-06-11 04:44:14,838 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=2711, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2768, PETRI_PLACES=149, PETRI_TRANSITIONS=200} [2021-06-11 04:44:14,839 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 90 predicate places. [2021-06-11 04:44:14,839 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:44:14,839 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 200 transitions, 2768 flow [2021-06-11 04:44:14,839 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 200 transitions, 2768 flow [2021-06-11 04:44:14,841 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 149 places, 200 transitions, 2768 flow [2021-06-11 04:44:15,484 INFO L129 PetriNetUnfolder]: 3472/6395 cut-off events. [2021-06-11 04:44:15,484 INFO L130 PetriNetUnfolder]: For 39585/40489 co-relation queries the response was YES. [2021-06-11 04:44:15,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21043 conditions, 6395 events. 3472/6395 cut-off events. For 39585/40489 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 49266 event pairs, 53 based on Foata normal form. 204/4633 useless extension candidates. Maximal degree in co-relation 18236. Up to 1568 conditions per place. [2021-06-11 04:44:15,573 INFO L151 LiptonReduction]: Number of co-enabled transitions 2856 [2021-06-11 04:44:15,580 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:44:15,580 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:44:15,581 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 742 [2021-06-11 04:44:15,581 INFO L480 AbstractCegarLoop]: Abstraction has has 149 places, 200 transitions, 2768 flow [2021-06-11 04:44:15,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 195.5) internal successors, (1173), 6 states have internal predecessors, (1173), 0 states have call successors, (0), 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-06-11 04:44:15,581 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:44:15,581 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-06-11 04:44:15,581 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-11 04:44:15,582 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-06-11 04:44:15,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:44:15,582 INFO L82 PathProgramCache]: Analyzing trace with hash 346651116, now seen corresponding path program 1 times [2021-06-11 04:44:15,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:44:15,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366955214] [2021-06-11 04:44:15,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:44:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:44:15,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:15,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:44:15,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:15,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 04:44:15,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:15,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 04:44:15,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:15,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:44:15,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:15,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:44:15,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:15,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:44:15,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:15,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:44:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:44:15,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366955214] [2021-06-11 04:44:15,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:44:15,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 04:44:15,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279527138] [2021-06-11 04:44:15,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 04:44:15,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:44:15,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 04:44:15,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-11 04:44:15,648 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 352 [2021-06-11 04:44:15,649 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 200 transitions, 2768 flow. Second operand has 8 states, 8 states have (on average 214.625) internal successors, (1717), 8 states have internal predecessors, (1717), 0 states have call successors, (0), 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-06-11 04:44:15,649 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:44:15,649 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 352 [2021-06-11 04:44:15,649 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:44:17,432 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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: 385#(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: 387#(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: 373#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 519#(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: 379#(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: 263#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 381#(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: 254#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 383#(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|)))), 275#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 277#(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: 402#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 407#(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: 409#(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: 413#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 42#L1156-1true, Black: 291#(= |ULTIMATE.start_main_#t~mem18| 5), 428#(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|)), 302#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 309#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 318#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 448#(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: 440#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 446#(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: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 453#true, 330#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 332#(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: 334#(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: 467#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 473#(and (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 (and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~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: 475#(and (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 (and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~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|))), 351#(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: 213#(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: 463#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 218#(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: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 353#(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: 355#(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: 357#(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: 484#(= |ULTIMATE.start_main_#t~mem18| 5), 363#true, Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 230#(= |ULTIMATE.start_main_#t~mem18| 5), 493#true, Black: 241#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 242#|ULTIMATE.start_main_#t~short21|, Black: 244#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 497#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 506#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 125#L1164-2true]) [2021-06-11 04:44:17,433 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-06-11 04:44:17,433 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:17,433 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:17,433 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:17,448 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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: 385#(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: 387#(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: 373#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 379#(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: 263#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 381#(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: 254#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 383#(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|)))), 523#(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))), 279#(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: 277#(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: 402#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 407#(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: 409#(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: 413#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 42#L1156-1true, Black: 291#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 428#(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: 302#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 309#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 318#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 448#(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: 440#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 446#(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: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 453#true, 334#(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: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 330#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 332#(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: 467#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 473#(and (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 (and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~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: 475#(and (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 (and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~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: 213#(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: 463#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 218#(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: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 355#(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: 353#(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: 357#(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: 351#(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: 484#(= |ULTIMATE.start_main_#t~mem18| 5), 363#true, Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 230#(= |ULTIMATE.start_main_#t~mem18| 5), 493#true, 244#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 241#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 242#|ULTIMATE.start_main_#t~short21|, Black: 239#true, Black: 497#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 506#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 125#L1164-2true]) [2021-06-11 04:44:17,448 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-06-11 04:44:17,448 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:17,448 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:17,449 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:17,452 INFO L129 PetriNetUnfolder]: 9409/14459 cut-off events. [2021-06-11 04:44:17,452 INFO L130 PetriNetUnfolder]: For 221636/223263 co-relation queries the response was YES. [2021-06-11 04:44:17,538 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78889 conditions, 14459 events. 9409/14459 cut-off events. For 221636/223263 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 96415 event pairs, 431 based on Foata normal form. 612/11863 useless extension candidates. Maximal degree in co-relation 67289. Up to 4362 conditions per place. [2021-06-11 04:44:17,597 INFO L132 encePairwiseOnDemand]: 342/352 looper letters, 127 selfloop transitions, 96 changer transitions 4/280 dead transitions. [2021-06-11 04:44:17,597 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 280 transitions, 4330 flow [2021-06-11 04:44:17,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 04:44:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 04:44:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1995 transitions. [2021-06-11 04:44:17,599 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6297348484848485 [2021-06-11 04:44:17,599 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1995 transitions. [2021-06-11 04:44:17,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1995 transitions. [2021-06-11 04:44:17,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:44:17,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1995 transitions. [2021-06-11 04:44:17,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 221.66666666666666) internal successors, (1995), 9 states have internal predecessors, (1995), 0 states have call successors, (0), 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-06-11 04:44:17,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:44:17,603 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:44:17,603 INFO L185 Difference]: Start difference. First operand has 149 places, 200 transitions, 2768 flow. Second operand 9 states and 1995 transitions. [2021-06-11 04:44:17,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 280 transitions, 4330 flow [2021-06-11 04:44:17,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 280 transitions, 4289 flow, removed 2 selfloop flow, removed 7 redundant places. [2021-06-11 04:44:17,893 INFO L241 Difference]: Finished difference. Result has 155 places, 238 transitions, 3896 flow [2021-06-11 04:44:17,894 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=2729, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3896, PETRI_PLACES=155, PETRI_TRANSITIONS=238} [2021-06-11 04:44:17,894 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 96 predicate places. [2021-06-11 04:44:17,894 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:44:17,894 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 238 transitions, 3896 flow [2021-06-11 04:44:17,894 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 238 transitions, 3896 flow [2021-06-11 04:44:17,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 155 places, 238 transitions, 3896 flow [2021-06-11 04:44:18,708 INFO L129 PetriNetUnfolder]: 3945/7345 cut-off events. [2021-06-11 04:44:18,708 INFO L130 PetriNetUnfolder]: For 63567/64619 co-relation queries the response was YES. [2021-06-11 04:44:18,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26203 conditions, 7345 events. 3945/7345 cut-off events. For 63567/64619 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 58616 event pairs, 26 based on Foata normal form. 311/5452 useless extension candidates. Maximal degree in co-relation 25071. Up to 1800 conditions per place. [2021-06-11 04:44:18,876 INFO L151 LiptonReduction]: Number of co-enabled transitions 3802 [2021-06-11 04:44:18,888 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:44:18,888 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:44:18,888 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 994 [2021-06-11 04:44:18,889 INFO L480 AbstractCegarLoop]: Abstraction has has 155 places, 238 transitions, 3896 flow [2021-06-11 04:44:18,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 214.625) internal successors, (1717), 8 states have internal predecessors, (1717), 0 states have call successors, (0), 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-06-11 04:44:18,889 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:44:18,889 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-06-11 04:44:18,889 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-11 04:44:18,889 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-06-11 04:44:18,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:44:18,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1850235986, now seen corresponding path program 2 times [2021-06-11 04:44:18,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:44:18,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539813522] [2021-06-11 04:44:18,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:44:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:44:18,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:18,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:44:18,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:18,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:44:18,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:18,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:44:18,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:18,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:44:18,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:18,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 04:44:18,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:18,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:44:18,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:18,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:44:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:44:18,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539813522] [2021-06-11 04:44:18,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:44:18,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 04:44:18,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526467934] [2021-06-11 04:44:18,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 04:44:18,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:44:18,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 04:44:18,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-11 04:44:18,972 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 352 [2021-06-11 04:44:18,973 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 238 transitions, 3896 flow. Second operand has 8 states, 8 states have (on average 193.875) internal successors, (1551), 8 states have internal predecessors, (1551), 0 states have call successors, (0), 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-06-11 04:44:18,974 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:44:18,974 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 352 [2021-06-11 04:44:18,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:44:22,041 INFO L129 PetriNetUnfolder]: 16663/23699 cut-off events. [2021-06-11 04:44:22,042 INFO L130 PetriNetUnfolder]: For 392297/392787 co-relation queries the response was YES. [2021-06-11 04:44:22,195 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130069 conditions, 23699 events. 16663/23699 cut-off events. For 392297/392787 co-relation queries the response was YES. Maximal size of possible extension queue 1183. Compared 145162 event pairs, 3407 based on Foata normal form. 154/18061 useless extension candidates. Maximal degree in co-relation 126551. Up to 17440 conditions per place. [2021-06-11 04:44:22,249 INFO L132 encePairwiseOnDemand]: 343/352 looper letters, 246 selfloop transitions, 15 changer transitions 3/300 dead transitions. [2021-06-11 04:44:22,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 300 transitions, 5402 flow [2021-06-11 04:44:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 04:44:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 04:44:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1411 transitions. [2021-06-11 04:44:22,251 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5726461038961039 [2021-06-11 04:44:22,251 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1411 transitions. [2021-06-11 04:44:22,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1411 transitions. [2021-06-11 04:44:22,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:44:22,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1411 transitions. [2021-06-11 04:44:22,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 201.57142857142858) internal successors, (1411), 7 states have internal predecessors, (1411), 0 states have call successors, (0), 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-06-11 04:44:22,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:44:22,255 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:44:22,255 INFO L185 Difference]: Start difference. First operand has 155 places, 238 transitions, 3896 flow. Second operand 7 states and 1411 transitions. [2021-06-11 04:44:22,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 300 transitions, 5402 flow [2021-06-11 04:44:23,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 300 transitions, 5351 flow, removed 23 selfloop flow, removed 2 redundant places. [2021-06-11 04:44:23,336 INFO L241 Difference]: Finished difference. Result has 161 places, 244 transitions, 4016 flow [2021-06-11 04:44:23,336 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=3847, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4016, PETRI_PLACES=161, PETRI_TRANSITIONS=244} [2021-06-11 04:44:23,336 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 102 predicate places. [2021-06-11 04:44:23,337 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:44:23,337 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 244 transitions, 4016 flow [2021-06-11 04:44:23,337 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 244 transitions, 4016 flow [2021-06-11 04:44:23,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 161 places, 244 transitions, 4016 flow [2021-06-11 04:44:24,185 INFO L129 PetriNetUnfolder]: 4283/7973 cut-off events. [2021-06-11 04:44:24,185 INFO L130 PetriNetUnfolder]: For 69409/70606 co-relation queries the response was YES. [2021-06-11 04:44:24,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28527 conditions, 7973 events. 4283/7973 cut-off events. For 69409/70606 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 64548 event pairs, 27 based on Foata normal form. 345/5940 useless extension candidates. Maximal degree in co-relation 27481. Up to 1948 conditions per place. [2021-06-11 04:44:24,363 INFO L151 LiptonReduction]: Number of co-enabled transitions 3944 [2021-06-11 04:44:24,374 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:44:24,374 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:44:24,374 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1037 [2021-06-11 04:44:24,374 INFO L480 AbstractCegarLoop]: Abstraction has has 161 places, 244 transitions, 4016 flow [2021-06-11 04:44:24,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 193.875) internal successors, (1551), 8 states have internal predecessors, (1551), 0 states have call successors, (0), 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-06-11 04:44:24,375 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:44:24,375 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-06-11 04:44:24,375 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 04:44:24,375 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-06-11 04:44:24,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:44:24,376 INFO L82 PathProgramCache]: Analyzing trace with hash -920222308, now seen corresponding path program 3 times [2021-06-11 04:44:24,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:44:24,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927769707] [2021-06-11 04:44:24,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:44:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:44:24,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:24,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:44:24,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:24,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:44:24,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:24,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:44:24,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:24,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:44:24,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:24,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:44:24,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:24,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:44:24,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:24,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:44:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:44:24,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927769707] [2021-06-11 04:44:24,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:44:24,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 04:44:24,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392003756] [2021-06-11 04:44:24,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 04:44:24,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:44:24,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 04:44:24,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-11 04:44:24,447 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 352 [2021-06-11 04:44:24,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 244 transitions, 4016 flow. Second operand has 8 states, 8 states have (on average 193.875) internal successors, (1551), 8 states have internal predecessors, (1551), 0 states have call successors, (0), 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-06-11 04:44:24,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:44:24,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 352 [2021-06-11 04:44:24,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:44:27,916 INFO L129 PetriNetUnfolder]: 18240/25818 cut-off events. [2021-06-11 04:44:27,916 INFO L130 PetriNetUnfolder]: For 434662/434946 co-relation queries the response was YES. [2021-06-11 04:44:28,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143007 conditions, 25818 events. 18240/25818 cut-off events. For 434662/434946 co-relation queries the response was YES. Maximal size of possible extension queue 1257. Compared 158030 event pairs, 3625 based on Foata normal form. 130/19645 useless extension candidates. Maximal degree in co-relation 139693. Up to 14695 conditions per place. [2021-06-11 04:44:28,244 INFO L132 encePairwiseOnDemand]: 343/352 looper letters, 290 selfloop transitions, 29 changer transitions 6/361 dead transitions. [2021-06-11 04:44:28,244 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 361 transitions, 6465 flow [2021-06-11 04:44:28,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 04:44:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 04:44:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1823 transitions. [2021-06-11 04:44:28,246 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5754419191919192 [2021-06-11 04:44:28,246 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1823 transitions. [2021-06-11 04:44:28,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1823 transitions. [2021-06-11 04:44:28,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:44:28,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1823 transitions. [2021-06-11 04:44:28,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 202.55555555555554) internal successors, (1823), 9 states have internal predecessors, (1823), 0 states have call successors, (0), 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-06-11 04:44:28,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:44:28,249 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:44:28,249 INFO L185 Difference]: Start difference. First operand has 161 places, 244 transitions, 4016 flow. Second operand 9 states and 1823 transitions. [2021-06-11 04:44:28,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 361 transitions, 6465 flow [2021-06-11 04:44:29,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 361 transitions, 6416 flow, removed 12 selfloop flow, removed 4 redundant places. [2021-06-11 04:44:29,568 INFO L241 Difference]: Finished difference. Result has 168 places, 249 transitions, 4156 flow [2021-06-11 04:44:29,569 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=3951, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4156, PETRI_PLACES=168, PETRI_TRANSITIONS=249} [2021-06-11 04:44:29,569 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 109 predicate places. [2021-06-11 04:44:29,569 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:44:29,569 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 249 transitions, 4156 flow [2021-06-11 04:44:29,569 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 249 transitions, 4156 flow [2021-06-11 04:44:29,571 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 168 places, 249 transitions, 4156 flow [2021-06-11 04:44:30,413 INFO L129 PetriNetUnfolder]: 4613/8595 cut-off events. [2021-06-11 04:44:30,413 INFO L130 PetriNetUnfolder]: For 76373/77767 co-relation queries the response was YES. [2021-06-11 04:44:30,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30720 conditions, 8595 events. 4613/8595 cut-off events. For 76373/77767 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 70714 event pairs, 28 based on Foata normal form. 394/6426 useless extension candidates. Maximal degree in co-relation 29671. Up to 2108 conditions per place. [2021-06-11 04:44:30,559 INFO L151 LiptonReduction]: Number of co-enabled transitions 4088 [2021-06-11 04:44:30,570 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:44:30,570 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:44:30,570 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1001 [2021-06-11 04:44:30,571 INFO L480 AbstractCegarLoop]: Abstraction has has 168 places, 249 transitions, 4156 flow [2021-06-11 04:44:30,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 193.875) internal successors, (1551), 8 states have internal predecessors, (1551), 0 states have call successors, (0), 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-06-11 04:44:30,571 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:44:30,571 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-06-11 04:44:30,571 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-11 04:44:30,572 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-06-11 04:44:30,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:44:30,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1574598973, now seen corresponding path program 1 times [2021-06-11 04:44:30,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:44:30,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546146324] [2021-06-11 04:44:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:44:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:44:30,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:30,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:44:30,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:30,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 04:44:30,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:30,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 04:44:30,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:30,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:44:30,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:30,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:44:30,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:30,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:44:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:44:30,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546146324] [2021-06-11 04:44:30,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:44:30,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 04:44:30,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336218084] [2021-06-11 04:44:30,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 04:44:30,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:44:30,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 04:44:30,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-11 04:44:30,641 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 352 [2021-06-11 04:44:30,642 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 249 transitions, 4156 flow. Second operand has 7 states, 7 states have (on average 227.85714285714286) internal successors, (1595), 7 states have internal predecessors, (1595), 0 states have call successors, (0), 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-06-11 04:44:30,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:44:30,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 352 [2021-06-11 04:44:30,642 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:44:32,961 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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][70], [Black: 385#(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: 387#(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: 373#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 379#(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: 381#(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: 263#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 254#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 383#(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|)))), 523#(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))), Black: 513#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|))), Black: 519#(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: 521#(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: 525#(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|)), 279#(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: 277#(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: 402#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 407#(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: 409#(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: 413#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 539#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 543#(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))), 549#true, Black: 291#(= |ULTIMATE.start_main_#t~mem18| 5), 42#L1156-1true, Black: 428#(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: 302#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 560#(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: 562#(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: 566#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 309#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 318#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 448#(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: 440#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 579#(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: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 446#(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|))), 453#true, Black: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 334#(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: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 336#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 330#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 332#(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: 467#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 473#(and (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 (and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~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: 475#(and (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 (and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~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: 463#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 213#(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: 218#(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: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 355#(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: 353#(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: 357#(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: 351#(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: 484#(= |ULTIMATE.start_main_#t~mem18| 5), 363#true, Black: 230#(= |ULTIMATE.start_main_#t~mem18| 5), 244#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 241#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 242#|ULTIMATE.start_main_#t~short21|, Black: 239#true, Black: 497#(= |ULTIMATE.start_main_#t~mem18| 5), 125#L1164-2true, Black: 506#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5))]) [2021-06-11 04:44:32,962 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-06-11 04:44:32,962 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:32,962 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:32,962 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:32,963 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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][95], [Black: 385#(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: 387#(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|)))), 519#(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: 373#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 379#(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: 381#(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: 263#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 254#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 383#(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: 513#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|))), Black: 521#(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: 523#(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))), 275#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 525#(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|)), Black: 277#(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: 402#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 407#(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: 409#(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: 413#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 539#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 543#(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))), 549#true, Black: 291#(= |ULTIMATE.start_main_#t~mem18| 5), 42#L1156-1true, 428#(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|)), 302#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 560#(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: 562#(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: 566#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 309#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 318#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 448#(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: 440#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 446#(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: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 581#(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|)), 453#true, 330#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 332#(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: 334#(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: 467#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 473#(and (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 (and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~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|))), 351#(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: 475#(and (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 (and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~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: 213#(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: 463#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 218#(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: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 353#(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: 355#(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: 357#(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: 484#(= |ULTIMATE.start_main_#t~mem18| 5), 363#true, Black: 230#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 241#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 242#|ULTIMATE.start_main_#t~short21|, Black: 244#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 497#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 506#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 125#L1164-2true]) [2021-06-11 04:44:32,963 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-06-11 04:44:32,963 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:32,963 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:32,963 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:32,989 INFO L129 PetriNetUnfolder]: 10795/16500 cut-off events. [2021-06-11 04:44:32,989 INFO L130 PetriNetUnfolder]: For 338406/341207 co-relation queries the response was YES. [2021-06-11 04:44:33,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 100339 conditions, 16500 events. 10795/16500 cut-off events. For 338406/341207 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 110300 event pairs, 725 based on Foata normal form. 1211/14189 useless extension candidates. Maximal degree in co-relation 97030. Up to 6753 conditions per place. [2021-06-11 04:44:33,150 INFO L132 encePairwiseOnDemand]: 344/352 looper letters, 156 selfloop transitions, 74 changer transitions 2/286 dead transitions. [2021-06-11 04:44:33,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 286 transitions, 5108 flow [2021-06-11 04:44:33,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 04:44:33,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 04:44:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1637 transitions. [2021-06-11 04:44:33,152 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6643668831168831 [2021-06-11 04:44:33,152 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1637 transitions. [2021-06-11 04:44:33,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1637 transitions. [2021-06-11 04:44:33,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:44:33,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1637 transitions. [2021-06-11 04:44:33,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 233.85714285714286) internal successors, (1637), 7 states have internal predecessors, (1637), 0 states have call successors, (0), 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-06-11 04:44:33,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:44:33,155 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:44:33,155 INFO L185 Difference]: Start difference. First operand has 168 places, 249 transitions, 4156 flow. Second operand 7 states and 1637 transitions. [2021-06-11 04:44:33,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 286 transitions, 5108 flow [2021-06-11 04:44:34,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 286 transitions, 5071 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-06-11 04:44:34,006 INFO L241 Difference]: Finished difference. Result has 172 places, 260 transitions, 4608 flow [2021-06-11 04:44:34,006 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=4119, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4608, PETRI_PLACES=172, PETRI_TRANSITIONS=260} [2021-06-11 04:44:34,007 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 113 predicate places. [2021-06-11 04:44:34,007 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:44:34,007 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 260 transitions, 4608 flow [2021-06-11 04:44:34,007 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 260 transitions, 4608 flow [2021-06-11 04:44:34,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 172 places, 260 transitions, 4608 flow [2021-06-11 04:44:34,824 INFO L129 PetriNetUnfolder]: 4482/8376 cut-off events. [2021-06-11 04:44:34,825 INFO L130 PetriNetUnfolder]: For 80969/82171 co-relation queries the response was YES. [2021-06-11 04:44:34,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31551 conditions, 8376 events. 4482/8376 cut-off events. For 80969/82171 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 68888 event pairs, 30 based on Foata normal form. 437/6363 useless extension candidates. Maximal degree in co-relation 30442. Up to 2028 conditions per place. [2021-06-11 04:44:34,974 INFO L151 LiptonReduction]: Number of co-enabled transitions 4146 [2021-06-11 04:44:34,986 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:44:34,986 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:44:34,986 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 979 [2021-06-11 04:44:34,987 INFO L480 AbstractCegarLoop]: Abstraction has has 172 places, 260 transitions, 4608 flow [2021-06-11 04:44:34,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 227.85714285714286) internal successors, (1595), 7 states have internal predecessors, (1595), 0 states have call successors, (0), 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-06-11 04:44:34,987 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:44:34,987 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-06-11 04:44:34,987 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-11 04:44:34,987 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-06-11 04:44:34,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:44:34,988 INFO L82 PathProgramCache]: Analyzing trace with hash 743219992, now seen corresponding path program 1 times [2021-06-11 04:44:34,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:44:34,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222461594] [2021-06-11 04:44:34,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:44:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:44:35,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:35,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:44:35,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:35,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 04:44:35,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:35,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:44:35,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:35,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:44:35,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:35,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:44:35,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:35,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:44:35,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:35,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:44:35,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:35,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:44:35,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:44:35,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222461594] [2021-06-11 04:44:35,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:44:35,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-11 04:44:35,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757334157] [2021-06-11 04:44:35,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 04:44:35,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:44:35,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 04:44:35,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-11 04:44:35,070 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 352 [2021-06-11 04:44:35,071 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 260 transitions, 4608 flow. Second operand has 9 states, 9 states have (on average 213.44444444444446) internal successors, (1921), 9 states have internal predecessors, (1921), 0 states have call successors, (0), 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-06-11 04:44:35,071 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:44:35,071 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 352 [2021-06-11 04:44:35,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:44:37,401 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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][71], [Black: 385#(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: 387#(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: 373#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 379#(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: 381#(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: 263#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 254#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 383#(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|)))), 523#(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))), Black: 513#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|))), Black: 519#(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: 521#(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: 525#(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|)), 279#(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: 277#(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: 402#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 407#(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: 409#(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: 413#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 539#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 543#(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))), Black: 291#(= |ULTIMATE.start_main_#t~mem18| 5), 42#L1156-1true, Black: 428#(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: 302#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 560#(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: 562#(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: 566#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 309#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 318#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 448#(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|))), 579#(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: 440#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 446#(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|))), 453#true, Black: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 581#(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: 575#(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)), 334#(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: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 330#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 332#(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))), 599#(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|) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 467#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 473#(and (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 (and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~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: 475#(and (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 (and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~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: 463#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 213#(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: 218#(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: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 355#(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: 353#(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: 357#(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: 351#(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|)), 363#true, Black: 484#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 230#(= |ULTIMATE.start_main_#t~mem18| 5), 244#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 241#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 242#|ULTIMATE.start_main_#t~short21|, Black: 239#true, Black: 497#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 506#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 125#L1164-2true]) [2021-06-11 04:44:37,401 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-06-11 04:44:37,401 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:37,401 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:37,401 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:37,403 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) 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_17|, #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_32|, ~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][95], [Black: 385#(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: 387#(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|)))), 519#(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: 373#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 379#(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: 381#(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: 263#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 254#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 383#(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: 513#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|))), Black: 521#(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: 523#(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))), 275#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 525#(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|)), Black: 277#(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: 402#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 407#(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: 409#(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: 413#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 539#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 543#(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: 291#(= |ULTIMATE.start_main_#t~mem18| 5), 428#(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|)), 302#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 560#(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: 562#(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: 566#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 309#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 318#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 448#(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: 440#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 189#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 446#(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|))), 453#true, 581#(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: 191#(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) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 575#(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)), 330#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 201#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 206#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 595#(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|) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 332#(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: 334#(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: 467#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 473#(and (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 (and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~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|))), 351#(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: 475#(and (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 (and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~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: 463#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 213#(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: 218#(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: 222#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 353#(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: 355#(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: 357#(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|)), 363#true, Black: 484#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 230#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 241#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 242#|ULTIMATE.start_main_#t~short21|, Black: 244#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 497#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 506#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 125#L1164-2true]) [2021-06-11 04:44:37,403 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-06-11 04:44:37,403 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:37,403 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:37,403 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-06-11 04:44:37,427 INFO L129 PetriNetUnfolder]: 10946/16771 cut-off events. [2021-06-11 04:44:37,427 INFO L130 PetriNetUnfolder]: For 382221/384730 co-relation queries the response was YES. [2021-06-11 04:44:37,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105077 conditions, 16771 events. 10946/16771 cut-off events. For 382221/384730 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 112432 event pairs, 551 based on Foata normal form. 734/13761 useless extension candidates. Maximal degree in co-relation 101464. Up to 4971 conditions per place. [2021-06-11 04:44:37,614 INFO L132 encePairwiseOnDemand]: 343/352 looper letters, 136 selfloop transitions, 121 changer transitions 4/315 dead transitions. [2021-06-11 04:44:37,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 315 transitions, 5864 flow [2021-06-11 04:44:37,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 04:44:37,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 04:44:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1984 transitions. [2021-06-11 04:44:37,616 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6262626262626263 [2021-06-11 04:44:37,616 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1984 transitions. [2021-06-11 04:44:37,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1984 transitions. [2021-06-11 04:44:37,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:44:37,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1984 transitions. [2021-06-11 04:44:37,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 220.44444444444446) internal successors, (1984), 9 states have internal predecessors, (1984), 0 states have call successors, (0), 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-06-11 04:44:37,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:44:37,619 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:44:37,619 INFO L185 Difference]: Start difference. First operand has 172 places, 260 transitions, 4608 flow. Second operand 9 states and 1984 transitions. [2021-06-11 04:44:37,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 315 transitions, 5864 flow [2021-06-11 04:44:39,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 315 transitions, 5805 flow, removed 27 selfloop flow, removed 2 redundant places. [2021-06-11 04:44:39,069 INFO L241 Difference]: Finished difference. Result has 181 places, 272 transitions, 5298 flow [2021-06-11 04:44:39,069 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=4557, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5298, PETRI_PLACES=181, PETRI_TRANSITIONS=272} [2021-06-11 04:44:39,070 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 122 predicate places. [2021-06-11 04:44:39,070 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:44:39,070 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 272 transitions, 5298 flow [2021-06-11 04:44:39,070 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 272 transitions, 5298 flow [2021-06-11 04:44:39,073 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 181 places, 272 transitions, 5298 flow [2021-06-11 04:44:39,785 INFO L129 PetriNetUnfolder]: 4545/8489 cut-off events. [2021-06-11 04:44:39,786 INFO L130 PetriNetUnfolder]: For 97338/98665 co-relation queries the response was YES. [2021-06-11 04:44:39,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33393 conditions, 8489 events. 4545/8489 cut-off events. For 97338/98665 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 69982 event pairs, 19 based on Foata normal form. 469/6416 useless extension candidates. Maximal degree in co-relation 32213. Up to 2082 conditions per place. [2021-06-11 04:44:39,951 INFO L151 LiptonReduction]: Number of co-enabled transitions 4342 [2021-06-11 04:44:39,964 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:44:39,964 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:44:39,964 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 894 [2021-06-11 04:44:39,965 INFO L480 AbstractCegarLoop]: Abstraction has has 181 places, 272 transitions, 5298 flow [2021-06-11 04:44:39,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 213.44444444444446) internal successors, (1921), 9 states have internal predecessors, (1921), 0 states have call successors, (0), 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-06-11 04:44:39,965 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:44:39,965 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-06-11 04:44:39,965 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-11 04:44:39,965 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-06-11 04:44:39,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:44:39,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1090063198, now seen corresponding path program 1 times [2021-06-11 04:44:39,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:44:39,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096279327] [2021-06-11 04:44:39,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:44:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:44:39,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:39,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 04:44:39,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:39,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:44:40,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:40,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:44:40,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:40,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 04:44:40,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:40,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:44:40,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:40,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:44:40,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:40,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:44:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:44:40,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096279327] [2021-06-11 04:44:40,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:44:40,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 04:44:40,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039374575] [2021-06-11 04:44:40,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 04:44:40,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:44:40,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 04:44:40,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-11 04:44:40,117 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 352 [2021-06-11 04:44:40,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 272 transitions, 5298 flow. Second operand has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 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-06-11 04:44:40,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:44:40,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 352 [2021-06-11 04:44:40,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:44:43,636 INFO L129 PetriNetUnfolder]: 17750/25069 cut-off events. [2021-06-11 04:44:43,636 INFO L130 PetriNetUnfolder]: For 593213/593557 co-relation queries the response was YES. [2021-06-11 04:44:43,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 161557 conditions, 25069 events. 17750/25069 cut-off events. For 593213/593557 co-relation queries the response was YES. Maximal size of possible extension queue 1232. Compared 151453 event pairs, 3607 based on Foata normal form. 183/19373 useless extension candidates. Maximal degree in co-relation 156989. Up to 15469 conditions per place. [2021-06-11 04:44:43,930 INFO L132 encePairwiseOnDemand]: 342/352 looper letters, 248 selfloop transitions, 30 changer transitions 24/339 dead transitions. [2021-06-11 04:44:43,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 339 transitions, 7222 flow [2021-06-11 04:44:43,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-11 04:44:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-11 04:44:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1992 transitions. [2021-06-11 04:44:43,932 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5659090909090909 [2021-06-11 04:44:43,932 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1992 transitions. [2021-06-11 04:44:43,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1992 transitions. [2021-06-11 04:44:43,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:44:43,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1992 transitions. [2021-06-11 04:44:43,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 199.2) internal successors, (1992), 10 states have internal predecessors, (1992), 0 states have call successors, (0), 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-06-11 04:44:43,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 352.0) internal successors, (3872), 11 states have internal predecessors, (3872), 0 states have call successors, (0), 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-06-11 04:44:43,936 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 352.0) internal successors, (3872), 11 states have internal predecessors, (3872), 0 states have call successors, (0), 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-06-11 04:44:43,936 INFO L185 Difference]: Start difference. First operand has 181 places, 272 transitions, 5298 flow. Second operand 10 states and 1992 transitions. [2021-06-11 04:44:43,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 339 transitions, 7222 flow [2021-06-11 04:44:46,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 339 transitions, 7103 flow, removed 15 selfloop flow, removed 5 redundant places. [2021-06-11 04:44:46,094 INFO L241 Difference]: Finished difference. Result has 187 places, 271 transitions, 5231 flow [2021-06-11 04:44:46,095 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=5138, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5231, PETRI_PLACES=187, PETRI_TRANSITIONS=271} [2021-06-11 04:44:46,095 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 128 predicate places. [2021-06-11 04:44:46,095 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:44:46,095 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 271 transitions, 5231 flow [2021-06-11 04:44:46,095 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 271 transitions, 5231 flow [2021-06-11 04:44:46,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 187 places, 271 transitions, 5231 flow [2021-06-11 04:44:46,933 INFO L129 PetriNetUnfolder]: 4493/8434 cut-off events. [2021-06-11 04:44:46,933 INFO L130 PetriNetUnfolder]: For 86856/87676 co-relation queries the response was YES. [2021-06-11 04:44:47,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32944 conditions, 8434 events. 4493/8434 cut-off events. For 86856/87676 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 69904 event pairs, 20 based on Foata normal form. 329/6257 useless extension candidates. Maximal degree in co-relation 31700. Up to 2076 conditions per place. [2021-06-11 04:44:47,096 INFO L151 LiptonReduction]: Number of co-enabled transitions 4248 [2021-06-11 04:44:47,108 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:44:47,108 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:44:47,108 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1013 [2021-06-11 04:44:47,109 INFO L480 AbstractCegarLoop]: Abstraction has has 187 places, 271 transitions, 5231 flow [2021-06-11 04:44:47,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 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-06-11 04:44:47,109 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:44:47,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, 1] [2021-06-11 04:44:47,109 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-11 04:44:47,110 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-06-11 04:44:47,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:44:47,110 INFO L82 PathProgramCache]: Analyzing trace with hash 100773112, now seen corresponding path program 1 times [2021-06-11 04:44:47,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:44:47,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115604651] [2021-06-11 04:44:47,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:44:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:44:47,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:47,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 04:44:47,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:47,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 04:44:47,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:47,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 04:44:47,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:47,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:44:47,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:47,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:44:47,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:47,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-06-11 04:44:47,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:47,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-06-11 04:44:47,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:47,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 04:44:47,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:47,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:44:47,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:47,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:44:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:44:47,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115604651] [2021-06-11 04:44:47,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:44:47,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-11 04:44:47,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865676943] [2021-06-11 04:44:47,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 04:44:47,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:44:47,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 04:44:47,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-11 04:44:47,276 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 352 [2021-06-11 04:44:47,277 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 271 transitions, 5231 flow. Second operand has 10 states, 10 states have (on average 189.6) internal successors, (1896), 10 states have internal predecessors, (1896), 0 states have call successors, (0), 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-06-11 04:44:47,277 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:44:47,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 352 [2021-06-11 04:44:47,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:44:51,030 INFO L129 PetriNetUnfolder]: 17342/24802 cut-off events. [2021-06-11 04:44:51,030 INFO L130 PetriNetUnfolder]: For 590610/591394 co-relation queries the response was YES. [2021-06-11 04:44:51,228 INFO L84 FinitePrefix]: Finished finitePrefix Result has 155302 conditions, 24802 events. 17342/24802 cut-off events. For 590610/591394 co-relation queries the response was YES. Maximal size of possible extension queue 1258. Compared 154653 event pairs, 3311 based on Foata normal form. 432/19226 useless extension candidates. Maximal degree in co-relation 151488. Up to 14709 conditions per place. [2021-06-11 04:44:51,293 INFO L132 encePairwiseOnDemand]: 340/352 looper letters, 260 selfloop transitions, 47 changer transitions 5/349 dead transitions. [2021-06-11 04:44:51,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 349 transitions, 7393 flow [2021-06-11 04:44:51,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-11 04:44:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-11 04:44:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1968 transitions. [2021-06-11 04:44:51,295 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5590909090909091 [2021-06-11 04:44:51,295 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1968 transitions. [2021-06-11 04:44:51,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1968 transitions. [2021-06-11 04:44:51,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:44:51,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1968 transitions. [2021-06-11 04:44:51,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 196.8) internal successors, (1968), 10 states have internal predecessors, (1968), 0 states have call successors, (0), 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-06-11 04:44:51,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 352.0) internal successors, (3872), 11 states have internal predecessors, (3872), 0 states have call successors, (0), 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-06-11 04:44:51,300 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 352.0) internal successors, (3872), 11 states have internal predecessors, (3872), 0 states have call successors, (0), 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-06-11 04:44:51,300 INFO L185 Difference]: Start difference. First operand has 187 places, 271 transitions, 5231 flow. Second operand 10 states and 1968 transitions. [2021-06-11 04:44:51,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 349 transitions, 7393 flow [2021-06-11 04:44:52,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 349 transitions, 7158 flow, removed 28 selfloop flow, removed 9 redundant places. [2021-06-11 04:44:52,965 INFO L241 Difference]: Finished difference. Result has 190 places, 275 transitions, 5281 flow [2021-06-11 04:44:52,965 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=4910, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5281, PETRI_PLACES=190, PETRI_TRANSITIONS=275} [2021-06-11 04:44:52,965 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 131 predicate places. [2021-06-11 04:44:52,965 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:44:52,965 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 275 transitions, 5281 flow [2021-06-11 04:44:52,966 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 275 transitions, 5281 flow [2021-06-11 04:44:52,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 190 places, 275 transitions, 5281 flow [2021-06-11 04:44:53,775 INFO L129 PetriNetUnfolder]: 4759/8961 cut-off events. [2021-06-11 04:44:53,775 INFO L130 PetriNetUnfolder]: For 82058/82680 co-relation queries the response was YES. [2021-06-11 04:44:53,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32702 conditions, 8961 events. 4759/8961 cut-off events. For 82058/82680 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 75392 event pairs, 29 based on Foata normal form. 213/6405 useless extension candidates. Maximal degree in co-relation 31593. Up to 2290 conditions per place. [2021-06-11 04:44:53,960 INFO L151 LiptonReduction]: Number of co-enabled transitions 4332 [2021-06-11 04:44:53,975 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:44:53,975 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:44:53,976 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1011 [2021-06-11 04:44:53,976 INFO L480 AbstractCegarLoop]: Abstraction has has 190 places, 275 transitions, 5281 flow [2021-06-11 04:44:53,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 189.6) internal successors, (1896), 10 states have internal predecessors, (1896), 0 states have call successors, (0), 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-06-11 04:44:53,976 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:44:53,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] [2021-06-11 04:44:53,977 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-11 04:44:53,977 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-06-11 04:44:53,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:44:53,977 INFO L82 PathProgramCache]: Analyzing trace with hash -705806630, now seen corresponding path program 2 times [2021-06-11 04:44:53,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:44:53,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368829048] [2021-06-11 04:44:53,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:44:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:44:54,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:54,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 04:44:54,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:54,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-06-11 04:44:54,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:54,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 04:44:54,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:54,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:44:54,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:54,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:44:54,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:54,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 04:44:54,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:54,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 04:44:54,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:54,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:44:54,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:44:54,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:44:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:44:54,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368829048] [2021-06-11 04:44:54,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:44:54,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-11 04:44:54,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761937056] [2021-06-11 04:44:54,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 04:44:54,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:44:54,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 04:44:54,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-11 04:44:54,088 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 352 [2021-06-11 04:44:54,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 275 transitions, 5281 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-06-11 04:44:54,089 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:44:54,089 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 352 [2021-06-11 04:44:54,089 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:44:54,319 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2021-06-11 04:44:57,870 INFO L129 PetriNetUnfolder]: 18105/25886 cut-off events. [2021-06-11 04:44:57,871 INFO L130 PetriNetUnfolder]: For 601052/601981 co-relation queries the response was YES. [2021-06-11 04:44:58,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 158778 conditions, 25886 events. 18105/25886 cut-off events. For 601052/601981 co-relation queries the response was YES. Maximal size of possible extension queue 1325. Compared 162676 event pairs, 3549 based on Foata normal form. 180/19715 useless extension candidates. Maximal degree in co-relation 155069. Up to 18416 conditions per place. [2021-06-11 04:44:58,200 INFO L132 encePairwiseOnDemand]: 344/352 looper letters, 273 selfloop transitions, 19 changer transitions 12/341 dead transitions. [2021-06-11 04:44:58,201 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 341 transitions, 7165 flow [2021-06-11 04:44:58,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 04:44:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 04:44:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1392 transitions. [2021-06-11 04:44:58,202 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2021-06-11 04:44:58,202 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1392 transitions. [2021-06-11 04:44:58,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1392 transitions. [2021-06-11 04:44:58,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:44:58,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1392 transitions. [2021-06-11 04:44:58,204 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-06-11 04:44:58,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:44:58,205 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:44:58,205 INFO L185 Difference]: Start difference. First operand has 190 places, 275 transitions, 5281 flow. Second operand 7 states and 1392 transitions. [2021-06-11 04:44:58,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 341 transitions, 7165 flow [2021-06-11 04:44:59,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 341 transitions, 7035 flow, removed 36 selfloop flow, removed 7 redundant places. [2021-06-11 04:44:59,976 INFO L241 Difference]: Finished difference. Result has 192 places, 279 transitions, 5350 flow [2021-06-11 04:44:59,977 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=5131, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5350, PETRI_PLACES=192, PETRI_TRANSITIONS=279} [2021-06-11 04:44:59,977 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 133 predicate places. [2021-06-11 04:44:59,977 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:44:59,977 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 279 transitions, 5350 flow [2021-06-11 04:44:59,977 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 279 transitions, 5350 flow [2021-06-11 04:44:59,979 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 192 places, 279 transitions, 5350 flow [2021-06-11 04:45:00,966 INFO L129 PetriNetUnfolder]: 4968/9326 cut-off events. [2021-06-11 04:45:00,966 INFO L130 PetriNetUnfolder]: For 84757/85445 co-relation queries the response was YES. [2021-06-11 04:45:01,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33643 conditions, 9326 events. 4968/9326 cut-off events. For 84757/85445 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 78771 event pairs, 25 based on Foata normal form. 246/6663 useless extension candidates. Maximal degree in co-relation 32519. Up to 2390 conditions per place. [2021-06-11 04:45:01,164 INFO L151 LiptonReduction]: Number of co-enabled transitions 4446 [2021-06-11 04:45:01,177 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:45:01,177 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:45:01,177 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1200 [2021-06-11 04:45:01,178 INFO L480 AbstractCegarLoop]: Abstraction has has 192 places, 279 transitions, 5350 flow [2021-06-11 04:45:01,178 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-06-11 04:45:01,178 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:45:01,178 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-06-11 04:45:01,178 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-11 04:45:01,178 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-06-11 04:45:01,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:45:01,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1542214323, now seen corresponding path program 1 times [2021-06-11 04:45:01,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:45:01,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430510468] [2021-06-11 04:45:01,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:45:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:45:01,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:01,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 04:45:01,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:01,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-06-11 04:45:01,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:01,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:45:01,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:01,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:45:01,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:01,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:45:01,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:01,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:45:01,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:01,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:45:01,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:01,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:45:01,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:01,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:45:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:45:01,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430510468] [2021-06-11 04:45:01,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:45:01,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-11 04:45:01,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686846709] [2021-06-11 04:45:01,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 04:45:01,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:45:01,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 04:45:01,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-11 04:45:01,270 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 352 [2021-06-11 04:45:01,271 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 279 transitions, 5350 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-06-11 04:45:01,271 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:45:01,271 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 352 [2021-06-11 04:45:01,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:45:05,339 INFO L129 PetriNetUnfolder]: 18485/26139 cut-off events. [2021-06-11 04:45:05,339 INFO L130 PetriNetUnfolder]: For 606009/606544 co-relation queries the response was YES. [2021-06-11 04:45:05,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 164581 conditions, 26139 events. 18485/26139 cut-off events. For 606009/606544 co-relation queries the response was YES. Maximal size of possible extension queue 1318. Compared 160928 event pairs, 3708 based on Foata normal form. 135/20113 useless extension candidates. Maximal degree in co-relation 160333. Up to 15681 conditions per place. [2021-06-11 04:45:05,686 INFO L132 encePairwiseOnDemand]: 344/352 looper letters, 273 selfloop transitions, 35 changer transitions 3/344 dead transitions. [2021-06-11 04:45:05,686 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 344 transitions, 7147 flow [2021-06-11 04:45:05,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-11 04:45:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-11 04:45:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1582 transitions. [2021-06-11 04:45:05,688 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5617897727272727 [2021-06-11 04:45:05,688 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1582 transitions. [2021-06-11 04:45:05,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1582 transitions. [2021-06-11 04:45:05,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:45:05,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1582 transitions. [2021-06-11 04:45:05,689 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-06-11 04:45:05,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 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-06-11 04:45:05,691 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 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-06-11 04:45:05,691 INFO L185 Difference]: Start difference. First operand has 192 places, 279 transitions, 5350 flow. Second operand 8 states and 1582 transitions. [2021-06-11 04:45:05,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 344 transitions, 7147 flow [2021-06-11 04:45:07,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 344 transitions, 7054 flow, removed 32 selfloop flow, removed 4 redundant places. [2021-06-11 04:45:07,450 INFO L241 Difference]: Finished difference. Result has 197 places, 283 transitions, 5425 flow [2021-06-11 04:45:07,450 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=5259, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5425, PETRI_PLACES=197, PETRI_TRANSITIONS=283} [2021-06-11 04:45:07,450 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 138 predicate places. [2021-06-11 04:45:07,450 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:45:07,450 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 283 transitions, 5425 flow [2021-06-11 04:45:07,450 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 283 transitions, 5425 flow [2021-06-11 04:45:07,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 197 places, 283 transitions, 5425 flow [2021-06-11 04:45:08,255 INFO L129 PetriNetUnfolder]: 4951/9303 cut-off events. [2021-06-11 04:45:08,256 INFO L130 PetriNetUnfolder]: For 83000/83647 co-relation queries the response was YES. [2021-06-11 04:45:08,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33343 conditions, 9303 events. 4951/9303 cut-off events. For 83000/83647 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 78582 event pairs, 28 based on Foata normal form. 250/6651 useless extension candidates. Maximal degree in co-relation 32214. Up to 2392 conditions per place. [2021-06-11 04:45:08,479 INFO L151 LiptonReduction]: Number of co-enabled transitions 4432 [2021-06-11 04:45:08,493 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:45:08,493 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:45:08,493 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1043 [2021-06-11 04:45:08,493 INFO L480 AbstractCegarLoop]: Abstraction has has 197 places, 283 transitions, 5425 flow [2021-06-11 04:45:08,494 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-06-11 04:45:08,494 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:45:08,494 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-06-11 04:45:08,494 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-11 04:45:08,494 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-06-11 04:45:08,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:45:08,494 INFO L82 PathProgramCache]: Analyzing trace with hash -181097063, now seen corresponding path program 2 times [2021-06-11 04:45:08,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:45:08,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534600962] [2021-06-11 04:45:08,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:45:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:45:08,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:08,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 04:45:08,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:08,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:45:08,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:08,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 04:45:08,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:08,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:45:08,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:08,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:45:08,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:08,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:45:08,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:08,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 04:45:08,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:08,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:45:08,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:08,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:45:08,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:08,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:45:08,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-06-11 04:45:08,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534600962] [2021-06-11 04:45:08,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:45:08,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-11 04:45:08,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291212726] [2021-06-11 04:45:08,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 04:45:08,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:45:08,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 04:45:08,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-11 04:45:08,618 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 352 [2021-06-11 04:45:08,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 283 transitions, 5425 flow. Second operand has 10 states, 10 states have (on average 189.6) internal successors, (1896), 10 states have internal predecessors, (1896), 0 states have call successors, (0), 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-06-11 04:45:08,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:45:08,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 352 [2021-06-11 04:45:08,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:45:08,893 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2021-06-11 04:45:12,782 INFO L129 PetriNetUnfolder]: 19149/27124 cut-off events. [2021-06-11 04:45:12,783 INFO L130 PetriNetUnfolder]: For 615573/616474 co-relation queries the response was YES. [2021-06-11 04:45:13,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 169198 conditions, 27124 events. 19149/27124 cut-off events. For 615573/616474 co-relation queries the response was YES. Maximal size of possible extension queue 1376. Compared 168361 event pairs, 3770 based on Foata normal form. 153/20774 useless extension candidates. Maximal degree in co-relation 164948. Up to 18985 conditions per place. [2021-06-11 04:45:13,422 INFO L132 encePairwiseOnDemand]: 343/352 looper letters, 263 selfloop transitions, 44 changer transitions 3/343 dead transitions. [2021-06-11 04:45:13,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 343 transitions, 7172 flow [2021-06-11 04:45:13,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 04:45:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 04:45:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1390 transitions. [2021-06-11 04:45:13,425 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5641233766233766 [2021-06-11 04:45:13,425 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1390 transitions. [2021-06-11 04:45:13,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1390 transitions. [2021-06-11 04:45:13,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:45:13,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1390 transitions. [2021-06-11 04:45:13,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 198.57142857142858) internal successors, (1390), 7 states have internal predecessors, (1390), 0 states have call successors, (0), 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-06-11 04:45:13,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:45:13,444 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:45:13,444 INFO L185 Difference]: Start difference. First operand has 197 places, 283 transitions, 5425 flow. Second operand 7 states and 1390 transitions. [2021-06-11 04:45:13,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 343 transitions, 7172 flow [2021-06-11 04:45:15,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 343 transitions, 7131 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-06-11 04:45:15,186 INFO L241 Difference]: Finished difference. Result has 202 places, 290 transitions, 5694 flow [2021-06-11 04:45:15,186 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=5388, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5694, PETRI_PLACES=202, PETRI_TRANSITIONS=290} [2021-06-11 04:45:15,187 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 143 predicate places. [2021-06-11 04:45:15,187 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:45:15,187 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 290 transitions, 5694 flow [2021-06-11 04:45:15,187 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 290 transitions, 5694 flow [2021-06-11 04:45:15,190 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 202 places, 290 transitions, 5694 flow [2021-06-11 04:45:16,184 INFO L129 PetriNetUnfolder]: 5156/9680 cut-off events. [2021-06-11 04:45:16,184 INFO L130 PetriNetUnfolder]: For 87086/87724 co-relation queries the response was YES. [2021-06-11 04:45:16,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34614 conditions, 9680 events. 5156/9680 cut-off events. For 87086/87724 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 82130 event pairs, 23 based on Foata normal form. 241/6897 useless extension candidates. Maximal degree in co-relation 33455. Up to 2500 conditions per place. [2021-06-11 04:45:16,380 INFO L151 LiptonReduction]: Number of co-enabled transitions 4574 [2021-06-11 04:45:16,396 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:45:16,397 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:45:16,397 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1210 [2021-06-11 04:45:16,397 INFO L480 AbstractCegarLoop]: Abstraction has has 202 places, 290 transitions, 5694 flow [2021-06-11 04:45:16,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 189.6) internal successors, (1896), 10 states have internal predecessors, (1896), 0 states have call successors, (0), 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-06-11 04:45:16,398 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:45:16,398 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-06-11 04:45:16,398 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-11 04:45:16,398 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-06-11 04:45:16,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:45:16,398 INFO L82 PathProgramCache]: Analyzing trace with hash 546698135, now seen corresponding path program 1 times [2021-06-11 04:45:16,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:45:16,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816971047] [2021-06-11 04:45:16,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:45:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:45:16,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:16,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 04:45:16,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:16,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:45:16,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:16,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 04:45:16,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:16,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:45:16,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:16,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:45:16,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:16,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:45:16,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:16,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:45:16,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:16,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:45:16,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:16,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:45:16,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:16,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:45:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:45:16,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816971047] [2021-06-11 04:45:16,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:45:16,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-11 04:45:16,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380914852] [2021-06-11 04:45:16,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 04:45:16,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:45:16,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 04:45:16,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-11 04:45:16,521 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 352 [2021-06-11 04:45:16,522 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 290 transitions, 5694 flow. Second operand has 10 states, 10 states have (on average 189.6) internal successors, (1896), 10 states have internal predecessors, (1896), 0 states have call successors, (0), 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-06-11 04:45:16,522 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:45:16,522 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 352 [2021-06-11 04:45:16,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:45:20,816 INFO L129 PetriNetUnfolder]: 19395/27334 cut-off events. [2021-06-11 04:45:20,816 INFO L130 PetriNetUnfolder]: For 635313/635721 co-relation queries the response was YES. [2021-06-11 04:45:21,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 170819 conditions, 27334 events. 19395/27334 cut-off events. For 635313/635721 co-relation queries the response was YES. Maximal size of possible extension queue 1362. Compared 167565 event pairs, 3756 based on Foata normal form. 125/20967 useless extension candidates. Maximal degree in co-relation 166911. Up to 10935 conditions per place. [2021-06-11 04:45:21,249 INFO L132 encePairwiseOnDemand]: 343/352 looper letters, 287 selfloop transitions, 76 changer transitions 6/402 dead transitions. [2021-06-11 04:45:21,249 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 402 transitions, 8463 flow [2021-06-11 04:45:21,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 04:45:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 04:45:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2167 transitions. [2021-06-11 04:45:21,252 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5596590909090909 [2021-06-11 04:45:21,252 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2167 transitions. [2021-06-11 04:45:21,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2167 transitions. [2021-06-11 04:45:21,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:45:21,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2167 transitions. [2021-06-11 04:45:21,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 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-06-11 04:45:21,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 352.0) internal successors, (4224), 12 states have internal predecessors, (4224), 0 states have call successors, (0), 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-06-11 04:45:21,257 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 352.0) internal successors, (4224), 12 states have internal predecessors, (4224), 0 states have call successors, (0), 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-06-11 04:45:21,257 INFO L185 Difference]: Start difference. First operand has 202 places, 290 transitions, 5694 flow. Second operand 11 states and 2167 transitions. [2021-06-11 04:45:21,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 402 transitions, 8463 flow [2021-06-11 04:45:23,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 402 transitions, 8329 flow, removed 27 selfloop flow, removed 5 redundant places. [2021-06-11 04:45:23,431 INFO L241 Difference]: Finished difference. Result has 210 places, 294 transitions, 5853 flow [2021-06-11 04:45:23,431 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=5511, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5853, PETRI_PLACES=210, PETRI_TRANSITIONS=294} [2021-06-11 04:45:23,432 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 151 predicate places. [2021-06-11 04:45:23,432 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:45:23,432 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 294 transitions, 5853 flow [2021-06-11 04:45:23,432 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 294 transitions, 5853 flow [2021-06-11 04:45:23,435 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 210 places, 294 transitions, 5853 flow [2021-06-11 04:45:24,458 INFO L129 PetriNetUnfolder]: 5121/9583 cut-off events. [2021-06-11 04:45:24,458 INFO L130 PetriNetUnfolder]: For 86249/86887 co-relation queries the response was YES. [2021-06-11 04:45:24,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34248 conditions, 9583 events. 5121/9583 cut-off events. For 86249/86887 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 80942 event pairs, 19 based on Foata normal form. 252/6839 useless extension candidates. Maximal degree in co-relation 33051. Up to 2508 conditions per place. [2021-06-11 04:45:24,634 INFO L151 LiptonReduction]: Number of co-enabled transitions 4542 [2021-06-11 04:45:24,648 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:45:24,649 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:45:24,649 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1217 [2021-06-11 04:45:24,649 INFO L480 AbstractCegarLoop]: Abstraction has has 210 places, 294 transitions, 5853 flow [2021-06-11 04:45:24,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 189.6) internal successors, (1896), 10 states have internal predecessors, (1896), 0 states have call successors, (0), 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-06-11 04:45:24,650 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:45:24,650 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-06-11 04:45:24,650 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-11 04:45:24,650 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-06-11 04:45:24,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:45:24,650 INFO L82 PathProgramCache]: Analyzing trace with hash 587898586, now seen corresponding path program 3 times [2021-06-11 04:45:24,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:45:24,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243601295] [2021-06-11 04:45:24,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:45:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:45:24,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:24,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 04:45:24,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:24,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-06-11 04:45:24,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:24,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 04:45:24,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:24,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 04:45:24,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:24,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:45:24,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:24,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 04:45:24,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:24,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 04:45:24,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:24,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:45:24,830 INFO L142 QuantifierPusher]: treesize reduction 14, result has 36.4 percent of original size [2021-06-11 04:45:24,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 04:45:24,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:24,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:45:24,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:24,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:45:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:45:24,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243601295] [2021-06-11 04:45:24,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:45:24,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-11 04:45:24,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038172522] [2021-06-11 04:45:24,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-11 04:45:24,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:45:24,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-11 04:45:24,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-06-11 04:45:24,855 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 352 [2021-06-11 04:45:24,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 294 transitions, 5853 flow. Second operand has 11 states, 11 states have (on average 188.45454545454547) internal successors, (2073), 11 states have internal predecessors, (2073), 0 states have call successors, (0), 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-06-11 04:45:24,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:45:24,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 352 [2021-06-11 04:45:24,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:45:29,098 INFO L129 PetriNetUnfolder]: 17343/25001 cut-off events. [2021-06-11 04:45:29,098 INFO L130 PetriNetUnfolder]: For 571402/572340 co-relation queries the response was YES. [2021-06-11 04:45:29,311 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149920 conditions, 25001 events. 17343/25001 cut-off events. For 571402/572340 co-relation queries the response was YES. Maximal size of possible extension queue 1289. Compared 158700 event pairs, 3051 based on Foata normal form. 278/19171 useless extension candidates. Maximal degree in co-relation 148173. Up to 16702 conditions per place. [2021-06-11 04:45:29,369 INFO L132 encePairwiseOnDemand]: 340/352 looper letters, 214 selfloop transitions, 57 changer transitions 9/321 dead transitions. [2021-06-11 04:45:29,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 321 transitions, 6815 flow [2021-06-11 04:45:29,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-11 04:45:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-11 04:45:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1954 transitions. [2021-06-11 04:45:29,371 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5551136363636363 [2021-06-11 04:45:29,371 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1954 transitions. [2021-06-11 04:45:29,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1954 transitions. [2021-06-11 04:45:29,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:45:29,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1954 transitions. [2021-06-11 04:45:29,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 195.4) internal successors, (1954), 10 states have internal predecessors, (1954), 0 states have call successors, (0), 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-06-11 04:45:29,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 352.0) internal successors, (3872), 11 states have internal predecessors, (3872), 0 states have call successors, (0), 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-06-11 04:45:29,375 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 352.0) internal successors, (3872), 11 states have internal predecessors, (3872), 0 states have call successors, (0), 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-06-11 04:45:29,375 INFO L185 Difference]: Start difference. First operand has 210 places, 294 transitions, 5853 flow. Second operand 10 states and 1954 transitions. [2021-06-11 04:45:29,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 321 transitions, 6815 flow [2021-06-11 04:45:30,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 321 transitions, 6481 flow, removed 108 selfloop flow, removed 8 redundant places. [2021-06-11 04:45:30,621 INFO L241 Difference]: Finished difference. Result has 211 places, 250 transitions, 4736 flow [2021-06-11 04:45:30,621 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=4592, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4736, PETRI_PLACES=211, PETRI_TRANSITIONS=250} [2021-06-11 04:45:30,621 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 152 predicate places. [2021-06-11 04:45:30,621 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:45:30,622 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 250 transitions, 4736 flow [2021-06-11 04:45:30,622 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 250 transitions, 4736 flow [2021-06-11 04:45:30,623 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 211 places, 250 transitions, 4736 flow [2021-06-11 04:45:31,549 INFO L129 PetriNetUnfolder]: 4822/9045 cut-off events. [2021-06-11 04:45:31,549 INFO L130 PetriNetUnfolder]: For 78015/78794 co-relation queries the response was YES. [2021-06-11 04:45:31,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31287 conditions, 9045 events. 4822/9045 cut-off events. For 78015/78794 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 75661 event pairs, 19 based on Foata normal form. 238/6431 useless extension candidates. Maximal degree in co-relation 30099. Up to 2400 conditions per place. [2021-06-11 04:45:31,733 INFO L151 LiptonReduction]: Number of co-enabled transitions 3940 [2021-06-11 04:45:31,744 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:45:31,744 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:45:31,744 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1123 [2021-06-11 04:45:31,744 INFO L480 AbstractCegarLoop]: Abstraction has has 211 places, 250 transitions, 4736 flow [2021-06-11 04:45:31,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 188.45454545454547) internal successors, (2073), 11 states have internal predecessors, (2073), 0 states have call successors, (0), 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-06-11 04:45:31,745 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:45:31,745 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-06-11 04:45:31,745 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-11 04:45:31,745 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-06-11 04:45:31,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:45:31,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1931518019, now seen corresponding path program 1 times [2021-06-11 04:45:31,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:45:31,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478737234] [2021-06-11 04:45:31,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:45:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:45:31,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:31,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 04:45:31,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:31,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:45:31,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:31,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:45:31,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:31,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:45:31,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:31,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 04:45:31,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:31,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:45:31,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:31,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:45:31,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:31,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:45:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:45:31,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478737234] [2021-06-11 04:45:31,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:45:31,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-11 04:45:31,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58733458] [2021-06-11 04:45:31,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 04:45:31,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:45:31,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 04:45:31,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-11 04:45:31,848 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 352 [2021-06-11 04:45:31,849 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 250 transitions, 4736 flow. Second operand has 9 states, 9 states have (on average 192.77777777777777) internal successors, (1735), 9 states have internal predecessors, (1735), 0 states have call successors, (0), 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-06-11 04:45:31,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:45:31,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 352 [2021-06-11 04:45:31,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:45:35,702 INFO L129 PetriNetUnfolder]: 16414/23649 cut-off events. [2021-06-11 04:45:35,702 INFO L130 PetriNetUnfolder]: For 517990/518064 co-relation queries the response was YES. [2021-06-11 04:45:35,880 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143923 conditions, 23649 events. 16414/23649 cut-off events. For 517990/518064 co-relation queries the response was YES. Maximal size of possible extension queue 1243. Compared 149436 event pairs, 3350 based on Foata normal form. 178/18219 useless extension candidates. Maximal degree in co-relation 140181. Up to 14001 conditions per place. [2021-06-11 04:45:35,935 INFO L132 encePairwiseOnDemand]: 340/352 looper letters, 209 selfloop transitions, 46 changer transitions 31/327 dead transitions. [2021-06-11 04:45:35,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 327 transitions, 6912 flow [2021-06-11 04:45:35,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-11 04:45:35,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-06-11 04:45:35,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2371 transitions. [2021-06-11 04:45:35,940 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5613162878787878 [2021-06-11 04:45:35,940 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2371 transitions. [2021-06-11 04:45:35,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2371 transitions. [2021-06-11 04:45:35,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:45:35,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2371 transitions. [2021-06-11 04:45:35,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 197.58333333333334) internal successors, (2371), 12 states have internal predecessors, (2371), 0 states have call successors, (0), 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-06-11 04:45:35,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 352.0) internal successors, (4576), 13 states have internal predecessors, (4576), 0 states have call successors, (0), 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-06-11 04:45:35,945 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 352.0) internal successors, (4576), 13 states have internal predecessors, (4576), 0 states have call successors, (0), 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-06-11 04:45:35,946 INFO L185 Difference]: Start difference. First operand has 211 places, 250 transitions, 4736 flow. Second operand 12 states and 2371 transitions. [2021-06-11 04:45:35,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 327 transitions, 6912 flow [2021-06-11 04:45:36,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 327 transitions, 6764 flow, removed 2 selfloop flow, removed 10 redundant places. [2021-06-11 04:45:36,937 INFO L241 Difference]: Finished difference. Result has 214 places, 252 transitions, 4806 flow [2021-06-11 04:45:36,938 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=4575, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4806, PETRI_PLACES=214, PETRI_TRANSITIONS=252} [2021-06-11 04:45:36,938 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 155 predicate places. [2021-06-11 04:45:36,938 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:45:36,938 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 252 transitions, 4806 flow [2021-06-11 04:45:36,938 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 252 transitions, 4806 flow [2021-06-11 04:45:36,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 214 places, 252 transitions, 4806 flow [2021-06-11 04:45:37,853 INFO L129 PetriNetUnfolder]: 4731/8894 cut-off events. [2021-06-11 04:45:37,853 INFO L130 PetriNetUnfolder]: For 73856/74635 co-relation queries the response was YES. [2021-06-11 04:45:37,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29960 conditions, 8894 events. 4731/8894 cut-off events. For 73856/74635 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 74481 event pairs, 18 based on Foata normal form. 219/6283 useless extension candidates. Maximal degree in co-relation 28800. Up to 2392 conditions per place. [2021-06-11 04:45:38,019 INFO L151 LiptonReduction]: Number of co-enabled transitions 3832 [2021-06-11 04:45:38,030 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:45:38,030 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:45:38,030 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1092 [2021-06-11 04:45:38,031 INFO L480 AbstractCegarLoop]: Abstraction has has 214 places, 252 transitions, 4806 flow [2021-06-11 04:45:38,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 192.77777777777777) internal successors, (1735), 9 states have internal predecessors, (1735), 0 states have call successors, (0), 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-06-11 04:45:38,031 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:45:38,031 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-06-11 04:45:38,031 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-11 04:45:38,031 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-06-11 04:45:38,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:45:38,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1567927933, now seen corresponding path program 1 times [2021-06-11 04:45:38,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:45:38,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304672555] [2021-06-11 04:45:38,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:45:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:45:38,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:38,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 04:45:38,068 INFO L142 QuantifierPusher]: treesize reduction 4, result has 92.6 percent of original size [2021-06-11 04:45:38,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 04:45:38,089 INFO L142 QuantifierPusher]: treesize reduction 4, result has 92.5 percent of original size [2021-06-11 04:45:38,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-06-11 04:45:38,111 INFO L142 QuantifierPusher]: treesize reduction 4, result has 91.8 percent of original size [2021-06-11 04:45:38,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-06-11 04:45:38,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:38,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 04:45:38,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:38,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:45:38,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:38,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 04:45:38,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:38,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 04:45:38,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:38,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-06-11 04:45:38,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:38,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 04:45:38,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:38,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:45:38,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:38,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:45:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:45:38,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304672555] [2021-06-11 04:45:38,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:45:38,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-11 04:45:38,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122524430] [2021-06-11 04:45:38,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-11 04:45:38,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:45:38,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-11 04:45:38,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-11 04:45:38,271 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 352 [2021-06-11 04:45:38,272 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 252 transitions, 4806 flow. Second operand has 12 states, 12 states have (on average 186.33333333333334) internal successors, (2236), 12 states have internal predecessors, (2236), 0 states have call successors, (0), 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-06-11 04:45:38,272 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:45:38,272 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 352 [2021-06-11 04:45:38,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:45:42,427 INFO L129 PetriNetUnfolder]: 17292/24844 cut-off events. [2021-06-11 04:45:42,427 INFO L130 PetriNetUnfolder]: For 536958/537559 co-relation queries the response was YES. [2021-06-11 04:45:42,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149866 conditions, 24844 events. 17292/24844 cut-off events. For 536958/537559 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 156772 event pairs, 2811 based on Foata normal form. 228/19195 useless extension candidates. Maximal degree in co-relation 146771. Up to 12551 conditions per place. [2021-06-11 04:45:42,753 INFO L132 encePairwiseOnDemand]: 339/352 looper letters, 228 selfloop transitions, 76 changer transitions 10/348 dead transitions. [2021-06-11 04:45:42,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 348 transitions, 7031 flow [2021-06-11 04:45:42,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 04:45:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 04:45:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2130 transitions. [2021-06-11 04:45:42,756 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.550103305785124 [2021-06-11 04:45:42,756 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2130 transitions. [2021-06-11 04:45:42,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2130 transitions. [2021-06-11 04:45:42,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:45:42,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2130 transitions. [2021-06-11 04:45:42,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 193.63636363636363) internal successors, (2130), 11 states have internal predecessors, (2130), 0 states have call successors, (0), 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-06-11 04:45:42,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 352.0) internal successors, (4224), 12 states have internal predecessors, (4224), 0 states have call successors, (0), 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-06-11 04:45:42,761 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 352.0) internal successors, (4224), 12 states have internal predecessors, (4224), 0 states have call successors, (0), 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-06-11 04:45:42,761 INFO L185 Difference]: Start difference. First operand has 214 places, 252 transitions, 4806 flow. Second operand 11 states and 2130 transitions. [2021-06-11 04:45:42,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 348 transitions, 7031 flow [2021-06-11 04:45:43,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 348 transitions, 6867 flow, removed 3 selfloop flow, removed 11 redundant places. [2021-06-11 04:45:43,730 INFO L241 Difference]: Finished difference. Result has 216 places, 267 transitions, 5199 flow [2021-06-11 04:45:43,730 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=4614, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5199, PETRI_PLACES=216, PETRI_TRANSITIONS=267} [2021-06-11 04:45:43,731 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 157 predicate places. [2021-06-11 04:45:43,731 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:45:43,731 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 267 transitions, 5199 flow [2021-06-11 04:45:43,731 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 267 transitions, 5199 flow [2021-06-11 04:45:43,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 216 places, 267 transitions, 5199 flow [2021-06-11 04:45:44,659 INFO L129 PetriNetUnfolder]: 4875/9211 cut-off events. [2021-06-11 04:45:44,660 INFO L130 PetriNetUnfolder]: For 80258/81183 co-relation queries the response was YES. [2021-06-11 04:45:44,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30768 conditions, 9211 events. 4875/9211 cut-off events. For 80258/81183 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 77894 event pairs, 13 based on Foata normal form. 233/6525 useless extension candidates. Maximal degree in co-relation 29940. Up to 2472 conditions per place. [2021-06-11 04:45:44,841 INFO L151 LiptonReduction]: Number of co-enabled transitions 3942 [2021-06-11 04:45:44,852 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:45:44,852 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:45:44,852 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1121 [2021-06-11 04:45:44,853 INFO L480 AbstractCegarLoop]: Abstraction has has 216 places, 267 transitions, 5199 flow [2021-06-11 04:45:44,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 186.33333333333334) internal successors, (2236), 12 states have internal predecessors, (2236), 0 states have call successors, (0), 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-06-11 04:45:44,853 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:45:44,853 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-06-11 04:45:44,853 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-11 04:45:44,853 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-06-11 04:45:44,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:45:44,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2043354667, now seen corresponding path program 2 times [2021-06-11 04:45:44,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:45:44,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691121803] [2021-06-11 04:45:44,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:45:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:45:44,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:44,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:45:44,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:44,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 04:45:44,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:44,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:45:44,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:44,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:45:44,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:44,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:45:44,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:44,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:45:44,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:44,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:45:44,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:44,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:45:44,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:44,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:45:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:45:44,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691121803] [2021-06-11 04:45:44,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:45:44,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-11 04:45:44,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409978900] [2021-06-11 04:45:44,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 04:45:44,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:45:44,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 04:45:44,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-06-11 04:45:44,946 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 352 [2021-06-11 04:45:44,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 267 transitions, 5199 flow. Second operand has 10 states, 10 states have (on average 191.6) internal successors, (1916), 10 states have internal predecessors, (1916), 0 states have call successors, (0), 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-06-11 04:45:44,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:45:44,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 352 [2021-06-11 04:45:44,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:45:48,800 INFO L129 PetriNetUnfolder]: 17435/25286 cut-off events. [2021-06-11 04:45:48,801 INFO L130 PetriNetUnfolder]: For 572824/572852 co-relation queries the response was YES. [2021-06-11 04:45:49,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 153497 conditions, 25286 events. 17435/25286 cut-off events. For 572824/572852 co-relation queries the response was YES. Maximal size of possible extension queue 1338. Compared 163333 event pairs, 3573 based on Foata normal form. 86/19264 useless extension candidates. Maximal degree in co-relation 150448. Up to 10929 conditions per place. [2021-06-11 04:45:49,052 INFO L132 encePairwiseOnDemand]: 341/352 looper letters, 242 selfloop transitions, 71 changer transitions 30/384 dead transitions. [2021-06-11 04:45:49,052 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 384 transitions, 8009 flow [2021-06-11 04:45:49,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 04:45:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 04:45:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1811 transitions. [2021-06-11 04:45:49,055 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5716540404040404 [2021-06-11 04:45:49,055 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1811 transitions. [2021-06-11 04:45:49,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1811 transitions. [2021-06-11 04:45:49,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:45:49,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1811 transitions. [2021-06-11 04:45:49,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 201.22222222222223) internal successors, (1811), 9 states have internal predecessors, (1811), 0 states have call successors, (0), 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-06-11 04:45:49,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:45:49,058 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:45:49,058 INFO L185 Difference]: Start difference. First operand has 216 places, 267 transitions, 5199 flow. Second operand 9 states and 1811 transitions. [2021-06-11 04:45:49,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 384 transitions, 8009 flow [2021-06-11 04:45:50,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 384 transitions, 7881 flow, removed 24 selfloop flow, removed 9 redundant places. [2021-06-11 04:45:50,069 INFO L241 Difference]: Finished difference. Result has 218 places, 282 transitions, 5578 flow [2021-06-11 04:45:50,069 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=5071, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5578, PETRI_PLACES=218, PETRI_TRANSITIONS=282} [2021-06-11 04:45:50,069 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 159 predicate places. [2021-06-11 04:45:50,069 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:45:50,069 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 218 places, 282 transitions, 5578 flow [2021-06-11 04:45:50,069 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 282 transitions, 5578 flow [2021-06-11 04:45:50,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 218 places, 282 transitions, 5578 flow [2021-06-11 04:45:51,043 INFO L129 PetriNetUnfolder]: 5065/9527 cut-off events. [2021-06-11 04:45:51,043 INFO L130 PetriNetUnfolder]: For 78889/79878 co-relation queries the response was YES. [2021-06-11 04:45:51,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31417 conditions, 9527 events. 5065/9527 cut-off events. For 78889/79878 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 80413 event pairs, 13 based on Foata normal form. 238/6697 useless extension candidates. Maximal degree in co-relation 30593. Up to 2592 conditions per place. [2021-06-11 04:45:51,225 INFO L151 LiptonReduction]: Number of co-enabled transitions 3944 [2021-06-11 04:45:51,238 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:45:51,238 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:45:51,238 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1169 [2021-06-11 04:45:51,239 INFO L480 AbstractCegarLoop]: Abstraction has has 218 places, 282 transitions, 5578 flow [2021-06-11 04:45:51,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 191.6) internal successors, (1916), 10 states have internal predecessors, (1916), 0 states have call successors, (0), 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-06-11 04:45:51,239 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:45:51,239 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-06-11 04:45:51,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-11 04:45:51,239 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-06-11 04:45:51,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:45:51,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1921231569, now seen corresponding path program 3 times [2021-06-11 04:45:51,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:45:51,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325011377] [2021-06-11 04:45:51,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:45:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:45:51,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:51,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:45:51,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:51,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 04:45:51,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:51,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:45:51,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:51,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:45:51,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:51,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:45:51,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:51,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:45:51,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:51,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 04:45:51,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:51,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:45:51,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:51,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:45:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:45:51,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325011377] [2021-06-11 04:45:51,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:45:51,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-11 04:45:51,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666292864] [2021-06-11 04:45:51,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 04:45:51,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:45:51,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 04:45:51,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-06-11 04:45:51,341 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 352 [2021-06-11 04:45:51,342 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 282 transitions, 5578 flow. Second operand has 10 states, 10 states have (on average 191.6) internal successors, (1916), 10 states have internal predecessors, (1916), 0 states have call successors, (0), 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-06-11 04:45:51,342 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:45:51,342 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 352 [2021-06-11 04:45:51,342 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:45:55,061 INFO L129 PetriNetUnfolder]: 16689/24279 cut-off events. [2021-06-11 04:45:55,061 INFO L130 PetriNetUnfolder]: For 530339/530501 co-relation queries the response was YES. [2021-06-11 04:45:55,276 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145411 conditions, 24279 events. 16689/24279 cut-off events. For 530339/530501 co-relation queries the response was YES. Maximal size of possible extension queue 1302. Compared 157109 event pairs, 3659 based on Foata normal form. 102/18441 useless extension candidates. Maximal degree in co-relation 142504. Up to 18332 conditions per place. [2021-06-11 04:45:55,326 INFO L132 encePairwiseOnDemand]: 341/352 looper letters, 224 selfloop transitions, 43 changer transitions 10/318 dead transitions. [2021-06-11 04:45:55,326 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 318 transitions, 6742 flow [2021-06-11 04:45:55,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 04:45:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 04:45:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1400 transitions. [2021-06-11 04:45:55,328 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2021-06-11 04:45:55,328 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1400 transitions. [2021-06-11 04:45:55,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1400 transitions. [2021-06-11 04:45:55,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:45:55,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1400 transitions. [2021-06-11 04:45:55,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 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-06-11 04:45:55,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:45:55,331 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:45:55,331 INFO L185 Difference]: Start difference. First operand has 218 places, 282 transitions, 5578 flow. Second operand 7 states and 1400 transitions. [2021-06-11 04:45:55,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 318 transitions, 6742 flow [2021-06-11 04:45:56,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 318 transitions, 6708 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 04:45:56,253 INFO L241 Difference]: Finished difference. Result has 224 places, 284 transitions, 5725 flow [2021-06-11 04:45:56,253 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=5496, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5725, PETRI_PLACES=224, PETRI_TRANSITIONS=284} [2021-06-11 04:45:56,253 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 165 predicate places. [2021-06-11 04:45:56,253 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:45:56,253 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 284 transitions, 5725 flow [2021-06-11 04:45:56,253 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 284 transitions, 5725 flow [2021-06-11 04:45:56,255 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 224 places, 284 transitions, 5725 flow [2021-06-11 04:45:57,232 INFO L129 PetriNetUnfolder]: 4990/9391 cut-off events. [2021-06-11 04:45:57,232 INFO L130 PetriNetUnfolder]: For 79811/80880 co-relation queries the response was YES. [2021-06-11 04:45:57,316 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30933 conditions, 9391 events. 4990/9391 cut-off events. For 79811/80880 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 79136 event pairs, 11 based on Foata normal form. 262/6619 useless extension candidates. Maximal degree in co-relation 30115. Up to 2568 conditions per place. [2021-06-11 04:45:57,420 INFO L151 LiptonReduction]: Number of co-enabled transitions 3884 [2021-06-11 04:45:57,437 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:45:57,437 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:45:57,438 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1184 [2021-06-11 04:45:57,438 INFO L480 AbstractCegarLoop]: Abstraction has has 224 places, 284 transitions, 5725 flow [2021-06-11 04:45:57,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 191.6) internal successors, (1916), 10 states have internal predecessors, (1916), 0 states have call successors, (0), 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-06-11 04:45:57,438 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:45:57,438 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-06-11 04:45:57,438 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-11 04:45:57,438 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-06-11 04:45:57,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:45:57,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1182099249, now seen corresponding path program 4 times [2021-06-11 04:45:57,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:45:57,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923389265] [2021-06-11 04:45:57,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:45:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:45:57,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:57,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 04:45:57,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:57,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-06-11 04:45:57,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:57,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 04:45:57,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:57,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-06-11 04:45:57,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:57,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:45:57,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:57,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:45:57,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:57,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:45:57,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:57,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 04:45:57,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:57,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 04:45:57,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:57,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 04:45:57,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:57,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:45:57,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:45:57,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:45:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:45:57,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923389265] [2021-06-11 04:45:57,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:45:57,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-11 04:45:57,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773451063] [2021-06-11 04:45:57,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-11 04:45:57,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:45:57,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-11 04:45:57,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-06-11 04:45:57,653 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 352 [2021-06-11 04:45:57,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 284 transitions, 5725 flow. Second operand has 12 states, 12 states have (on average 188.33333333333334) internal successors, (2260), 12 states have internal predecessors, (2260), 0 states have call successors, (0), 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-06-11 04:45:57,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:45:57,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 352 [2021-06-11 04:45:57,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:46:01,726 INFO L129 PetriNetUnfolder]: 17598/25775 cut-off events. [2021-06-11 04:46:01,727 INFO L130 PetriNetUnfolder]: For 537471/537633 co-relation queries the response was YES. [2021-06-11 04:46:01,938 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149916 conditions, 25775 events. 17598/25775 cut-off events. For 537471/537633 co-relation queries the response was YES. Maximal size of possible extension queue 1382. Compared 169764 event pairs, 3385 based on Foata normal form. 152/19461 useless extension candidates. Maximal degree in co-relation 147070. Up to 17122 conditions per place. [2021-06-11 04:46:01,985 INFO L132 encePairwiseOnDemand]: 343/352 looper letters, 247 selfloop transitions, 53 changer transitions 21/362 dead transitions. [2021-06-11 04:46:01,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 362 transitions, 7981 flow [2021-06-11 04:46:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 04:46:01,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 04:46:01,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1381 transitions. [2021-06-11 04:46:01,986 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5604707792207793 [2021-06-11 04:46:01,987 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1381 transitions. [2021-06-11 04:46:01,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1381 transitions. [2021-06-11 04:46:01,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:46:01,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1381 transitions. [2021-06-11 04:46:01,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 197.28571428571428) internal successors, (1381), 7 states have internal predecessors, (1381), 0 states have call successors, (0), 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-06-11 04:46:01,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:46:01,990 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:46:01,990 INFO L185 Difference]: Start difference. First operand has 224 places, 284 transitions, 5725 flow. Second operand 7 states and 1381 transitions. [2021-06-11 04:46:01,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 362 transitions, 7981 flow [2021-06-11 04:46:03,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 362 transitions, 7945 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 04:46:03,035 INFO L241 Difference]: Finished difference. Result has 231 places, 293 transitions, 6076 flow [2021-06-11 04:46:03,035 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=5654, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6076, PETRI_PLACES=231, PETRI_TRANSITIONS=293} [2021-06-11 04:46:03,035 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 172 predicate places. [2021-06-11 04:46:03,035 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:46:03,036 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 293 transitions, 6076 flow [2021-06-11 04:46:03,036 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 231 places, 293 transitions, 6076 flow [2021-06-11 04:46:03,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 231 places, 293 transitions, 6076 flow [2021-06-11 04:46:04,104 INFO L129 PetriNetUnfolder]: 5355/10048 cut-off events. [2021-06-11 04:46:04,105 INFO L130 PetriNetUnfolder]: For 83768/84727 co-relation queries the response was YES. [2021-06-11 04:46:04,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32998 conditions, 10048 events. 5355/10048 cut-off events. For 83768/84727 co-relation queries the response was YES. Maximal size of possible extension queue 876. Compared 85391 event pairs, 20 based on Foata normal form. 280/7037 useless extension candidates. Maximal degree in co-relation 32191. Up to 2784 conditions per place. [2021-06-11 04:46:04,316 INFO L151 LiptonReduction]: Number of co-enabled transitions 4070 [2021-06-11 04:46:04,331 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:46:04,331 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:46:04,331 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1296 [2021-06-11 04:46:04,332 INFO L480 AbstractCegarLoop]: Abstraction has has 231 places, 293 transitions, 6076 flow [2021-06-11 04:46:04,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 188.33333333333334) internal successors, (2260), 12 states have internal predecessors, (2260), 0 states have call successors, (0), 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-06-11 04:46:04,332 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:46:04,332 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-06-11 04:46:04,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-11 04:46:04,332 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-06-11 04:46:04,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:46:04,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1600452918, now seen corresponding path program 1 times [2021-06-11 04:46:04,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:46:04,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051648798] [2021-06-11 04:46:04,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:46:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:46:04,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:04,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 04:46:04,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:04,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-06-11 04:46:04,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:04,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-06-11 04:46:04,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:04,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-06-11 04:46:04,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:04,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 04:46:04,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:04,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-06-11 04:46:04,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:04,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 04:46:04,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:04,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 04:46:04,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:04,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 04:46:04,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:04,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:46:04,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:04,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:46:04,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:04,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:46:04,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:04,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:46:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:46:04,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051648798] [2021-06-11 04:46:04,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:46:04,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-11 04:46:04,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041476203] [2021-06-11 04:46:04,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-11 04:46:04,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:46:04,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-11 04:46:04,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-11 04:46:04,714 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 352 [2021-06-11 04:46:04,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 293 transitions, 6076 flow. Second operand has 12 states, 12 states have (on average 186.41666666666666) internal successors, (2237), 12 states have internal predecessors, (2237), 0 states have call successors, (0), 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-06-11 04:46:04,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:46:04,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 352 [2021-06-11 04:46:04,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:46:09,038 INFO L129 PetriNetUnfolder]: 17903/25883 cut-off events. [2021-06-11 04:46:09,039 INFO L130 PetriNetUnfolder]: For 576793/577253 co-relation queries the response was YES. [2021-06-11 04:46:09,267 INFO L84 FinitePrefix]: Finished finitePrefix Result has 153766 conditions, 25883 events. 17903/25883 cut-off events. For 576793/577253 co-relation queries the response was YES. Maximal size of possible extension queue 1314. Compared 165299 event pairs, 3294 based on Foata normal form. 161/19634 useless extension candidates. Maximal degree in co-relation 151914. Up to 13449 conditions per place. [2021-06-11 04:46:09,309 INFO L132 encePairwiseOnDemand]: 342/352 looper letters, 208 selfloop transitions, 92 changer transitions 12/361 dead transitions. [2021-06-11 04:46:09,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 361 transitions, 7920 flow [2021-06-11 04:46:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 04:46:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 04:46:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1743 transitions. [2021-06-11 04:46:09,311 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5501893939393939 [2021-06-11 04:46:09,311 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1743 transitions. [2021-06-11 04:46:09,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1743 transitions. [2021-06-11 04:46:09,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:46:09,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1743 transitions. [2021-06-11 04:46:09,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 193.66666666666666) internal successors, (1743), 9 states have internal predecessors, (1743), 0 states have call successors, (0), 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-06-11 04:46:09,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:46:09,315 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:46:09,315 INFO L185 Difference]: Start difference. First operand has 231 places, 293 transitions, 6076 flow. Second operand 9 states and 1743 transitions. [2021-06-11 04:46:09,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 361 transitions, 7920 flow [2021-06-11 04:46:10,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 361 transitions, 7714 flow, removed 6 selfloop flow, removed 14 redundant places. [2021-06-11 04:46:10,623 INFO L241 Difference]: Finished difference. Result has 225 places, 279 transitions, 5722 flow [2021-06-11 04:46:10,624 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=5542, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5722, PETRI_PLACES=225, PETRI_TRANSITIONS=279} [2021-06-11 04:46:10,624 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 166 predicate places. [2021-06-11 04:46:10,624 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:46:10,624 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 279 transitions, 5722 flow [2021-06-11 04:46:10,624 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 279 transitions, 5722 flow [2021-06-11 04:46:10,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 225 places, 279 transitions, 5722 flow [2021-06-11 04:46:11,375 INFO L129 PetriNetUnfolder]: 5078/9574 cut-off events. [2021-06-11 04:46:11,376 INFO L130 PetriNetUnfolder]: For 78994/80041 co-relation queries the response was YES. [2021-06-11 04:46:11,457 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30081 conditions, 9574 events. 5078/9574 cut-off events. For 78994/80041 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 81173 event pairs, 22 based on Foata normal form. 289/6710 useless extension candidates. Maximal degree in co-relation 27756. Up to 2674 conditions per place. [2021-06-11 04:46:11,560 INFO L151 LiptonReduction]: Number of co-enabled transitions 3492 [2021-06-11 04:46:11,572 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:46:11,572 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:46:11,573 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 949 [2021-06-11 04:46:11,573 INFO L480 AbstractCegarLoop]: Abstraction has has 225 places, 279 transitions, 5722 flow [2021-06-11 04:46:11,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 186.41666666666666) internal successors, (2237), 12 states have internal predecessors, (2237), 0 states have call successors, (0), 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-06-11 04:46:11,573 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:46:11,573 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-06-11 04:46:11,573 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-11 04:46:11,574 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-06-11 04:46:11,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:46:11,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1380970292, now seen corresponding path program 1 times [2021-06-11 04:46:11,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:46:11,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578845312] [2021-06-11 04:46:11,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:46:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:46:11,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:11,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 04:46:11,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:11,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 04:46:11,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:11,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-11 04:46:11,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:11,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-06-11 04:46:11,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:11,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 04:46:11,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:11,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:46:11,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:11,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:46:11,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:11,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-06-11 04:46:11,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:11,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:46:11,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:11,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:46:11,767 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-06-11 04:46:11,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 04:46:11,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:11,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:46:11,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:11,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:46:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:46:11,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578845312] [2021-06-11 04:46:11,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:46:11,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-11 04:46:11,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389459123] [2021-06-11 04:46:11,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-11 04:46:11,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:46:11,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-11 04:46:11,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-11 04:46:11,788 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 352 [2021-06-11 04:46:11,790 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 279 transitions, 5722 flow. Second operand has 13 states, 13 states have (on average 187.30769230769232) internal successors, (2435), 13 states have internal predecessors, (2435), 0 states have call successors, (0), 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-06-11 04:46:11,790 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:46:11,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 352 [2021-06-11 04:46:11,790 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:46:15,930 INFO L129 PetriNetUnfolder]: 18367/27106 cut-off events. [2021-06-11 04:46:15,930 INFO L130 PetriNetUnfolder]: For 614435/614587 co-relation queries the response was YES. [2021-06-11 04:46:16,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 155887 conditions, 27106 events. 18367/27106 cut-off events. For 614435/614587 co-relation queries the response was YES. Maximal size of possible extension queue 1407. Compared 181232 event pairs, 2810 based on Foata normal form. 132/20409 useless extension candidates. Maximal degree in co-relation 146561. Up to 16669 conditions per place. [2021-06-11 04:46:16,227 INFO L132 encePairwiseOnDemand]: 339/352 looper letters, 218 selfloop transitions, 88 changer transitions 15/362 dead transitions. [2021-06-11 04:46:16,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 362 transitions, 7776 flow [2021-06-11 04:46:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 04:46:16,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 04:46:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2147 transitions. [2021-06-11 04:46:16,230 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5544938016528925 [2021-06-11 04:46:16,230 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2147 transitions. [2021-06-11 04:46:16,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2147 transitions. [2021-06-11 04:46:16,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:46:16,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2147 transitions. [2021-06-11 04:46:16,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 195.1818181818182) internal successors, (2147), 11 states have internal predecessors, (2147), 0 states have call successors, (0), 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-06-11 04:46:16,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 352.0) internal successors, (4224), 12 states have internal predecessors, (4224), 0 states have call successors, (0), 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-06-11 04:46:16,234 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 352.0) internal successors, (4224), 12 states have internal predecessors, (4224), 0 states have call successors, (0), 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-06-11 04:46:16,234 INFO L185 Difference]: Start difference. First operand has 225 places, 279 transitions, 5722 flow. Second operand 11 states and 2147 transitions. [2021-06-11 04:46:16,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 362 transitions, 7776 flow [2021-06-11 04:46:17,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 362 transitions, 7716 flow, removed 6 selfloop flow, removed 5 redundant places. [2021-06-11 04:46:17,411 INFO L241 Difference]: Finished difference. Result has 233 places, 299 transitions, 6541 flow [2021-06-11 04:46:17,412 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=5592, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6541, PETRI_PLACES=233, PETRI_TRANSITIONS=299} [2021-06-11 04:46:17,412 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 174 predicate places. [2021-06-11 04:46:17,412 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:46:17,412 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 233 places, 299 transitions, 6541 flow [2021-06-11 04:46:17,412 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 299 transitions, 6541 flow [2021-06-11 04:46:17,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 233 places, 299 transitions, 6541 flow [2021-06-11 04:46:18,559 INFO L129 PetriNetUnfolder]: 5454/10331 cut-off events. [2021-06-11 04:46:18,559 INFO L130 PetriNetUnfolder]: For 103065/103553 co-relation queries the response was YES. [2021-06-11 04:46:18,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34934 conditions, 10331 events. 5454/10331 cut-off events. For 103065/103553 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 88979 event pairs, 6 based on Foata normal form. 135/7100 useless extension candidates. Maximal degree in co-relation 32722. Up to 2852 conditions per place. [2021-06-11 04:46:18,703 INFO L151 LiptonReduction]: Number of co-enabled transitions 3666 [2021-06-11 04:46:18,716 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:46:18,716 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:46:18,716 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1304 [2021-06-11 04:46:18,717 INFO L480 AbstractCegarLoop]: Abstraction has has 233 places, 299 transitions, 6541 flow [2021-06-11 04:46:18,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 187.30769230769232) internal successors, (2435), 13 states have internal predecessors, (2435), 0 states have call successors, (0), 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-06-11 04:46:18,717 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:46:18,717 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-06-11 04:46:18,717 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-11 04:46:18,717 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-06-11 04:46:18,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:46:18,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1154472010, now seen corresponding path program 1 times [2021-06-11 04:46:18,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:46:18,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118740028] [2021-06-11 04:46:18,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:46:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:46:18,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:18,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:46:18,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:18,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:46:18,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:18,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:46:18,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:18,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:46:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:46:18,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118740028] [2021-06-11 04:46:18,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:46:18,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 04:46:18,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749588814] [2021-06-11 04:46:18,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 04:46:18,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:46:18,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 04:46:18,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-11 04:46:18,747 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 352 [2021-06-11 04:46:18,748 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 299 transitions, 6541 flow. Second operand has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 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-06-11 04:46:18,748 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:46:18,748 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 352 [2021-06-11 04:46:18,748 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:46:22,463 INFO L129 PetriNetUnfolder]: 16496/24717 cut-off events. [2021-06-11 04:46:22,463 INFO L130 PetriNetUnfolder]: For 658579/658579 co-relation queries the response was YES. [2021-06-11 04:46:22,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 155577 conditions, 24717 events. 16496/24717 cut-off events. For 658579/658579 co-relation queries the response was YES. Maximal size of possible extension queue 1377. Compared 168776 event pairs, 3522 based on Foata normal form. 54/18670 useless extension candidates. Maximal degree in co-relation 147848. Up to 17975 conditions per place. [2021-06-11 04:46:22,759 INFO L132 encePairwiseOnDemand]: 346/352 looper letters, 238 selfloop transitions, 2 changer transitions 94/383 dead transitions. [2021-06-11 04:46:22,759 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 383 transitions, 9232 flow [2021-06-11 04:46:22,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 04:46:22,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 04:46:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1479 transitions. [2021-06-11 04:46:22,760 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7002840909090909 [2021-06-11 04:46:22,760 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1479 transitions. [2021-06-11 04:46:22,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1479 transitions. [2021-06-11 04:46:22,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:46:22,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1479 transitions. [2021-06-11 04:46:22,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 0 states have call successors, (0), 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-06-11 04:46:22,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 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-06-11 04:46:22,763 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 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-06-11 04:46:22,763 INFO L185 Difference]: Start difference. First operand has 233 places, 299 transitions, 6541 flow. Second operand 6 states and 1479 transitions. [2021-06-11 04:46:22,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 383 transitions, 9232 flow [2021-06-11 04:46:24,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 383 transitions, 8925 flow, removed 82 selfloop flow, removed 8 redundant places. [2021-06-11 04:46:24,020 INFO L241 Difference]: Finished difference. Result has 232 places, 289 transitions, 6143 flow [2021-06-11 04:46:24,020 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=6276, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6143, PETRI_PLACES=232, PETRI_TRANSITIONS=289} [2021-06-11 04:46:24,020 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 173 predicate places. [2021-06-11 04:46:24,020 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:46:24,020 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 232 places, 289 transitions, 6143 flow [2021-06-11 04:46:24,020 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 232 places, 289 transitions, 6143 flow [2021-06-11 04:46:24,022 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 223 places, 289 transitions, 6143 flow [2021-06-11 04:46:25,033 INFO L129 PetriNetUnfolder]: 5159/9758 cut-off events. [2021-06-11 04:46:25,033 INFO L130 PetriNetUnfolder]: For 82743/82947 co-relation queries the response was YES. [2021-06-11 04:46:25,092 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32128 conditions, 9758 events. 5159/9758 cut-off events. For 82743/82947 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 82976 event pairs, 4 based on Foata normal form. 55/6626 useless extension candidates. Maximal degree in co-relation 32044. Up to 2716 conditions per place. [2021-06-11 04:46:25,192 INFO L151 LiptonReduction]: Number of co-enabled transitions 3574 [2021-06-11 04:46:25,206 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:46:25,206 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:46:25,206 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1186 [2021-06-11 04:46:25,206 INFO L480 AbstractCegarLoop]: Abstraction has has 223 places, 289 transitions, 6143 flow [2021-06-11 04:46:25,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 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-06-11 04:46:25,206 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:46:25,206 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-06-11 04:46:25,207 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-11 04:46:25,207 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-06-11 04:46:25,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:46:25,207 INFO L82 PathProgramCache]: Analyzing trace with hash 107972172, now seen corresponding path program 2 times [2021-06-11 04:46:25,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:46:25,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513419502] [2021-06-11 04:46:25,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:46:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:46:25,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:25,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:46:25,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:25,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 04:46:25,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:25,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:46:25,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:25,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:46:25,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:25,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:46:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:46:25,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513419502] [2021-06-11 04:46:25,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:46:25,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 04:46:25,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992296864] [2021-06-11 04:46:25,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 04:46:25,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:46:25,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 04:46:25,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-11 04:46:25,253 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 352 [2021-06-11 04:46:25,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 289 transitions, 6143 flow. Second operand has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 0 states have call successors, (0), 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-06-11 04:46:25,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:46:25,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 352 [2021-06-11 04:46:25,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:46:28,612 INFO L129 PetriNetUnfolder]: 15287/22935 cut-off events. [2021-06-11 04:46:28,612 INFO L130 PetriNetUnfolder]: For 573968/573968 co-relation queries the response was YES. [2021-06-11 04:46:28,828 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144487 conditions, 22935 events. 15287/22935 cut-off events. For 573968/573968 co-relation queries the response was YES. Maximal size of possible extension queue 1305. Compared 155624 event pairs, 3307 based on Foata normal form. 108/17365 useless extension candidates. Maximal degree in co-relation 144399. Up to 16223 conditions per place. [2021-06-11 04:46:28,881 INFO L132 encePairwiseOnDemand]: 345/352 looper letters, 227 selfloop transitions, 4 changer transitions 97/367 dead transitions. [2021-06-11 04:46:28,881 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 367 transitions, 8578 flow [2021-06-11 04:46:28,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 04:46:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 04:46:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1410 transitions. [2021-06-11 04:46:28,882 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5722402597402597 [2021-06-11 04:46:28,882 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1410 transitions. [2021-06-11 04:46:28,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1410 transitions. [2021-06-11 04:46:28,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:46:28,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1410 transitions. [2021-06-11 04:46:28,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 201.42857142857142) internal successors, (1410), 7 states have internal predecessors, (1410), 0 states have call successors, (0), 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-06-11 04:46:28,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:46:28,884 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:46:28,884 INFO L185 Difference]: Start difference. First operand has 223 places, 289 transitions, 6143 flow. Second operand 7 states and 1410 transitions. [2021-06-11 04:46:28,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 367 transitions, 8578 flow [2021-06-11 04:46:30,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 367 transitions, 8482 flow, removed 31 selfloop flow, removed 12 redundant places. [2021-06-11 04:46:30,130 INFO L241 Difference]: Finished difference. Result has 219 places, 270 transitions, 5686 flow [2021-06-11 04:46:30,130 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=5943, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5686, PETRI_PLACES=219, PETRI_TRANSITIONS=270} [2021-06-11 04:46:30,130 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 160 predicate places. [2021-06-11 04:46:30,130 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:46:30,131 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 270 transitions, 5686 flow [2021-06-11 04:46:30,131 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 270 transitions, 5686 flow [2021-06-11 04:46:30,133 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 207 places, 270 transitions, 5686 flow [2021-06-11 04:46:30,929 INFO L129 PetriNetUnfolder]: 4576/8632 cut-off events. [2021-06-11 04:46:30,929 INFO L130 PetriNetUnfolder]: For 69885/70014 co-relation queries the response was YES. [2021-06-11 04:46:30,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27700 conditions, 8632 events. 4576/8632 cut-off events. For 69885/70014 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 72025 event pairs, 4 based on Foata normal form. 46/5839 useless extension candidates. Maximal degree in co-relation 27608. Up to 2424 conditions per place. [2021-06-11 04:46:31,084 INFO L151 LiptonReduction]: Number of co-enabled transitions 3382 [2021-06-11 04:46:31,096 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:46:31,096 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:46:31,096 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 966 [2021-06-11 04:46:31,097 INFO L480 AbstractCegarLoop]: Abstraction has has 207 places, 270 transitions, 5686 flow [2021-06-11 04:46:31,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 0 states have call successors, (0), 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-06-11 04:46:31,097 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:46:31,097 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-06-11 04:46:31,097 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-11 04:46:31,097 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-06-11 04:46:31,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:46:31,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1828222224, now seen corresponding path program 1 times [2021-06-11 04:46:31,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:46:31,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953649826] [2021-06-11 04:46:31,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:46:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:46:31,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:31,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 04:46:31,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:31,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:46:31,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:31,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:46:31,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:31,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 04:46:31,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:31,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:46:31,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:31,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:46:31,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:31,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:46:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:46:31,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953649826] [2021-06-11 04:46:31,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:46:31,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 04:46:31,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525784608] [2021-06-11 04:46:31,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 04:46:31,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:46:31,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 04:46:31,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-11 04:46:31,175 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 352 [2021-06-11 04:46:31,176 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 270 transitions, 5686 flow. Second operand has 8 states, 8 states have (on average 194.125) internal successors, (1553), 8 states have internal predecessors, (1553), 0 states have call successors, (0), 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-06-11 04:46:31,176 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:46:31,176 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 352 [2021-06-11 04:46:31,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:46:34,129 INFO L129 PetriNetUnfolder]: 13801/20642 cut-off events. [2021-06-11 04:46:34,129 INFO L130 PetriNetUnfolder]: For 505875/505876 co-relation queries the response was YES. [2021-06-11 04:46:34,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128684 conditions, 20642 events. 13801/20642 cut-off events. For 505875/505876 co-relation queries the response was YES. Maximal size of possible extension queue 1182. Compared 137464 event pairs, 3025 based on Foata normal form. 109/15592 useless extension candidates. Maximal degree in co-relation 128573. Up to 14462 conditions per place. [2021-06-11 04:46:34,661 INFO L132 encePairwiseOnDemand]: 343/352 looper letters, 196 selfloop transitions, 6 changer transitions 112/348 dead transitions. [2021-06-11 04:46:34,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 348 transitions, 8075 flow [2021-06-11 04:46:34,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 04:46:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 04:46:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1790 transitions. [2021-06-11 04:46:34,663 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5650252525252525 [2021-06-11 04:46:34,663 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1790 transitions. [2021-06-11 04:46:34,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1790 transitions. [2021-06-11 04:46:34,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:46:34,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1790 transitions. [2021-06-11 04:46:34,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.88888888888889) internal successors, (1790), 9 states have internal predecessors, (1790), 0 states have call successors, (0), 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-06-11 04:46:34,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:46:34,666 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:46:34,666 INFO L185 Difference]: Start difference. First operand has 207 places, 270 transitions, 5686 flow. Second operand 9 states and 1790 transitions. [2021-06-11 04:46:34,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 348 transitions, 8075 flow [2021-06-11 04:46:35,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 348 transitions, 7939 flow, removed 24 selfloop flow, removed 14 redundant places. [2021-06-11 04:46:35,468 INFO L241 Difference]: Finished difference. Result has 203 places, 235 transitions, 4792 flow [2021-06-11 04:46:35,468 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=5452, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4792, PETRI_PLACES=203, PETRI_TRANSITIONS=235} [2021-06-11 04:46:35,468 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 144 predicate places. [2021-06-11 04:46:35,469 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:46:35,469 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 235 transitions, 4792 flow [2021-06-11 04:46:35,469 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 235 transitions, 4792 flow [2021-06-11 04:46:35,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 194 places, 235 transitions, 4792 flow [2021-06-11 04:46:35,989 INFO L129 PetriNetUnfolder]: 3870/7269 cut-off events. [2021-06-11 04:46:35,989 INFO L130 PetriNetUnfolder]: For 57293/57864 co-relation queries the response was YES. [2021-06-11 04:46:36,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22311 conditions, 7269 events. 3870/7269 cut-off events. For 57293/57864 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 58863 event pairs, 5 based on Foata normal form. 152/4951 useless extension candidates. Maximal degree in co-relation 22207. Up to 2076 conditions per place. [2021-06-11 04:46:36,315 INFO L151 LiptonReduction]: Number of co-enabled transitions 3158 [2021-06-11 04:46:36,325 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:46:36,325 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:46:36,325 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 856 [2021-06-11 04:46:36,325 INFO L480 AbstractCegarLoop]: Abstraction has has 194 places, 235 transitions, 4792 flow [2021-06-11 04:46:36,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 194.125) internal successors, (1553), 8 states have internal predecessors, (1553), 0 states have call successors, (0), 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-06-11 04:46:36,326 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:46:36,326 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-06-11 04:46:36,326 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-11 04:46:36,326 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-06-11 04:46:36,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:46:36,326 INFO L82 PathProgramCache]: Analyzing trace with hash 820369836, now seen corresponding path program 3 times [2021-06-11 04:46:36,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:46:36,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284455509] [2021-06-11 04:46:36,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:46:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:46:36,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:36,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 04:46:36,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:36,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:46:36,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:36,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:46:36,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:36,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:46:36,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:36,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 04:46:36,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:36,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:46:36,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:36,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:46:36,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:36,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:46:36,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:46:36,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284455509] [2021-06-11 04:46:36,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:46:36,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-11 04:46:36,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074054182] [2021-06-11 04:46:36,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 04:46:36,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:46:36,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 04:46:36,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-11 04:46:36,427 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 352 [2021-06-11 04:46:36,427 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 235 transitions, 4792 flow. Second operand has 9 states, 9 states have (on average 192.88888888888889) internal successors, (1736), 9 states have internal predecessors, (1736), 0 states have call successors, (0), 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-06-11 04:46:36,428 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:46:36,428 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 352 [2021-06-11 04:46:36,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:46:38,692 INFO L129 PetriNetUnfolder]: 11898/17735 cut-off events. [2021-06-11 04:46:38,692 INFO L130 PetriNetUnfolder]: For 415969/415970 co-relation queries the response was YES. [2021-06-11 04:46:38,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109820 conditions, 17735 events. 11898/17735 cut-off events. For 415969/415970 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 115463 event pairs, 2671 based on Foata normal form. 109/13398 useless extension candidates. Maximal degree in co-relation 109683. Up to 12395 conditions per place. [2021-06-11 04:46:38,879 INFO L132 encePairwiseOnDemand]: 341/352 looper letters, 173 selfloop transitions, 10 changer transitions 87/300 dead transitions. [2021-06-11 04:46:38,879 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 300 transitions, 6725 flow [2021-06-11 04:46:38,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-11 04:46:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-11 04:46:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1974 transitions. [2021-06-11 04:46:38,881 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5607954545454545 [2021-06-11 04:46:38,881 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1974 transitions. [2021-06-11 04:46:38,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1974 transitions. [2021-06-11 04:46:38,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:46:38,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1974 transitions. [2021-06-11 04:46:38,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 197.4) internal successors, (1974), 10 states have internal predecessors, (1974), 0 states have call successors, (0), 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-06-11 04:46:38,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 352.0) internal successors, (3872), 11 states have internal predecessors, (3872), 0 states have call successors, (0), 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-06-11 04:46:38,884 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 352.0) internal successors, (3872), 11 states have internal predecessors, (3872), 0 states have call successors, (0), 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-06-11 04:46:38,884 INFO L185 Difference]: Start difference. First operand has 194 places, 235 transitions, 4792 flow. Second operand 10 states and 1974 transitions. [2021-06-11 04:46:38,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 300 transitions, 6725 flow [2021-06-11 04:46:39,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 300 transitions, 6489 flow, removed 24 selfloop flow, removed 18 redundant places. [2021-06-11 04:46:39,733 INFO L241 Difference]: Finished difference. Result has 187 places, 212 transitions, 4027 flow [2021-06-11 04:46:39,734 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=4487, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4027, PETRI_PLACES=187, PETRI_TRANSITIONS=212} [2021-06-11 04:46:39,734 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 128 predicate places. [2021-06-11 04:46:39,734 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:46:39,734 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 212 transitions, 4027 flow [2021-06-11 04:46:39,734 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 212 transitions, 4027 flow [2021-06-11 04:46:39,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 177 places, 212 transitions, 4027 flow [2021-06-11 04:46:40,229 INFO L129 PetriNetUnfolder]: 3354/6284 cut-off events. [2021-06-11 04:46:40,230 INFO L130 PetriNetUnfolder]: For 42560/42950 co-relation queries the response was YES. [2021-06-11 04:46:40,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18591 conditions, 6284 events. 3354/6284 cut-off events. For 42560/42950 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 49871 event pairs, 7 based on Foata normal form. 63/4236 useless extension candidates. Maximal degree in co-relation 16774. Up to 1808 conditions per place. [2021-06-11 04:46:40,331 INFO L151 LiptonReduction]: Number of co-enabled transitions 2970 [2021-06-11 04:46:40,339 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:46:40,340 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:46:40,340 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 606 [2021-06-11 04:46:40,340 INFO L480 AbstractCegarLoop]: Abstraction has has 177 places, 212 transitions, 4027 flow [2021-06-11 04:46:40,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 192.88888888888889) internal successors, (1736), 9 states have internal predecessors, (1736), 0 states have call successors, (0), 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-06-11 04:46:40,340 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:46:40,341 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-06-11 04:46:40,341 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-11 04:46:40,341 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-06-11 04:46:40,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:46:40,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1995860480, now seen corresponding path program 4 times [2021-06-11 04:46:40,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:46:40,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61758036] [2021-06-11 04:46:40,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:46:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:46:40,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:40,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 04:46:40,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:40,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 04:46:40,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:40,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:46:40,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:40,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:46:40,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:40,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:46:40,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:40,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 04:46:40,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:40,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:46:40,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:40,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:46:40,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:40,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:46:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:46:40,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61758036] [2021-06-11 04:46:40,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:46:40,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-11 04:46:40,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638553462] [2021-06-11 04:46:40,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 04:46:40,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:46:40,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 04:46:40,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-11 04:46:40,463 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 352 [2021-06-11 04:46:40,464 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 212 transitions, 4027 flow. Second operand has 10 states, 10 states have (on average 191.7) internal successors, (1917), 10 states have internal predecessors, (1917), 0 states have call successors, (0), 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-06-11 04:46:40,464 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:46:40,464 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 352 [2021-06-11 04:46:40,464 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:46:42,662 INFO L129 PetriNetUnfolder]: 10356/15477 cut-off events. [2021-06-11 04:46:42,662 INFO L130 PetriNetUnfolder]: For 320451/320452 co-relation queries the response was YES. [2021-06-11 04:46:42,738 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91771 conditions, 15477 events. 10356/15477 cut-off events. For 320451/320452 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 99215 event pairs, 2285 based on Foata normal form. 112/11689 useless extension candidates. Maximal degree in co-relation 82671. Up to 10536 conditions per place. [2021-06-11 04:46:42,778 INFO L132 encePairwiseOnDemand]: 340/352 looper letters, 156 selfloop transitions, 14 changer transitions 73/271 dead transitions. [2021-06-11 04:46:42,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 271 transitions, 5716 flow [2021-06-11 04:46:42,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-11 04:46:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-11 04:46:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1967 transitions. [2021-06-11 04:46:42,781 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5588068181818182 [2021-06-11 04:46:42,781 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1967 transitions. [2021-06-11 04:46:42,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1967 transitions. [2021-06-11 04:46:42,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:46:42,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1967 transitions. [2021-06-11 04:46:42,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 196.7) internal successors, (1967), 10 states have internal predecessors, (1967), 0 states have call successors, (0), 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-06-11 04:46:42,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 352.0) internal successors, (3872), 11 states have internal predecessors, (3872), 0 states have call successors, (0), 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-06-11 04:46:42,785 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 352.0) internal successors, (3872), 11 states have internal predecessors, (3872), 0 states have call successors, (0), 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-06-11 04:46:42,785 INFO L185 Difference]: Start difference. First operand has 177 places, 212 transitions, 4027 flow. Second operand 10 states and 1967 transitions. [2021-06-11 04:46:42,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 271 transitions, 5716 flow [2021-06-11 04:46:43,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 271 transitions, 5616 flow, removed 30 selfloop flow, removed 13 redundant places. [2021-06-11 04:46:43,210 INFO L241 Difference]: Finished difference. Result has 175 places, 197 transitions, 3573 flow [2021-06-11 04:46:43,211 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=3811, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3573, PETRI_PLACES=175, PETRI_TRANSITIONS=197} [2021-06-11 04:46:43,211 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 116 predicate places. [2021-06-11 04:46:43,211 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:46:43,211 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 197 transitions, 3573 flow [2021-06-11 04:46:43,211 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 197 transitions, 3573 flow [2021-06-11 04:46:43,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 165 places, 197 transitions, 3573 flow [2021-06-11 04:46:43,548 INFO L129 PetriNetUnfolder]: 2789/5228 cut-off events. [2021-06-11 04:46:43,549 INFO L130 PetriNetUnfolder]: For 34814/35150 co-relation queries the response was YES. [2021-06-11 04:46:43,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15380 conditions, 5228 events. 2789/5228 cut-off events. For 34814/35150 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 40147 event pairs, 4 based on Foata normal form. 61/3534 useless extension candidates. Maximal degree in co-relation 13785. Up to 1492 conditions per place. [2021-06-11 04:46:43,626 INFO L151 LiptonReduction]: Number of co-enabled transitions 2786 [2021-06-11 04:46:43,633 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:46:43,633 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:46:43,633 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 422 [2021-06-11 04:46:43,634 INFO L480 AbstractCegarLoop]: Abstraction has has 165 places, 197 transitions, 3573 flow [2021-06-11 04:46:43,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 191.7) internal successors, (1917), 10 states have internal predecessors, (1917), 0 states have call successors, (0), 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-06-11 04:46:43,634 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:46:43,634 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-06-11 04:46:43,634 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-11 04:46:43,634 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-06-11 04:46:43,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:46:43,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1696327412, now seen corresponding path program 2 times [2021-06-11 04:46:43,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:46:43,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502614985] [2021-06-11 04:46:43,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:46:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:46:43,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:43,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:46:43,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:43,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 04:46:43,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:43,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 04:46:43,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:43,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:46:43,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:43,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:46:43,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:43,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:46:43,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:43,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:46:43,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:43,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 04:46:43,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:43,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:46:43,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:43,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:46:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:46:43,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502614985] [2021-06-11 04:46:43,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:46:43,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-11 04:46:43,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324427914] [2021-06-11 04:46:43,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-11 04:46:43,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:46:43,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-11 04:46:43,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-11 04:46:43,742 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 352 [2021-06-11 04:46:43,742 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 197 transitions, 3573 flow. Second operand has 11 states, 11 states have (on average 189.54545454545453) internal successors, (2085), 11 states have internal predecessors, (2085), 0 states have call successors, (0), 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-06-11 04:46:43,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:46:43,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 352 [2021-06-11 04:46:43,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:46:45,695 INFO L129 PetriNetUnfolder]: 10026/14879 cut-off events. [2021-06-11 04:46:45,696 INFO L130 PetriNetUnfolder]: For 292558/292559 co-relation queries the response was YES. [2021-06-11 04:46:45,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85213 conditions, 14879 events. 10026/14879 cut-off events. For 292558/292559 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 93159 event pairs, 2243 based on Foata normal form. 57/11164 useless extension candidates. Maximal degree in co-relation 78020. Up to 10662 conditions per place. [2021-06-11 04:46:45,805 INFO L132 encePairwiseOnDemand]: 342/352 looper letters, 153 selfloop transitions, 23 changer transitions 23/227 dead transitions. [2021-06-11 04:46:45,805 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 227 transitions, 4376 flow [2021-06-11 04:46:45,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 04:46:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 04:46:45,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1383 transitions. [2021-06-11 04:46:45,806 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5612824675324676 [2021-06-11 04:46:45,806 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1383 transitions. [2021-06-11 04:46:45,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1383 transitions. [2021-06-11 04:46:45,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:46:45,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1383 transitions. [2021-06-11 04:46:45,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 197.57142857142858) internal successors, (1383), 7 states have internal predecessors, (1383), 0 states have call successors, (0), 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-06-11 04:46:45,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:46:45,808 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:46:45,808 INFO L185 Difference]: Start difference. First operand has 165 places, 197 transitions, 3573 flow. Second operand 7 states and 1383 transitions. [2021-06-11 04:46:45,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 227 transitions, 4376 flow [2021-06-11 04:46:46,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 227 transitions, 4298 flow, removed 23 selfloop flow, removed 12 redundant places. [2021-06-11 04:46:46,123 INFO L241 Difference]: Finished difference. Result has 162 places, 203 transitions, 3708 flow [2021-06-11 04:46:46,123 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=3513, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3708, PETRI_PLACES=162, PETRI_TRANSITIONS=203} [2021-06-11 04:46:46,123 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 103 predicate places. [2021-06-11 04:46:46,124 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:46:46,124 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 203 transitions, 3708 flow [2021-06-11 04:46:46,124 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 203 transitions, 3708 flow [2021-06-11 04:46:46,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 160 places, 203 transitions, 3708 flow [2021-06-11 04:46:46,441 INFO L129 PetriNetUnfolder]: 2859/5337 cut-off events. [2021-06-11 04:46:46,441 INFO L130 PetriNetUnfolder]: For 33480/33645 co-relation queries the response was YES. [2021-06-11 04:46:46,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15553 conditions, 5337 events. 2859/5337 cut-off events. For 33480/33645 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 40874 event pairs, 7 based on Foata normal form. 48/3590 useless extension candidates. Maximal degree in co-relation 14027. Up to 1532 conditions per place. [2021-06-11 04:46:46,516 INFO L151 LiptonReduction]: Number of co-enabled transitions 2772 [2021-06-11 04:46:46,526 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:46:46,526 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:46:46,527 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 403 [2021-06-11 04:46:46,527 INFO L480 AbstractCegarLoop]: Abstraction has has 160 places, 203 transitions, 3708 flow [2021-06-11 04:46:46,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 189.54545454545453) internal successors, (2085), 11 states have internal predecessors, (2085), 0 states have call successors, (0), 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-06-11 04:46:46,527 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:46:46,528 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-06-11 04:46:46,528 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-11 04:46:46,528 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-06-11 04:46:46,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:46:46,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1301871408, now seen corresponding path program 3 times [2021-06-11 04:46:46,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:46:46,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120055010] [2021-06-11 04:46:46,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:46:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:46:46,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:46,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 04:46:46,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:46,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 04:46:46,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:46,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 04:46:46,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:46,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:46:46,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:46,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:46:46,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:46,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:46:46,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:46,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:46:46,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:46,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:46:46,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:46,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:46:46,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:46,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:46:46,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:46:46,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120055010] [2021-06-11 04:46:46,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:46:46,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-11 04:46:46,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407713106] [2021-06-11 04:46:46,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-11 04:46:46,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:46:46,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-11 04:46:46,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-11 04:46:46,638 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 352 [2021-06-11 04:46:46,639 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 203 transitions, 3708 flow. Second operand has 11 states, 11 states have (on average 189.54545454545453) internal successors, (2085), 11 states have internal predecessors, (2085), 0 states have call successors, (0), 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-06-11 04:46:46,639 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:46:46,639 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 352 [2021-06-11 04:46:46,639 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:46:48,667 INFO L129 PetriNetUnfolder]: 10022/14889 cut-off events. [2021-06-11 04:46:48,668 INFO L130 PetriNetUnfolder]: For 292562/292563 co-relation queries the response was YES. [2021-06-11 04:46:48,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83123 conditions, 14889 events. 10022/14889 cut-off events. For 292562/292563 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 93460 event pairs, 2253 based on Foata normal form. 58/11171 useless extension candidates. Maximal degree in co-relation 78516. Up to 10637 conditions per place. [2021-06-11 04:46:48,773 INFO L132 encePairwiseOnDemand]: 342/352 looper letters, 153 selfloop transitions, 16 changer transitions 33/230 dead transitions. [2021-06-11 04:46:48,773 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 230 transitions, 4402 flow [2021-06-11 04:46:48,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-11 04:46:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-11 04:46:48,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1576 transitions. [2021-06-11 04:46:48,775 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5596590909090909 [2021-06-11 04:46:48,775 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1576 transitions. [2021-06-11 04:46:48,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1576 transitions. [2021-06-11 04:46:48,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:46:48,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1576 transitions. [2021-06-11 04:46:48,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 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-06-11 04:46:48,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 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-06-11 04:46:48,777 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 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-06-11 04:46:48,777 INFO L185 Difference]: Start difference. First operand has 160 places, 203 transitions, 3708 flow. Second operand 8 states and 1576 transitions. [2021-06-11 04:46:48,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 230 transitions, 4402 flow [2021-06-11 04:46:49,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 230 transitions, 4361 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-06-11 04:46:49,048 INFO L241 Difference]: Finished difference. Result has 166 places, 195 transitions, 3532 flow [2021-06-11 04:46:49,048 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=3667, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3532, PETRI_PLACES=166, PETRI_TRANSITIONS=195} [2021-06-11 04:46:49,048 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 107 predicate places. [2021-06-11 04:46:49,048 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:46:49,048 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 195 transitions, 3532 flow [2021-06-11 04:46:49,049 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 195 transitions, 3532 flow [2021-06-11 04:46:49,050 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 162 places, 195 transitions, 3532 flow [2021-06-11 04:46:49,361 INFO L129 PetriNetUnfolder]: 2723/5114 cut-off events. [2021-06-11 04:46:49,361 INFO L130 PetriNetUnfolder]: For 33672/33964 co-relation queries the response was YES. [2021-06-11 04:46:49,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14896 conditions, 5114 events. 2723/5114 cut-off events. For 33672/33964 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 39182 event pairs, 7 based on Foata normal form. 40/3439 useless extension candidates. Maximal degree in co-relation 14556. Up to 1456 conditions per place. [2021-06-11 04:46:49,433 INFO L151 LiptonReduction]: Number of co-enabled transitions 2764 [2021-06-11 04:46:49,440 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:46:49,440 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:46:49,440 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 392 [2021-06-11 04:46:49,441 INFO L480 AbstractCegarLoop]: Abstraction has has 162 places, 195 transitions, 3532 flow [2021-06-11 04:46:49,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 189.54545454545453) internal successors, (2085), 11 states have internal predecessors, (2085), 0 states have call successors, (0), 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-06-11 04:46:49,441 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:46:49,441 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-06-11 04:46:49,441 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-11 04:46:49,441 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-06-11 04:46:49,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:46:49,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1813691038, now seen corresponding path program 4 times [2021-06-11 04:46:49,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:46:49,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914871479] [2021-06-11 04:46:49,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:46:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:46:49,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:49,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 04:46:49,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:49,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 04:46:49,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:49,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-06-11 04:46:49,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:49,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-06-11 04:46:49,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:49,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 04:46:49,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:49,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:46:49,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:49,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:46:49,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:49,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:46:49,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:49,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:46:49,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:49,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:46:49,671 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-06-11 04:46:49,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 04:46:49,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:49,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:46:49,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:49,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:46:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:46:49,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914871479] [2021-06-11 04:46:49,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:46:49,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-11 04:46:49,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078540539] [2021-06-11 04:46:49,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-11 04:46:49,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:46:49,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-11 04:46:49,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-06-11 04:46:49,696 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 352 [2021-06-11 04:46:49,697 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 195 transitions, 3532 flow. Second operand has 13 states, 13 states have (on average 187.30769230769232) internal successors, (2435), 13 states have internal predecessors, (2435), 0 states have call successors, (0), 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-06-11 04:46:49,697 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:46:49,697 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 352 [2021-06-11 04:46:49,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:46:51,973 INFO L129 PetriNetUnfolder]: 11094/16539 cut-off events. [2021-06-11 04:46:51,973 INFO L130 PetriNetUnfolder]: For 308618/308619 co-relation queries the response was YES. [2021-06-11 04:46:52,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92542 conditions, 16539 events. 11094/16539 cut-off events. For 308618/308619 co-relation queries the response was YES. Maximal size of possible extension queue 981. Compared 107207 event pairs, 406 based on Foata normal form. 57/12633 useless extension candidates. Maximal degree in co-relation 89879. Up to 9019 conditions per place. [2021-06-11 04:46:52,102 INFO L132 encePairwiseOnDemand]: 341/352 looper letters, 205 selfloop transitions, 57 changer transitions 12/302 dead transitions. [2021-06-11 04:46:52,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 302 transitions, 5890 flow [2021-06-11 04:46:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 04:46:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 04:46:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1771 transitions. [2021-06-11 04:46:52,103 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5590277777777778 [2021-06-11 04:46:52,103 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1771 transitions. [2021-06-11 04:46:52,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1771 transitions. [2021-06-11 04:46:52,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:46:52,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1771 transitions. [2021-06-11 04:46:52,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 196.77777777777777) internal successors, (1771), 9 states have internal predecessors, (1771), 0 states have call successors, (0), 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-06-11 04:46:52,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:46:52,106 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:46:52,106 INFO L185 Difference]: Start difference. First operand has 162 places, 195 transitions, 3532 flow. Second operand 9 states and 1771 transitions. [2021-06-11 04:46:52,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 302 transitions, 5890 flow [2021-06-11 04:46:52,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 302 transitions, 5844 flow, removed 5 selfloop flow, removed 7 redundant places. [2021-06-11 04:46:52,470 INFO L241 Difference]: Finished difference. Result has 167 places, 226 transitions, 4459 flow [2021-06-11 04:46:52,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=3488, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4459, PETRI_PLACES=167, PETRI_TRANSITIONS=226} [2021-06-11 04:46:52,471 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 108 predicate places. [2021-06-11 04:46:52,471 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:46:52,471 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 226 transitions, 4459 flow [2021-06-11 04:46:52,471 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 226 transitions, 4459 flow [2021-06-11 04:46:52,473 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 226 transitions, 4459 flow [2021-06-11 04:46:52,907 INFO L129 PetriNetUnfolder]: 3621/6845 cut-off events. [2021-06-11 04:46:52,907 INFO L130 PetriNetUnfolder]: For 54229/54293 co-relation queries the response was YES. [2021-06-11 04:46:52,948 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21468 conditions, 6845 events. 3621/6845 cut-off events. For 54229/54293 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 55147 event pairs, 7 based on Foata normal form. 17/4626 useless extension candidates. Maximal degree in co-relation 20082. Up to 1940 conditions per place. [2021-06-11 04:46:53,240 INFO L151 LiptonReduction]: Number of co-enabled transitions 3130 [2021-06-11 04:46:53,249 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:46:53,249 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:46:53,249 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 778 [2021-06-11 04:46:53,250 INFO L480 AbstractCegarLoop]: Abstraction has has 167 places, 226 transitions, 4459 flow [2021-06-11 04:46:53,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 187.30769230769232) internal successors, (2435), 13 states have internal predecessors, (2435), 0 states have call successors, (0), 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-06-11 04:46:53,250 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:46:53,250 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-06-11 04:46:53,250 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-11 04:46:53,250 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-06-11 04:46:53,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:46:53,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1850829889, now seen corresponding path program 1 times [2021-06-11 04:46:53,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:46:53,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748874881] [2021-06-11 04:46:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:46:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:46:53,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:53,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 04:46:53,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:53,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 04:46:53,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:53,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 04:46:53,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:53,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:46:53,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:53,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:46:53,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:53,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:46:53,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:53,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 04:46:53,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:53,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:46:53,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:53,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:46:53,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:53,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:46:53,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-06-11 04:46:53,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748874881] [2021-06-11 04:46:53,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:46:53,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-11 04:46:53,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141632796] [2021-06-11 04:46:53,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 04:46:53,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:46:53,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 04:46:53,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-11 04:46:53,406 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 352 [2021-06-11 04:46:53,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 226 transitions, 4459 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-06-11 04:46:53,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:46:53,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 352 [2021-06-11 04:46:53,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:46:55,703 INFO L129 PetriNetUnfolder]: 12324/18198 cut-off events. [2021-06-11 04:46:55,703 INFO L130 PetriNetUnfolder]: For 422209/422309 co-relation queries the response was YES. [2021-06-11 04:46:55,810 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108889 conditions, 18198 events. 12324/18198 cut-off events. For 422209/422309 co-relation queries the response was YES. Maximal size of possible extension queue 1053. Compared 117386 event pairs, 2447 based on Foata normal form. 176/13683 useless extension candidates. Maximal degree in co-relation 98002. Up to 12876 conditions per place. [2021-06-11 04:46:55,844 INFO L132 encePairwiseOnDemand]: 340/352 looper letters, 161 selfloop transitions, 25 changer transitions 55/269 dead transitions. [2021-06-11 04:46:55,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 269 transitions, 5719 flow [2021-06-11 04:46:55,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 04:46:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 04:46:55,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2133 transitions. [2021-06-11 04:46:55,845 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5508780991735537 [2021-06-11 04:46:55,845 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2133 transitions. [2021-06-11 04:46:55,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2133 transitions. [2021-06-11 04:46:55,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:46:55,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2133 transitions. [2021-06-11 04:46:55,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 193.9090909090909) internal successors, (2133), 11 states have internal predecessors, (2133), 0 states have call successors, (0), 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-06-11 04:46:55,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 352.0) internal successors, (4224), 12 states have internal predecessors, (4224), 0 states have call successors, (0), 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-06-11 04:46:55,849 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 352.0) internal successors, (4224), 12 states have internal predecessors, (4224), 0 states have call successors, (0), 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-06-11 04:46:55,849 INFO L185 Difference]: Start difference. First operand has 167 places, 226 transitions, 4459 flow. Second operand 11 states and 2133 transitions. [2021-06-11 04:46:55,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 269 transitions, 5719 flow [2021-06-11 04:46:56,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 269 transitions, 5664 flow, removed 18 selfloop flow, removed 3 redundant places. [2021-06-11 04:46:56,497 INFO L241 Difference]: Finished difference. Result has 177 places, 199 transitions, 3687 flow [2021-06-11 04:46:56,498 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=4410, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3687, PETRI_PLACES=177, PETRI_TRANSITIONS=199} [2021-06-11 04:46:56,498 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 118 predicate places. [2021-06-11 04:46:56,498 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:46:56,498 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 199 transitions, 3687 flow [2021-06-11 04:46:56,498 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 199 transitions, 3687 flow [2021-06-11 04:46:56,499 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 199 transitions, 3687 flow [2021-06-11 04:46:56,913 INFO L129 PetriNetUnfolder]: 3487/6511 cut-off events. [2021-06-11 04:46:56,913 INFO L130 PetriNetUnfolder]: For 39512/39567 co-relation queries the response was YES. [2021-06-11 04:46:56,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18120 conditions, 6511 events. 3487/6511 cut-off events. For 39512/39567 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 51825 event pairs, 3 based on Foata normal form. 7/4271 useless extension candidates. Maximal degree in co-relation 17790. Up to 1940 conditions per place. [2021-06-11 04:46:57,014 INFO L151 LiptonReduction]: Number of co-enabled transitions 2904 [2021-06-11 04:46:57,022 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:46:57,022 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:46:57,022 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 524 [2021-06-11 04:46:57,023 INFO L480 AbstractCegarLoop]: Abstraction has has 175 places, 199 transitions, 3687 flow [2021-06-11 04:46:57,023 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-06-11 04:46:57,023 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:46:57,023 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-06-11 04:46:57,023 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-11 04:46:57,023 INFO L428 AbstractCegarLoop]: === Iteration 48 === [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-06-11 04:46:57,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:46:57,024 INFO L82 PathProgramCache]: Analyzing trace with hash 921659210, now seen corresponding path program 1 times [2021-06-11 04:46:57,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:46:57,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091691444] [2021-06-11 04:46:57,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:46:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:46:57,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:57,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 04:46:57,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:57,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 04:46:57,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:57,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-11 04:46:57,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:57,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-06-11 04:46:57,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:57,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 04:46:57,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:57,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:46:57,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:57,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:46:57,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:57,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:46:57,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:57,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 04:46:57,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:57,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:46:57,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:57,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:46:57,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:46:57,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:46:57,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:46:57,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091691444] [2021-06-11 04:46:57,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:46:57,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-11 04:46:57,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673340595] [2021-06-11 04:46:57,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-11 04:46:57,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:46:57,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-11 04:46:57,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-06-11 04:46:57,227 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 352 [2021-06-11 04:46:57,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 199 transitions, 3687 flow. Second operand has 13 states, 13 states have (on average 187.3846153846154) internal successors, (2436), 13 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-06-11 04:46:57,228 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:46:57,228 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 352 [2021-06-11 04:46:57,228 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:46:59,731 INFO L129 PetriNetUnfolder]: 10713/16438 cut-off events. [2021-06-11 04:46:59,732 INFO L130 PetriNetUnfolder]: For 320951/320952 co-relation queries the response was YES. [2021-06-11 04:46:59,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89810 conditions, 16438 events. 10713/16438 cut-off events. For 320951/320952 co-relation queries the response was YES. Maximal size of possible extension queue 985. Compared 111106 event pairs, 508 based on Foata normal form. 459/12593 useless extension candidates. Maximal degree in co-relation 88562. Up to 3857 conditions per place. [2021-06-11 04:46:59,843 INFO L132 encePairwiseOnDemand]: 339/352 looper letters, 136 selfloop transitions, 140 changer transitions 58/362 dead transitions. [2021-06-11 04:46:59,843 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 362 transitions, 6676 flow [2021-06-11 04:46:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 04:46:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 04:46:59,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2206 transitions. [2021-06-11 04:46:59,845 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5697314049586777 [2021-06-11 04:46:59,845 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2206 transitions. [2021-06-11 04:46:59,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2206 transitions. [2021-06-11 04:46:59,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:46:59,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2206 transitions. [2021-06-11 04:46:59,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 200.54545454545453) internal successors, (2206), 11 states have internal predecessors, (2206), 0 states have call successors, (0), 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-06-11 04:46:59,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 352.0) internal successors, (4224), 12 states have internal predecessors, (4224), 0 states have call successors, (0), 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-06-11 04:46:59,850 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 352.0) internal successors, (4224), 12 states have internal predecessors, (4224), 0 states have call successors, (0), 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-06-11 04:46:59,850 INFO L185 Difference]: Start difference. First operand has 175 places, 199 transitions, 3687 flow. Second operand 11 states and 2206 transitions. [2021-06-11 04:46:59,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 362 transitions, 6676 flow [2021-06-11 04:47:00,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 362 transitions, 6316 flow, removed 94 selfloop flow, removed 10 redundant places. [2021-06-11 04:47:00,118 INFO L241 Difference]: Finished difference. Result has 180 places, 245 transitions, 5168 flow [2021-06-11 04:47:00,118 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=3332, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5168, PETRI_PLACES=180, PETRI_TRANSITIONS=245} [2021-06-11 04:47:00,118 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 121 predicate places. [2021-06-11 04:47:00,118 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:47:00,118 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 245 transitions, 5168 flow [2021-06-11 04:47:00,118 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 245 transitions, 5168 flow [2021-06-11 04:47:00,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 177 places, 245 transitions, 5168 flow [2021-06-11 04:47:00,482 INFO L129 PetriNetUnfolder]: 3071/5695 cut-off events. [2021-06-11 04:47:00,483 INFO L130 PetriNetUnfolder]: For 41938/41990 co-relation queries the response was YES. [2021-06-11 04:47:00,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16511 conditions, 5695 events. 3071/5695 cut-off events. For 41938/41990 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 44130 event pairs, 0 based on Foata normal form. 21/3763 useless extension candidates. Maximal degree in co-relation 16372. Up to 1704 conditions per place. [2021-06-11 04:47:00,566 INFO L151 LiptonReduction]: Number of co-enabled transitions 3416 [2021-06-11 04:47:00,577 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:47:00,577 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:47:00,577 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 459 [2021-06-11 04:47:00,577 INFO L480 AbstractCegarLoop]: Abstraction has has 177 places, 245 transitions, 5168 flow [2021-06-11 04:47:00,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 187.3846153846154) internal successors, (2436), 13 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-06-11 04:47:00,578 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:47:00,578 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-06-11 04:47:00,578 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-11 04:47:00,578 INFO L428 AbstractCegarLoop]: === Iteration 49 === [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-06-11 04:47:00,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:47:00,578 INFO L82 PathProgramCache]: Analyzing trace with hash -920170070, now seen corresponding path program 1 times [2021-06-11 04:47:00,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:47:00,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743491421] [2021-06-11 04:47:00,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:47:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:47:00,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:00,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 04:47:00,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:00,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:47:00,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:00,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 04:47:00,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:00,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:47:00,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:00,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:47:00,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:00,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 04:47:00,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:00,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:47:00,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:00,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:47:00,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:00,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:47:00,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:00,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:47:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:47:00,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743491421] [2021-06-11 04:47:00,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:47:00,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-11 04:47:00,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528896467] [2021-06-11 04:47:00,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-11 04:47:00,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:47:00,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-11 04:47:00,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-11 04:47:00,678 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 352 [2021-06-11 04:47:00,678 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 245 transitions, 5168 flow. Second operand has 11 states, 11 states have (on average 189.63636363636363) internal successors, (2086), 11 states have internal predecessors, (2086), 0 states have call successors, (0), 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-06-11 04:47:00,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:47:00,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 352 [2021-06-11 04:47:00,678 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:47:02,247 INFO L129 PetriNetUnfolder]: 7495/11538 cut-off events. [2021-06-11 04:47:02,247 INFO L130 PetriNetUnfolder]: For 275088/275144 co-relation queries the response was YES. [2021-06-11 04:47:02,317 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66901 conditions, 11538 events. 7495/11538 cut-off events. For 275088/275144 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 75024 event pairs, 1372 based on Foata normal form. 268/8718 useless extension candidates. Maximal degree in co-relation 66206. Up to 6421 conditions per place. [2021-06-11 04:47:02,340 INFO L132 encePairwiseOnDemand]: 345/352 looper letters, 169 selfloop transitions, 7 changer transitions 72/276 dead transitions. [2021-06-11 04:47:02,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 276 transitions, 6436 flow [2021-06-11 04:47:02,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 04:47:02,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 04:47:02,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1373 transitions. [2021-06-11 04:47:02,341 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.557224025974026 [2021-06-11 04:47:02,341 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1373 transitions. [2021-06-11 04:47:02,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1373 transitions. [2021-06-11 04:47:02,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:47:02,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1373 transitions. [2021-06-11 04:47:02,342 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-06-11 04:47:02,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:47:02,343 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:47:02,344 INFO L185 Difference]: Start difference. First operand has 177 places, 245 transitions, 5168 flow. Second operand 7 states and 1373 transitions. [2021-06-11 04:47:02,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 276 transitions, 6436 flow [2021-06-11 04:47:02,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 276 transitions, 6319 flow, removed 41 selfloop flow, removed 9 redundant places. [2021-06-11 04:47:02,850 INFO L241 Difference]: Finished difference. Result has 176 places, 203 transitions, 4177 flow [2021-06-11 04:47:02,850 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=4629, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4177, PETRI_PLACES=176, PETRI_TRANSITIONS=203} [2021-06-11 04:47:02,850 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 117 predicate places. [2021-06-11 04:47:02,851 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:47:02,851 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 203 transitions, 4177 flow [2021-06-11 04:47:02,851 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 203 transitions, 4177 flow [2021-06-11 04:47:02,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 160 places, 203 transitions, 4177 flow [2021-06-11 04:47:03,077 INFO L129 PetriNetUnfolder]: 1980/3672 cut-off events. [2021-06-11 04:47:03,077 INFO L130 PetriNetUnfolder]: For 27400/27438 co-relation queries the response was YES. [2021-06-11 04:47:03,096 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10702 conditions, 3672 events. 1980/3672 cut-off events. For 27400/27438 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 26321 event pairs, 0 based on Foata normal form. 15/2428 useless extension candidates. Maximal degree in co-relation 10382. Up to 1100 conditions per place. [2021-06-11 04:47:03,127 INFO L151 LiptonReduction]: Number of co-enabled transitions 2966 [2021-06-11 04:47:03,135 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:47:03,135 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:47:03,135 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 284 [2021-06-11 04:47:03,135 INFO L480 AbstractCegarLoop]: Abstraction has has 160 places, 203 transitions, 4177 flow [2021-06-11 04:47:03,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 189.63636363636363) internal successors, (2086), 11 states have internal predecessors, (2086), 0 states have call successors, (0), 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-06-11 04:47:03,136 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:47:03,136 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-06-11 04:47:03,136 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-11 04:47:03,136 INFO L428 AbstractCegarLoop]: === Iteration 50 === [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-06-11 04:47:03,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:47:03,136 INFO L82 PathProgramCache]: Analyzing trace with hash -377183250, now seen corresponding path program 2 times [2021-06-11 04:47:03,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:47:03,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340698673] [2021-06-11 04:47:03,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:47:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:47:03,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:03,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 04:47:03,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:03,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:47:03,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:03,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 04:47:03,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:03,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 04:47:03,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:03,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:47:03,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:03,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:47:03,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:03,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:47:03,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:03,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 04:47:03,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:03,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:47:03,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:03,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:47:03,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:03,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:47:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:47:03,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340698673] [2021-06-11 04:47:03,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:47:03,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-11 04:47:03,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775905907] [2021-06-11 04:47:03,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-11 04:47:03,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:47:03,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-11 04:47:03,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-11 04:47:03,269 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 352 [2021-06-11 04:47:03,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 203 transitions, 4177 flow. Second operand has 11 states, 11 states have (on average 188.63636363636363) internal successors, (2075), 11 states have internal predecessors, (2075), 0 states have call successors, (0), 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-06-11 04:47:03,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:47:03,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 352 [2021-06-11 04:47:03,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:47:04,511 INFO L129 PetriNetUnfolder]: 4704/7272 cut-off events. [2021-06-11 04:47:04,511 INFO L130 PetriNetUnfolder]: For 170710/170749 co-relation queries the response was YES. [2021-06-11 04:47:04,549 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41022 conditions, 7272 events. 4704/7272 cut-off events. For 170710/170749 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 44170 event pairs, 942 based on Foata normal form. 193/5560 useless extension candidates. Maximal degree in co-relation 40291. Up to 3859 conditions per place. [2021-06-11 04:47:04,557 INFO L132 encePairwiseOnDemand]: 344/352 looper letters, 79 selfloop transitions, 8 changer transitions 103/216 dead transitions. [2021-06-11 04:47:04,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 216 transitions, 4794 flow [2021-06-11 04:47:04,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 04:47:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 04:47:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1371 transitions. [2021-06-11 04:47:04,559 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5564123376623377 [2021-06-11 04:47:04,559 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1371 transitions. [2021-06-11 04:47:04,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1371 transitions. [2021-06-11 04:47:04,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:47:04,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1371 transitions. [2021-06-11 04:47:04,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 195.85714285714286) internal successors, (1371), 7 states have internal predecessors, (1371), 0 states have call successors, (0), 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-06-11 04:47:04,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:47:04,561 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:47:04,561 INFO L185 Difference]: Start difference. First operand has 160 places, 203 transitions, 4177 flow. Second operand 7 states and 1371 transitions. [2021-06-11 04:47:04,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 216 transitions, 4794 flow [2021-06-11 04:47:04,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 216 transitions, 4280 flow, removed 53 selfloop flow, removed 23 redundant places. [2021-06-11 04:47:04,683 INFO L241 Difference]: Finished difference. Result has 144 places, 112 transitions, 1621 flow [2021-06-11 04:47:04,683 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=3043, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1621, PETRI_PLACES=144, PETRI_TRANSITIONS=112} [2021-06-11 04:47:04,683 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 85 predicate places. [2021-06-11 04:47:04,683 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:47:04,683 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 112 transitions, 1621 flow [2021-06-11 04:47:04,683 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 112 transitions, 1621 flow [2021-06-11 04:47:04,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 138 places, 112 transitions, 1621 flow [2021-06-11 04:47:04,759 INFO L129 PetriNetUnfolder]: 852/1581 cut-off events. [2021-06-11 04:47:04,759 INFO L130 PetriNetUnfolder]: For 8320/8361 co-relation queries the response was YES. [2021-06-11 04:47:04,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4303 conditions, 1581 events. 852/1581 cut-off events. For 8320/8361 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 9523 event pairs, 2 based on Foata normal form. 7/1015 useless extension candidates. Maximal degree in co-relation 4045. Up to 480 conditions per place. [2021-06-11 04:47:04,774 INFO L151 LiptonReduction]: Number of co-enabled transitions 1656 [2021-06-11 04:47:04,778 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:47:04,778 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:47:04,778 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 95 [2021-06-11 04:47:04,778 INFO L480 AbstractCegarLoop]: Abstraction has has 138 places, 112 transitions, 1621 flow [2021-06-11 04:47:04,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 188.63636363636363) internal successors, (2075), 11 states have internal predecessors, (2075), 0 states have call successors, (0), 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-06-11 04:47:04,779 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:47:04,779 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-06-11 04:47:04,779 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-11 04:47:04,779 INFO L428 AbstractCegarLoop]: === Iteration 51 === [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-06-11 04:47:04,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:47:04,779 INFO L82 PathProgramCache]: Analyzing trace with hash -872251081, now seen corresponding path program 2 times [2021-06-11 04:47:04,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:47:04,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809094058] [2021-06-11 04:47:04,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:47:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:47:04,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:04,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 04:47:04,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:04,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 04:47:04,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:04,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-06-11 04:47:04,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:04,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-06-11 04:47:04,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:04,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 04:47:04,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:04,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 04:47:04,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:04,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:47:04,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:04,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 04:47:04,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:04,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-06-11 04:47:04,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:04,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 04:47:04,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:04,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:47:04,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:04,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:47:04,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:47:04,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809094058] [2021-06-11 04:47:04,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:47:04,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-11 04:47:04,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065187581] [2021-06-11 04:47:04,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-11 04:47:04,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:47:04,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-11 04:47:04,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-11 04:47:04,978 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 352 [2021-06-11 04:47:04,979 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 112 transitions, 1621 flow. Second operand has 12 states, 12 states have (on average 186.5) internal successors, (2238), 12 states have internal predecessors, (2238), 0 states have call successors, (0), 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-06-11 04:47:04,979 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:47:04,980 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 352 [2021-06-11 04:47:04,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:47:05,763 INFO L129 PetriNetUnfolder]: 2475/3789 cut-off events. [2021-06-11 04:47:05,763 INFO L130 PetriNetUnfolder]: For 63230/63234 co-relation queries the response was YES. [2021-06-11 04:47:05,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20587 conditions, 3789 events. 2475/3789 cut-off events. For 63230/63234 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 20346 event pairs, 272 based on Foata normal form. 47/2890 useless extension candidates. Maximal degree in co-relation 20550. Up to 1934 conditions per place. [2021-06-11 04:47:05,785 INFO L132 encePairwiseOnDemand]: 340/352 looper letters, 98 selfloop transitions, 25 changer transitions 11/155 dead transitions. [2021-06-11 04:47:05,785 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 155 transitions, 2521 flow [2021-06-11 04:47:05,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 04:47:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 04:47:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1733 transitions. [2021-06-11 04:47:05,786 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5470328282828283 [2021-06-11 04:47:05,787 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1733 transitions. [2021-06-11 04:47:05,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1733 transitions. [2021-06-11 04:47:05,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:47:05,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1733 transitions. [2021-06-11 04:47:05,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 192.55555555555554) internal successors, (1733), 9 states have internal predecessors, (1733), 0 states have call successors, (0), 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-06-11 04:47:05,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:47:05,790 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 352.0) internal successors, (3520), 10 states have internal predecessors, (3520), 0 states have call successors, (0), 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-06-11 04:47:05,790 INFO L185 Difference]: Start difference. First operand has 138 places, 112 transitions, 1621 flow. Second operand 9 states and 1733 transitions. [2021-06-11 04:47:05,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 155 transitions, 2521 flow [2021-06-11 04:47:05,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 155 transitions, 2004 flow, removed 42 selfloop flow, removed 22 redundant places. [2021-06-11 04:47:05,843 INFO L241 Difference]: Finished difference. Result has 124 places, 102 transitions, 1213 flow [2021-06-11 04:47:05,843 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1213, PETRI_PLACES=124, PETRI_TRANSITIONS=102} [2021-06-11 04:47:05,843 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 65 predicate places. [2021-06-11 04:47:05,843 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:47:05,844 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 102 transitions, 1213 flow [2021-06-11 04:47:05,845 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 102 transitions, 1213 flow [2021-06-11 04:47:05,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 102 transitions, 1213 flow [2021-06-11 04:47:05,900 INFO L129 PetriNetUnfolder]: 667/1374 cut-off events. [2021-06-11 04:47:05,900 INFO L130 PetriNetUnfolder]: For 4528/4558 co-relation queries the response was YES. [2021-06-11 04:47:05,904 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3236 conditions, 1374 events. 667/1374 cut-off events. For 4528/4558 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8749 event pairs, 1 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 3008. Up to 382 conditions per place. [2021-06-11 04:47:05,910 INFO L151 LiptonReduction]: Number of co-enabled transitions 1364 [2021-06-11 04:47:05,913 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:47:05,913 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:47:05,913 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 70 [2021-06-11 04:47:05,913 INFO L480 AbstractCegarLoop]: Abstraction has has 122 places, 102 transitions, 1213 flow [2021-06-11 04:47:05,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 186.5) internal successors, (2238), 12 states have internal predecessors, (2238), 0 states have call successors, (0), 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-06-11 04:47:05,914 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:47:05,914 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-06-11 04:47:05,914 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-11 04:47:05,914 INFO L428 AbstractCegarLoop]: === Iteration 52 === [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-06-11 04:47:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:47:05,914 INFO L82 PathProgramCache]: Analyzing trace with hash 407975254, now seen corresponding path program 1 times [2021-06-11 04:47:05,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:47:05,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203879728] [2021-06-11 04:47:05,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:47:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:47:05,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:05,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 04:47:05,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:05,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 04:47:05,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:05,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:47:05,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:05,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 04:47:05,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:05,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 04:47:05,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:05,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 04:47:06,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:47:06,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:47:06,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:47:06,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 04:47:06,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:47:06,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:47:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:47:06,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203879728] [2021-06-11 04:47:06,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:47:06,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-11 04:47:06,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381087172] [2021-06-11 04:47:06,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-11 04:47:06,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:47:06,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-11 04:47:06,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-06-11 04:47:06,078 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 352 [2021-06-11 04:47:06,079 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 102 transitions, 1213 flow. Second operand has 12 states, 12 states have (on average 186.5) internal successors, (2238), 12 states have internal predecessors, (2238), 0 states have call successors, (0), 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-06-11 04:47:06,079 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:47:06,079 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 352 [2021-06-11 04:47:06,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:47:06,642 INFO L129 PetriNetUnfolder]: 2423/4065 cut-off events. [2021-06-11 04:47:06,642 INFO L130 PetriNetUnfolder]: For 42118/42119 co-relation queries the response was YES. [2021-06-11 04:47:06,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17723 conditions, 4065 events. 2423/4065 cut-off events. For 42118/42119 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 25725 event pairs, 337 based on Foata normal form. 86/3170 useless extension candidates. Maximal degree in co-relation 16091. Up to 1389 conditions per place. [2021-06-11 04:47:06,660 INFO L132 encePairwiseOnDemand]: 343/352 looper letters, 80 selfloop transitions, 15 changer transitions 40/161 dead transitions. [2021-06-11 04:47:06,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 161 transitions, 2267 flow [2021-06-11 04:47:06,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 04:47:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 04:47:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1352 transitions. [2021-06-11 04:47:06,662 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5487012987012987 [2021-06-11 04:47:06,662 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1352 transitions. [2021-06-11 04:47:06,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1352 transitions. [2021-06-11 04:47:06,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:47:06,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1352 transitions. [2021-06-11 04:47:06,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 193.14285714285714) internal successors, (1352), 7 states have internal predecessors, (1352), 0 states have call successors, (0), 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-06-11 04:47:06,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:47:06,664 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:47:06,664 INFO L185 Difference]: Start difference. First operand has 122 places, 102 transitions, 1213 flow. Second operand 7 states and 1352 transitions. [2021-06-11 04:47:06,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 161 transitions, 2267 flow [2021-06-11 04:47:06,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 161 transitions, 2186 flow, removed 4 selfloop flow, removed 10 redundant places. [2021-06-11 04:47:06,697 INFO L241 Difference]: Finished difference. Result has 120 places, 97 transitions, 1107 flow [2021-06-11 04:47:06,697 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1107, PETRI_PLACES=120, PETRI_TRANSITIONS=97} [2021-06-11 04:47:06,697 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 61 predicate places. [2021-06-11 04:47:06,698 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:47:06,698 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 97 transitions, 1107 flow [2021-06-11 04:47:06,698 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 97 transitions, 1107 flow [2021-06-11 04:47:06,698 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 97 transitions, 1107 flow [2021-06-11 04:47:06,738 INFO L129 PetriNetUnfolder]: 433/902 cut-off events. [2021-06-11 04:47:06,738 INFO L130 PetriNetUnfolder]: For 4256/4256 co-relation queries the response was YES. [2021-06-11 04:47:06,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2653 conditions, 902 events. 433/902 cut-off events. For 4256/4256 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5170 event pairs, 4 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 2425. Up to 256 conditions per place. [2021-06-11 04:47:06,745 INFO L151 LiptonReduction]: Number of co-enabled transitions 1204 [2021-06-11 04:47:06,748 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:47:06,748 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:47:06,748 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 50 [2021-06-11 04:47:06,749 INFO L480 AbstractCegarLoop]: Abstraction has has 119 places, 97 transitions, 1107 flow [2021-06-11 04:47:06,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 186.5) internal successors, (2238), 12 states have internal predecessors, (2238), 0 states have call successors, (0), 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-06-11 04:47:06,749 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 04:47:06,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, 1, 1] [2021-06-11 04:47:06,749 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-06-11 04:47:06,749 INFO L428 AbstractCegarLoop]: === Iteration 53 === [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-06-11 04:47:06,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 04:47:06,750 INFO L82 PathProgramCache]: Analyzing trace with hash 13757578, now seen corresponding path program 2 times [2021-06-11 04:47:06,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 04:47:06,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694201296] [2021-06-11 04:47:06,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 04:47:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 04:47:06,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 04:47:06,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 04:47:06,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 04:47:06,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 04:47:06,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 04:47:06,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 04:47:06,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 04:47:06,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 04:47:06,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 04:47:06,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 04:47:06,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 04:47:06,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 04:47:06,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 04:47:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 04:47:06,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694201296] [2021-06-11 04:47:06,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 04:47:06,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-11 04:47:06,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402231917] [2021-06-11 04:47:06,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-11 04:47:06,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 04:47:06,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-11 04:47:06,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-06-11 04:47:06,896 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 352 [2021-06-11 04:47:06,897 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 97 transitions, 1107 flow. Second operand has 12 states, 12 states have (on average 186.5) internal successors, (2238), 12 states have internal predecessors, (2238), 0 states have call successors, (0), 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-06-11 04:47:06,897 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 04:47:06,897 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 352 [2021-06-11 04:47:06,897 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 04:47:07,185 INFO L129 PetriNetUnfolder]: 828/1477 cut-off events. [2021-06-11 04:47:07,186 INFO L130 PetriNetUnfolder]: For 16326/16327 co-relation queries the response was YES. [2021-06-11 04:47:07,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6987 conditions, 1477 events. 828/1477 cut-off events. For 16326/16327 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8270 event pairs, 63 based on Foata normal form. 134/1324 useless extension candidates. Maximal degree in co-relation 6964. Up to 622 conditions per place. [2021-06-11 04:47:07,191 INFO L132 encePairwiseOnDemand]: 345/352 looper letters, 0 selfloop transitions, 0 changer transitions 118/118 dead transitions. [2021-06-11 04:47:07,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 118 transitions, 1630 flow [2021-06-11 04:47:07,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 04:47:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 04:47:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1329 transitions. [2021-06-11 04:47:07,193 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5393668831168831 [2021-06-11 04:47:07,193 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1329 transitions. [2021-06-11 04:47:07,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1329 transitions. [2021-06-11 04:47:07,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 04:47:07,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1329 transitions. [2021-06-11 04:47:07,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 189.85714285714286) internal successors, (1329), 7 states have internal predecessors, (1329), 0 states have call successors, (0), 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-06-11 04:47:07,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:47:07,195 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 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-06-11 04:47:07,195 INFO L185 Difference]: Start difference. First operand has 119 places, 97 transitions, 1107 flow. Second operand 7 states and 1329 transitions. [2021-06-11 04:47:07,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 118 transitions, 1630 flow [2021-06-11 04:47:07,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 118 transitions, 1503 flow, removed 3 selfloop flow, removed 10 redundant places. [2021-06-11 04:47:07,209 INFO L241 Difference]: Finished difference. Result has 104 places, 0 transitions, 0 flow [2021-06-11 04:47:07,209 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=104, PETRI_TRANSITIONS=0} [2021-06-11 04:47:07,209 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 45 predicate places. [2021-06-11 04:47:07,209 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 04:47:07,210 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 0 transitions, 0 flow [2021-06-11 04:47:07,210 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 0 transitions, 0 flow [2021-06-11 04:47:07,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2021-06-11 04:47:07,210 INFO L129 PetriNetUnfolder]: 0/0 cut-off events. [2021-06-11 04:47:07,210 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 04:47:07,210 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-06-11 04:47:07,210 INFO L151 LiptonReduction]: Number of co-enabled transitions 0 [2021-06-11 04:47:07,210 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 04:47:07,210 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 04:47:07,210 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1 [2021-06-11 04:47:07,211 INFO L480 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2021-06-11 04:47:07,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 186.5) internal successors, (2238), 12 states have internal predecessors, (2238), 0 states have call successors, (0), 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-06-11 04:47:07,211 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-06-11 04:47:07,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 04:47:07 BasicIcfg [2021-06-11 04:47:07,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 04:47:07,214 INFO L168 Benchmark]: Toolchain (without parser) took 212249.80 ms. Allocated memory was 339.7 MB in the beginning and 15.9 GB in the end (delta: 15.6 GB). Free memory was 300.8 MB in the beginning and 11.6 GB in the end (delta: -11.3 GB). Peak memory consumption was 4.3 GB. Max. memory is 16.0 GB. [2021-06-11 04:47:07,214 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 339.7 MB. Free memory is still 319.9 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 04:47:07,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 656.63 ms. Allocated memory is still 339.7 MB. Free memory was 300.6 MB in the beginning and 261.4 MB in the end (delta: 39.2 MB). Peak memory consumption was 40.7 MB. Max. memory is 16.0 GB. [2021-06-11 04:47:07,214 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.59 ms. Allocated memory is still 339.7 MB. Free memory was 261.4 MB in the beginning and 258.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-11 04:47:07,214 INFO L168 Benchmark]: Boogie Preprocessor took 30.91 ms. Allocated memory is still 339.7 MB. Free memory was 258.5 MB in the beginning and 257.7 MB in the end (delta: 816.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 04:47:07,214 INFO L168 Benchmark]: RCFGBuilder took 469.59 ms. Allocated memory is still 339.7 MB. Free memory was 257.7 MB in the beginning and 229.1 MB in the end (delta: 28.6 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. [2021-06-11 04:47:07,214 INFO L168 Benchmark]: TraceAbstraction took 211020.87 ms. Allocated memory was 339.7 MB in the beginning and 15.9 GB in the end (delta: 15.6 GB). Free memory was 228.3 MB in the beginning and 11.6 GB in the end (delta: -11.3 GB). Peak memory consumption was 4.3 GB. Max. memory is 16.0 GB. [2021-06-11 04:47:07,215 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.13 ms. Allocated memory is still 339.7 MB. Free memory is still 319.9 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 656.63 ms. Allocated memory is still 339.7 MB. Free memory was 300.6 MB in the beginning and 261.4 MB in the end (delta: 39.2 MB). Peak memory consumption was 40.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 63.59 ms. Allocated memory is still 339.7 MB. Free memory was 261.4 MB in the beginning and 258.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.91 ms. Allocated memory is still 339.7 MB. Free memory was 258.5 MB in the beginning and 257.7 MB in the end (delta: 816.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 469.59 ms. Allocated memory is still 339.7 MB. Free memory was 257.7 MB in the beginning and 229.1 MB in the end (delta: 28.6 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 211020.87 ms. Allocated memory was 339.7 MB in the beginning and 15.9 GB in the end (delta: 15.6 GB). Free memory was 228.3 MB in the beginning and 11.6 GB in the end (delta: -11.3 GB). Peak memory consumption was 4.3 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4219.9ms, 125 PlacesBefore, 59 PlacesAfterwards, 147 TransitionsBefore, 79 TransitionsAfterwards, 4982 CoEnabledTransitionPairs, 6 FixpointIterations, 11 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 86 TotalNumberOfCompositions, 3415 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2632, positive: 2613, positive conditional: 0, positive unconditional: 2613, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2433, positive: 2422, positive conditional: 0, positive unconditional: 2422, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2433, positive: 2422, positive conditional: 0, positive unconditional: 2422, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2433, positive: 2417, positive conditional: 0, positive unconditional: 2417, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 77, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2632, positive: 191, positive conditional: 0, positive unconditional: 191, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 2433, unknown conditional: 0, unknown unconditional: 2433] , Statistics on independence cache: Total cache size (in pairs): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.4ms, 54 PlacesBefore, 49 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 1084 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.6ms, 55 PlacesBefore, 55 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1158 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 41.4ms, 62 PlacesBefore, 62 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 1226 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.4ms, 67 PlacesBefore, 67 PlacesAfterwards, 83 TransitionsBefore, 83 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 300.0ms, 71 PlacesBefore, 71 PlacesAfterwards, 103 TransitionsBefore, 103 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 260.7ms, 80 PlacesBefore, 80 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 1906 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 262.5ms, 84 PlacesBefore, 82 PlacesAfterwards, 116 TransitionsBefore, 116 TransitionsAfterwards, 2080 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 268.1ms, 87 PlacesBefore, 87 PlacesAfterwards, 116 TransitionsBefore, 116 TransitionsAfterwards, 2046 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 245.3ms, 86 PlacesBefore, 86 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 2262 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 184.7ms, 94 PlacesBefore, 90 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 1760 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 220.0ms, 91 PlacesBefore, 91 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 2024 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 248.1ms, 99 PlacesBefore, 99 PlacesAfterwards, 122 TransitionsBefore, 122 TransitionsAfterwards, 2248 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 315.3ms, 113 PlacesBefore, 113 PlacesAfterwards, 145 TransitionsBefore, 145 TransitionsAfterwards, 2414 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 560.6ms, 124 PlacesBefore, 124 PlacesAfterwards, 159 TransitionsBefore, 159 TransitionsAfterwards, 2664 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 497.3ms, 126 PlacesBefore, 126 PlacesAfterwards, 163 TransitionsBefore, 163 TransitionsAfterwards, 2690 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 561.5ms, 134 PlacesBefore, 134 PlacesAfterwards, 174 TransitionsBefore, 174 TransitionsAfterwards, 2816 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 634.1ms, 142 PlacesBefore, 142 PlacesAfterwards, 198 TransitionsBefore, 198 TransitionsAfterwards, 2918 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 651.6ms, 145 PlacesBefore, 145 PlacesAfterwards, 199 TransitionsBefore, 199 TransitionsAfterwards, 2902 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 741.3ms, 149 PlacesBefore, 149 PlacesAfterwards, 200 TransitionsBefore, 200 TransitionsAfterwards, 2856 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 993.9ms, 155 PlacesBefore, 155 PlacesAfterwards, 238 TransitionsBefore, 238 TransitionsAfterwards, 3802 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1037.1ms, 161 PlacesBefore, 161 PlacesAfterwards, 244 TransitionsBefore, 244 TransitionsAfterwards, 3944 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1000.8ms, 168 PlacesBefore, 168 PlacesAfterwards, 249 TransitionsBefore, 249 TransitionsAfterwards, 4088 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 979.2ms, 172 PlacesBefore, 172 PlacesAfterwards, 260 TransitionsBefore, 260 TransitionsAfterwards, 4146 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 894.1ms, 181 PlacesBefore, 181 PlacesAfterwards, 272 TransitionsBefore, 272 TransitionsAfterwards, 4342 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1013.1ms, 187 PlacesBefore, 187 PlacesAfterwards, 271 TransitionsBefore, 271 TransitionsAfterwards, 4248 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1009.7ms, 190 PlacesBefore, 190 PlacesAfterwards, 275 TransitionsBefore, 275 TransitionsAfterwards, 4332 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1199.9ms, 192 PlacesBefore, 192 PlacesAfterwards, 279 TransitionsBefore, 279 TransitionsAfterwards, 4446 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1042.3ms, 197 PlacesBefore, 197 PlacesAfterwards, 283 TransitionsBefore, 283 TransitionsAfterwards, 4432 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1209.7ms, 202 PlacesBefore, 202 PlacesAfterwards, 290 TransitionsBefore, 290 TransitionsAfterwards, 4574 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1216.5ms, 210 PlacesBefore, 210 PlacesAfterwards, 294 TransitionsBefore, 294 TransitionsAfterwards, 4542 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1122.0ms, 211 PlacesBefore, 211 PlacesAfterwards, 250 TransitionsBefore, 250 TransitionsAfterwards, 3940 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1091.9ms, 214 PlacesBefore, 214 PlacesAfterwards, 252 TransitionsBefore, 252 TransitionsAfterwards, 3832 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1121.4ms, 216 PlacesBefore, 216 PlacesAfterwards, 267 TransitionsBefore, 267 TransitionsAfterwards, 3942 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1168.7ms, 218 PlacesBefore, 218 PlacesAfterwards, 282 TransitionsBefore, 282 TransitionsAfterwards, 3944 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1184.0ms, 224 PlacesBefore, 224 PlacesAfterwards, 284 TransitionsBefore, 284 TransitionsAfterwards, 3884 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1295.1ms, 231 PlacesBefore, 231 PlacesAfterwards, 293 TransitionsBefore, 293 TransitionsAfterwards, 4070 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 948.4ms, 225 PlacesBefore, 225 PlacesAfterwards, 279 TransitionsBefore, 279 TransitionsAfterwards, 3492 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1304.0ms, 233 PlacesBefore, 233 PlacesAfterwards, 299 TransitionsBefore, 299 TransitionsAfterwards, 3666 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1185.4ms, 232 PlacesBefore, 223 PlacesAfterwards, 289 TransitionsBefore, 289 TransitionsAfterwards, 3574 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 965.4ms, 219 PlacesBefore, 207 PlacesAfterwards, 270 TransitionsBefore, 270 TransitionsAfterwards, 3382 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 856.0ms, 203 PlacesBefore, 194 PlacesAfterwards, 235 TransitionsBefore, 235 TransitionsAfterwards, 3158 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 605.5ms, 187 PlacesBefore, 177 PlacesAfterwards, 212 TransitionsBefore, 212 TransitionsAfterwards, 2970 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 422.1ms, 175 PlacesBefore, 165 PlacesAfterwards, 197 TransitionsBefore, 197 TransitionsAfterwards, 2786 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 402.6ms, 162 PlacesBefore, 160 PlacesAfterwards, 203 TransitionsBefore, 203 TransitionsAfterwards, 2772 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 391.6ms, 166 PlacesBefore, 162 PlacesAfterwards, 195 TransitionsBefore, 195 TransitionsAfterwards, 2764 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 778.3ms, 167 PlacesBefore, 167 PlacesAfterwards, 226 TransitionsBefore, 226 TransitionsAfterwards, 3130 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 524.1ms, 177 PlacesBefore, 175 PlacesAfterwards, 199 TransitionsBefore, 199 TransitionsAfterwards, 2904 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 458.8ms, 180 PlacesBefore, 177 PlacesAfterwards, 245 TransitionsBefore, 245 TransitionsAfterwards, 3416 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 284.0ms, 176 PlacesBefore, 160 PlacesAfterwards, 203 TransitionsBefore, 203 TransitionsAfterwards, 2966 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 94.6ms, 144 PlacesBefore, 138 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 1656 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 68.0ms, 124 PlacesBefore, 122 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 1364 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.2ms, 120 PlacesBefore, 119 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 1204 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5ms, 104 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): 3374, Positive cache size: 3363, Positive conditional cache size: 0, Positive unconditional cache size: 3363, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - 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.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 210730.2ms, OverallIterations: 53, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 165966.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4346.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1440 SDtfs, 2767 SDslu, 3239 SDs, 0 SdLazy, 12076 SolverSat, 1181 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6741.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 660 GetRequests, 53 SyntacticMatches, 16 SemanticMatches, 591 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 10573.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=6541occurred in iteration=38, InterpolantAutomatonStates: 431, 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.2ms SsaConstructionTime, 390.2ms SatisfiabilityAnalysisTime, 5523.6ms InterpolantComputationTime, 1007 NumberOfCodeBlocks, 1007 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 954 ConstructedInterpolants, 0 QuantifiedInterpolants, 14118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 53 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...