/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-wmm/mix046_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:34:27,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:34:27,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:34:27,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:34:27,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:34:27,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:34:27,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:34:27,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:34:27,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:34:27,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:34:27,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:34:27,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:34:27,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:34:27,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:34:27,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:34:27,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:34:27,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:34:27,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:34:27,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:34:27,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:34:27,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:34:27,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:34:27,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:34:27,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:34:27,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:34:27,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:34:27,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:34:27,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:34:27,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:34:27,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:34:27,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:34:27,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:34:27,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:34:27,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:34:27,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:34:27,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:34:27,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:34:27,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:34:27,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:34:27,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:34:27,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:34:27,728 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 14:34:27,756 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:34:27,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:34:27,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:34:27,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:34:27,758 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:34:27,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:34:27,758 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:34:27,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:34:27,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:34:27,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:34:27,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:34:27,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:34:27,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:34:27,759 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:34:27,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:34:27,759 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:34:27,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:34:27,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:34:27,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:34:27,760 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:34:27,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:34:27,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:34:27,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:34:27,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:34:27,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:34:27,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:34:27,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:34:27,761 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:34:27,761 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:34:27,761 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:34:28,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:34:28,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:34:28,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:34:28,071 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:34:28,072 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:34:28,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2021-03-25 14:34:28,131 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/933f8af9b/8314ef53df0e45019495eae3109252ad/FLAGb4ee19888 [2021-03-25 14:34:28,738 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:34:28,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2021-03-25 14:34:28,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/933f8af9b/8314ef53df0e45019495eae3109252ad/FLAGb4ee19888 [2021-03-25 14:34:29,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/933f8af9b/8314ef53df0e45019495eae3109252ad [2021-03-25 14:34:29,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:34:29,133 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:34:29,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:34:29,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:34:29,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:34:29,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:34:29" (1/1) ... [2021-03-25 14:34:29,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b83a7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:29, skipping insertion in model container [2021-03-25 14:34:29,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:34:29" (1/1) ... [2021-03-25 14:34:29,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:34:29,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:34:29,339 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-wmm/mix046_power.opt.i[950,963] [2021-03-25 14:34:29,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:34:29,560 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:34:29,570 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-wmm/mix046_power.opt.i[950,963] [2021-03-25 14:34:29,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:34:29,694 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:34:29,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:29 WrapperNode [2021-03-25 14:34:29,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:34:29,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:34:29,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:34:29,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:34:29,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:29" (1/1) ... [2021-03-25 14:34:29,733 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:29" (1/1) ... [2021-03-25 14:34:29,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:34:29,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:34:29,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:34:29,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:34:29,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:29" (1/1) ... [2021-03-25 14:34:29,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:29" (1/1) ... [2021-03-25 14:34:29,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:29" (1/1) ... [2021-03-25 14:34:29,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:29" (1/1) ... [2021-03-25 14:34:29,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:29" (1/1) ... [2021-03-25 14:34:29,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:29" (1/1) ... [2021-03-25 14:34:29,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:29" (1/1) ... [2021-03-25 14:34:29,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:34:29,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:34:29,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:34:29,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:34:29,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:34:29,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:34:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:34:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:34:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:34:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:34:29,908 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:34:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:34:29,909 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:34:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:34:29,909 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:34:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:34:29,910 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:34:29,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:34:29,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:34:29,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:34:29,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:34:29,912 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:34:31,469 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:34:31,470 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:34:31,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:34:31 BoogieIcfgContainer [2021-03-25 14:34:31,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:34:31,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:34:31,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:34:31,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:34:31,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:34:29" (1/3) ... [2021-03-25 14:34:31,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392ec4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:34:31, skipping insertion in model container [2021-03-25 14:34:31,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:29" (2/3) ... [2021-03-25 14:34:31,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392ec4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:34:31, skipping insertion in model container [2021-03-25 14:34:31,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:34:31" (3/3) ... [2021-03-25 14:34:31,477 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_power.opt.i [2021-03-25 14:34:31,482 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:34:31,490 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:34:31,491 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:34:31,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,522 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,522 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,523 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,523 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,524 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,524 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,524 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,524 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,525 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,529 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,529 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,529 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,529 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,530 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,530 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,530 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,530 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,535 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,535 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,536 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,537 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,538 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,538 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,540 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,540 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,540 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,540 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,540 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,540 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,541 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,541 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,541 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,541 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,541 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,541 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:31,542 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:34:31,557 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:34:31,574 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:34:31,575 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:34:31,575 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:34:31,575 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:34:31,575 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:34:31,575 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:34:31,575 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:34:31,575 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:34:31,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 14:34:31,620 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:34:31,621 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:34:31,625 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 14:34:31,625 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 14:34:31,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-25 14:34:31,630 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:31,640 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 14:34:31,642 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 14:34:31,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-25 14:34:31,663 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:34:31,663 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:34:31,664 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 14:34:31,666 INFO L142 LiptonReduction]: Number of co-enabled transitions 2598 [2021-03-25 14:34:33,166 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:34:33,592 WARN L205 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-25 14:34:33,772 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 14:34:34,510 WARN L205 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-25 14:34:34,827 WARN L205 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 14:34:36,283 WARN L205 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-25 14:34:36,878 WARN L205 SmtUtils]: Spent 593.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 14:34:38,529 WARN L205 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 189 [2021-03-25 14:34:38,819 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 14:34:39,503 WARN L205 SmtUtils]: Spent 680.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 14:34:40,083 WARN L205 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 14:34:40,303 INFO L154 LiptonReduction]: Checked pairs total: 4166 [2021-03-25 14:34:40,303 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-25 14:34:40,305 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8676 [2021-03-25 14:34:40,314 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-25 14:34:40,314 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:34:40,314 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:40,314 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:40,315 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:40,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:40,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1459371111, now seen corresponding path program 1 times [2021-03-25 14:34:40,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:40,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967683476] [2021-03-25 14:34:40,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:40,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:40,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:40,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:40,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:40,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967683476] [2021-03-25 14:34:40,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:40,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:34:40,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033432450] [2021-03-25 14:34:40,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:34:40,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:40,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:34:40,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:34:40,581 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 191 [2021-03-25 14:34:40,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:40,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:40,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 191 [2021-03-25 14:34:40,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:40,645 INFO L129 PetriNetUnfolder]: 23/111 cut-off events. [2021-03-25 14:34:40,646 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:34:40,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 111 events. 23/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 394 event pairs, 3 based on Foata normal form. 6/110 useless extension candidates. Maximal degree in co-relation 148. Up to 37 conditions per place. [2021-03-25 14:34:40,647 INFO L132 encePairwiseOnDemand]: 187/191 looper letters, 7 selfloop transitions, 2 changer transitions 5/49 dead transitions. [2021-03-25 14:34:40,648 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 132 flow [2021-03-25 14:34:40,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:34:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:34:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2021-03-25 14:34:40,660 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9144851657940664 [2021-03-25 14:34:40,661 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2021-03-25 14:34:40,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2021-03-25 14:34:40,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:40,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2021-03-25 14:34:40,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:40,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:40,675 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:40,677 INFO L185 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 3 states and 524 transitions. [2021-03-25 14:34:40,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 132 flow [2021-03-25 14:34:40,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:34:40,681 INFO L241 Difference]: Finished difference. Result has 56 places, 41 transitions, 94 flow [2021-03-25 14:34:40,682 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2021-03-25 14:34:40,683 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2021-03-25 14:34:40,683 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:40,683 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 41 transitions, 94 flow [2021-03-25 14:34:40,683 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 41 transitions, 94 flow [2021-03-25 14:34:40,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 94 flow [2021-03-25 14:34:40,689 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-25 14:34:40,690 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:34:40,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:34:40,690 INFO L142 LiptonReduction]: Number of co-enabled transitions 392 [2021-03-25 14:34:41,073 WARN L205 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-25 14:34:41,366 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-25 14:34:42,652 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 270 DAG size of output: 269 [2021-03-25 14:34:43,278 WARN L205 SmtUtils]: Spent 624.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 14:34:44,457 INFO L154 LiptonReduction]: Checked pairs total: 1274 [2021-03-25 14:34:44,457 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 14:34:44,457 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3774 [2021-03-25 14:34:44,459 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-25 14:34:44,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:44,459 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:44,459 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, 1, 1] [2021-03-25 14:34:44,459 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:34:44,460 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:44,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:44,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1826671133, now seen corresponding path program 1 times [2021-03-25 14:34:44,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:44,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392108878] [2021-03-25 14:34:44,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:44,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:44,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:44,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:44,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:44,643 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:34:44,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:34:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:44,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392108878] [2021-03-25 14:34:44,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:44,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:34:44,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606814975] [2021-03-25 14:34:44,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:34:44,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:44,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:34:44,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:34:44,655 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 203 [2021-03-25 14:34:44,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:44,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:44,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 203 [2021-03-25 14:34:44,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:44,678 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-25 14:34:44,678 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:34:44,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 29 events. 0/29 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 1/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:34:44,679 INFO L132 encePairwiseOnDemand]: 200/203 looper letters, 1 selfloop transitions, 2 changer transitions 1/29 dead transitions. [2021-03-25 14:34:44,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 29 transitions, 76 flow [2021-03-25 14:34:44,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:34:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:34:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2021-03-25 14:34:44,682 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8883415435139573 [2021-03-25 14:34:44,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2021-03-25 14:34:44,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2021-03-25 14:34:44,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:44,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2021-03-25 14:34:44,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:44,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:44,687 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:44,688 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 541 transitions. [2021-03-25 14:34:44,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 29 transitions, 76 flow [2021-03-25 14:34:44,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:34:44,689 INFO L241 Difference]: Finished difference. Result has 41 places, 28 transitions, 72 flow [2021-03-25 14:34:44,689 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2021-03-25 14:34:44,690 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -19 predicate places. [2021-03-25 14:34:44,690 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:44,691 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 72 flow [2021-03-25 14:34:44,691 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 72 flow [2021-03-25 14:34:44,692 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 72 flow [2021-03-25 14:34:44,696 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-25 14:34:44,696 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:34:44,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:34:44,697 INFO L142 LiptonReduction]: Number of co-enabled transitions 304 [2021-03-25 14:34:45,520 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 14:34:45,679 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:34:46,082 WARN L205 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 14:34:46,287 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:34:46,291 INFO L154 LiptonReduction]: Checked pairs total: 1047 [2021-03-25 14:34:46,291 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:34:46,291 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1601 [2021-03-25 14:34:46,292 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2021-03-25 14:34:46,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:46,293 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:46,293 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:46,293 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:34:46,293 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:46,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash 504597834, now seen corresponding path program 1 times [2021-03-25 14:34:46,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:46,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435242086] [2021-03-25 14:34:46,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:46,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:46,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:46,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:46,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:34:46,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:46,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:34:46,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:46,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:34:46,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:46,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:34:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:46,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435242086] [2021-03-25 14:34:46,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:46,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:34:46,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135554462] [2021-03-25 14:34:46,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:34:46,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:46,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:34:46,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:34:46,445 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 206 [2021-03-25 14:34:46,446 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:46,446 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:46,446 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 206 [2021-03-25 14:34:46,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:46,576 INFO L129 PetriNetUnfolder]: 102/213 cut-off events. [2021-03-25 14:34:46,577 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-03-25 14:34:46,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 213 events. 102/213 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 920 event pairs, 56 based on Foata normal form. 2/207 useless extension candidates. Maximal degree in co-relation 433. Up to 165 conditions per place. [2021-03-25 14:34:46,579 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 9 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2021-03-25 14:34:46,580 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 131 flow [2021-03-25 14:34:46,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:34:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:34:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 837 transitions. [2021-03-25 14:34:46,583 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8126213592233009 [2021-03-25 14:34:46,583 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 837 transitions. [2021-03-25 14:34:46,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 837 transitions. [2021-03-25 14:34:46,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:46,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 837 transitions. [2021-03-25 14:34:46,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:46,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:46,588 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:46,588 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 5 states and 837 transitions. [2021-03-25 14:34:46,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 131 flow [2021-03-25 14:34:46,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 36 transitions, 125 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:34:46,590 INFO L241 Difference]: Finished difference. Result has 42 places, 35 transitions, 134 flow [2021-03-25 14:34:46,590 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2021-03-25 14:34:46,590 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -18 predicate places. [2021-03-25 14:34:46,590 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:46,591 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 35 transitions, 134 flow [2021-03-25 14:34:46,591 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 134 flow [2021-03-25 14:34:46,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 134 flow [2021-03-25 14:34:46,602 INFO L129 PetriNetUnfolder]: 21/102 cut-off events. [2021-03-25 14:34:46,602 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-03-25 14:34:46,603 INFO L84 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 102 events. 21/102 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 419 event pairs, 4 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 188. Up to 36 conditions per place. [2021-03-25 14:34:46,604 INFO L142 LiptonReduction]: Number of co-enabled transitions 408 [2021-03-25 14:34:46,720 INFO L154 LiptonReduction]: Checked pairs total: 398 [2021-03-25 14:34:46,720 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:46,720 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 130 [2021-03-25 14:34:46,721 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 134 flow [2021-03-25 14:34:46,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:46,729 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:46,730 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:46,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:34:46,730 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:46,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:46,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1641857895, now seen corresponding path program 1 times [2021-03-25 14:34:46,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:46,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343884391] [2021-03-25 14:34:46,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:46,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:46,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:46,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-03-25 14:34:46,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343884391] [2021-03-25 14:34:46,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:46,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:34:46,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958741739] [2021-03-25 14:34:46,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:34:46,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:46,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:34:46,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:34:46,821 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 206 [2021-03-25 14:34:46,822 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:46,822 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:46,822 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 206 [2021-03-25 14:34:46,822 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:46,849 INFO L129 PetriNetUnfolder]: 26/104 cut-off events. [2021-03-25 14:34:46,849 INFO L130 PetriNetUnfolder]: For 71/74 co-relation queries the response was YES. [2021-03-25 14:34:46,851 INFO L84 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 104 events. 26/104 cut-off events. For 71/74 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 394 event pairs, 8 based on Foata normal form. 4/101 useless extension candidates. Maximal degree in co-relation 226. Up to 37 conditions per place. [2021-03-25 14:34:46,852 INFO L132 encePairwiseOnDemand]: 202/206 looper letters, 4 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2021-03-25 14:34:46,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 164 flow [2021-03-25 14:34:46,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:34:46,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:34:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2021-03-25 14:34:46,855 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9142394822006472 [2021-03-25 14:34:46,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 565 transitions. [2021-03-25 14:34:46,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 565 transitions. [2021-03-25 14:34:46,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:46,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 565 transitions. [2021-03-25 14:34:46,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:46,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:46,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:46,859 INFO L185 Difference]: Start difference. First operand has 42 places, 35 transitions, 134 flow. Second operand 3 states and 565 transitions. [2021-03-25 14:34:46,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 164 flow [2021-03-25 14:34:46,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 14:34:46,866 INFO L241 Difference]: Finished difference. Result has 45 places, 37 transitions, 169 flow [2021-03-25 14:34:46,866 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2021-03-25 14:34:46,866 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -15 predicate places. [2021-03-25 14:34:46,866 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:46,866 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 37 transitions, 169 flow [2021-03-25 14:34:46,867 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 37 transitions, 169 flow [2021-03-25 14:34:46,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 37 transitions, 169 flow [2021-03-25 14:34:46,886 INFO L129 PetriNetUnfolder]: 31/111 cut-off events. [2021-03-25 14:34:46,886 INFO L130 PetriNetUnfolder]: For 87/90 co-relation queries the response was YES. [2021-03-25 14:34:46,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 111 events. 31/111 cut-off events. For 87/90 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 470 event pairs, 5 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 268. Up to 40 conditions per place. [2021-03-25 14:34:46,891 INFO L142 LiptonReduction]: Number of co-enabled transitions 436 [2021-03-25 14:34:46,983 INFO L154 LiptonReduction]: Checked pairs total: 365 [2021-03-25 14:34:46,983 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:46,983 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 117 [2021-03-25 14:34:46,984 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 169 flow [2021-03-25 14:34:46,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:46,984 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:46,984 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:46,984 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:34:46,985 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:46,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:46,985 INFO L82 PathProgramCache]: Analyzing trace with hash -678100871, now seen corresponding path program 1 times [2021-03-25 14:34:46,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:46,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432123541] [2021-03-25 14:34:46,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:47,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:47,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:34:47,088 INFO L142 QuantifierPusher]: treesize reduction 28, result has 22.2 percent of original size [2021-03-25 14:34:47,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 14:34:47,100 INFO L142 QuantifierPusher]: treesize reduction 28, result has 28.2 percent of original size [2021-03-25 14:34:47,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 14:34:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:47,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432123541] [2021-03-25 14:34:47,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:47,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:34:47,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275683872] [2021-03-25 14:34:47,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:34:47,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:47,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:34:47,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:34:47,112 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 206 [2021-03-25 14:34:47,113 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:47,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:47,114 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 206 [2021-03-25 14:34:47,114 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:47,201 INFO L129 PetriNetUnfolder]: 69/173 cut-off events. [2021-03-25 14:34:47,201 INFO L130 PetriNetUnfolder]: For 238/241 co-relation queries the response was YES. [2021-03-25 14:34:47,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 173 events. 69/173 cut-off events. For 238/241 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 752 event pairs, 8 based on Foata normal form. 7/176 useless extension candidates. Maximal degree in co-relation 486. Up to 68 conditions per place. [2021-03-25 14:34:47,203 INFO L132 encePairwiseOnDemand]: 200/206 looper letters, 12 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2021-03-25 14:34:47,204 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 241 flow [2021-03-25 14:34:47,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:34:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:34:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 668 transitions. [2021-03-25 14:34:47,206 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8106796116504854 [2021-03-25 14:34:47,207 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 668 transitions. [2021-03-25 14:34:47,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 668 transitions. [2021-03-25 14:34:47,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:47,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 668 transitions. [2021-03-25 14:34:47,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:47,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:47,211 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:47,211 INFO L185 Difference]: Start difference. First operand has 45 places, 37 transitions, 169 flow. Second operand 4 states and 668 transitions. [2021-03-25 14:34:47,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 241 flow [2021-03-25 14:34:47,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 228 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:34:47,214 INFO L241 Difference]: Finished difference. Result has 48 places, 41 transitions, 206 flow [2021-03-25 14:34:47,214 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2021-03-25 14:34:47,214 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -12 predicate places. [2021-03-25 14:34:47,214 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:47,215 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 41 transitions, 206 flow [2021-03-25 14:34:47,215 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 41 transitions, 206 flow [2021-03-25 14:34:47,215 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 41 transitions, 206 flow [2021-03-25 14:34:47,233 INFO L129 PetriNetUnfolder]: 51/146 cut-off events. [2021-03-25 14:34:47,233 INFO L130 PetriNetUnfolder]: For 170/180 co-relation queries the response was YES. [2021-03-25 14:34:47,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 146 events. 51/146 cut-off events. For 170/180 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 642 event pairs, 9 based on Foata normal form. 4/138 useless extension candidates. Maximal degree in co-relation 408. Up to 54 conditions per place. [2021-03-25 14:34:47,235 INFO L142 LiptonReduction]: Number of co-enabled transitions 488 [2021-03-25 14:34:47,239 INFO L154 LiptonReduction]: Checked pairs total: 390 [2021-03-25 14:34:47,240 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:47,240 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-03-25 14:34:47,241 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 206 flow [2021-03-25 14:34:47,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:47,241 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:47,241 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:47,241 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:34:47,242 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:47,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:47,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1467186196, now seen corresponding path program 1 times [2021-03-25 14:34:47,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:47,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723332424] [2021-03-25 14:34:47,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:47,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:47,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:34:47,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:47,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 14:34:47,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:47,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:34:47,408 INFO L142 QuantifierPusher]: treesize reduction 10, result has 67.7 percent of original size [2021-03-25 14:34:47,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:34:47,427 INFO L142 QuantifierPusher]: treesize reduction 10, result has 60.0 percent of original size [2021-03-25 14:34:47,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 14:34:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:47,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723332424] [2021-03-25 14:34:47,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:47,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:34:47,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989464928] [2021-03-25 14:34:47,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:34:47,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:47,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:34:47,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:34:47,448 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 206 [2021-03-25 14:34:47,449 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 160.85714285714286) internal successors, (1126), 7 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:47,449 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:47,449 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 206 [2021-03-25 14:34:47,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:47,625 INFO L129 PetriNetUnfolder]: 76/192 cut-off events. [2021-03-25 14:34:47,625 INFO L130 PetriNetUnfolder]: For 308/316 co-relation queries the response was YES. [2021-03-25 14:34:47,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 192 events. 76/192 cut-off events. For 308/316 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 854 event pairs, 4 based on Foata normal form. 5/192 useless extension candidates. Maximal degree in co-relation 649. Up to 73 conditions per place. [2021-03-25 14:34:47,629 INFO L132 encePairwiseOnDemand]: 200/206 looper letters, 15 selfloop transitions, 13 changer transitions 0/53 dead transitions. [2021-03-25 14:34:47,629 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 334 flow [2021-03-25 14:34:47,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:34:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:34:47,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 818 transitions. [2021-03-25 14:34:47,633 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7941747572815534 [2021-03-25 14:34:47,659 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 818 transitions. [2021-03-25 14:34:47,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 818 transitions. [2021-03-25 14:34:47,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:47,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 818 transitions. [2021-03-25 14:34:47,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 163.6) internal successors, (818), 5 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:47,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:47,663 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:47,663 INFO L185 Difference]: Start difference. First operand has 48 places, 41 transitions, 206 flow. Second operand 5 states and 818 transitions. [2021-03-25 14:34:47,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 334 flow [2021-03-25 14:34:47,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:34:47,666 INFO L241 Difference]: Finished difference. Result has 53 places, 48 transitions, 298 flow [2021-03-25 14:34:47,666 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=298, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2021-03-25 14:34:47,666 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2021-03-25 14:34:47,666 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:47,667 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 48 transitions, 298 flow [2021-03-25 14:34:47,667 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 48 transitions, 298 flow [2021-03-25 14:34:47,667 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 48 transitions, 298 flow [2021-03-25 14:34:47,687 INFO L129 PetriNetUnfolder]: 58/159 cut-off events. [2021-03-25 14:34:47,687 INFO L130 PetriNetUnfolder]: For 355/364 co-relation queries the response was YES. [2021-03-25 14:34:47,688 INFO L84 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 159 events. 58/159 cut-off events. For 355/364 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 703 event pairs, 8 based on Foata normal form. 3/156 useless extension candidates. Maximal degree in co-relation 533. Up to 56 conditions per place. [2021-03-25 14:34:47,690 INFO L142 LiptonReduction]: Number of co-enabled transitions 570 [2021-03-25 14:34:47,696 INFO L154 LiptonReduction]: Checked pairs total: 623 [2021-03-25 14:34:47,696 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:47,696 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-03-25 14:34:47,697 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 298 flow [2021-03-25 14:34:47,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 160.85714285714286) internal successors, (1126), 7 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:47,697 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:47,698 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:47,698 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:34:47,698 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:47,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:47,698 INFO L82 PathProgramCache]: Analyzing trace with hash 451356058, now seen corresponding path program 2 times [2021-03-25 14:34:47,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:47,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783574798] [2021-03-25 14:34:47,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:47,808 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 14:34:47,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 14:34:47,839 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-25 14:34:47,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 14:34:47,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:47,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:34:47,894 INFO L142 QuantifierPusher]: treesize reduction 26, result has 61.2 percent of original size [2021-03-25 14:34:47,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 14:34:47,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:47,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:34:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:47,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783574798] [2021-03-25 14:34:47,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:47,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:34:47,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947854474] [2021-03-25 14:34:47,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:34:47,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:47,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:34:47,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:34:47,942 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 206 [2021-03-25 14:34:47,943 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 298 flow. Second operand has 7 states, 7 states have (on average 160.85714285714286) internal successors, (1126), 7 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:47,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:47,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 206 [2021-03-25 14:34:47,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:48,064 INFO L129 PetriNetUnfolder]: 86/220 cut-off events. [2021-03-25 14:34:48,065 INFO L130 PetriNetUnfolder]: For 621/628 co-relation queries the response was YES. [2021-03-25 14:34:48,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 220 events. 86/220 cut-off events. For 621/628 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1086 event pairs, 8 based on Foata normal form. 6/221 useless extension candidates. Maximal degree in co-relation 862. Up to 106 conditions per place. [2021-03-25 14:34:48,067 INFO L132 encePairwiseOnDemand]: 200/206 looper letters, 20 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2021-03-25 14:34:48,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 421 flow [2021-03-25 14:34:48,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:34:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:34:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 816 transitions. [2021-03-25 14:34:48,071 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7922330097087379 [2021-03-25 14:34:48,071 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 816 transitions. [2021-03-25 14:34:48,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 816 transitions. [2021-03-25 14:34:48,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:48,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 816 transitions. [2021-03-25 14:34:48,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 163.2) internal successors, (816), 5 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:48,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:48,075 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:48,075 INFO L185 Difference]: Start difference. First operand has 53 places, 48 transitions, 298 flow. Second operand 5 states and 816 transitions. [2021-03-25 14:34:48,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 421 flow [2021-03-25 14:34:48,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 399 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-03-25 14:34:48,079 INFO L241 Difference]: Finished difference. Result has 57 places, 53 transitions, 358 flow [2021-03-25 14:34:48,079 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2021-03-25 14:34:48,080 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2021-03-25 14:34:48,080 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:48,080 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 53 transitions, 358 flow [2021-03-25 14:34:48,080 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 53 transitions, 358 flow [2021-03-25 14:34:48,081 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions, 358 flow [2021-03-25 14:34:48,105 INFO L129 PetriNetUnfolder]: 67/194 cut-off events. [2021-03-25 14:34:48,106 INFO L130 PetriNetUnfolder]: For 670/691 co-relation queries the response was YES. [2021-03-25 14:34:48,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 194 events. 67/194 cut-off events. For 670/691 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 990 event pairs, 6 based on Foata normal form. 13/200 useless extension candidates. Maximal degree in co-relation 684. Up to 73 conditions per place. [2021-03-25 14:34:48,109 INFO L142 LiptonReduction]: Number of co-enabled transitions 632 [2021-03-25 14:34:48,116 INFO L154 LiptonReduction]: Checked pairs total: 772 [2021-03-25 14:34:48,116 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:48,117 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-03-25 14:34:48,117 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 358 flow [2021-03-25 14:34:48,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 160.85714285714286) internal successors, (1126), 7 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:48,118 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:48,118 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:48,118 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:34:48,118 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:48,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:48,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1456145236, now seen corresponding path program 3 times [2021-03-25 14:34:48,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:48,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263817528] [2021-03-25 14:34:48,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:48,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:48,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:34:48,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:48,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:34:48,191 INFO L142 QuantifierPusher]: treesize reduction 25, result has 68.8 percent of original size [2021-03-25 14:34:48,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-03-25 14:34:48,222 INFO L142 QuantifierPusher]: treesize reduction 15, result has 50.0 percent of original size [2021-03-25 14:34:48,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 14:34:48,235 INFO L142 QuantifierPusher]: treesize reduction 15, result has 51.6 percent of original size [2021-03-25 14:34:48,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:34:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:48,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263817528] [2021-03-25 14:34:48,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:48,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:34:48,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298640848] [2021-03-25 14:34:48,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:34:48,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:48,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:34:48,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:34:48,257 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 206 [2021-03-25 14:34:48,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 358 flow. Second operand has 7 states, 7 states have (on average 161.85714285714286) internal successors, (1133), 7 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:48,258 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:48,258 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 206 [2021-03-25 14:34:48,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:48,406 INFO L129 PetriNetUnfolder]: 83/215 cut-off events. [2021-03-25 14:34:48,406 INFO L130 PetriNetUnfolder]: For 786/800 co-relation queries the response was YES. [2021-03-25 14:34:48,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 215 events. 83/215 cut-off events. For 786/800 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1044 event pairs, 8 based on Foata normal form. 11/221 useless extension candidates. Maximal degree in co-relation 861. Up to 72 conditions per place. [2021-03-25 14:34:48,409 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 13 selfloop transitions, 21 changer transitions 0/59 dead transitions. [2021-03-25 14:34:48,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 59 transitions, 467 flow [2021-03-25 14:34:48,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:34:48,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:34:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 822 transitions. [2021-03-25 14:34:48,413 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7980582524271844 [2021-03-25 14:34:48,413 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 822 transitions. [2021-03-25 14:34:48,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 822 transitions. [2021-03-25 14:34:48,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:48,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 822 transitions. [2021-03-25 14:34:48,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.4) internal successors, (822), 5 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:48,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:48,417 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:48,417 INFO L185 Difference]: Start difference. First operand has 57 places, 53 transitions, 358 flow. Second operand 5 states and 822 transitions. [2021-03-25 14:34:48,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 59 transitions, 467 flow [2021-03-25 14:34:48,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 59 transitions, 451 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 14:34:48,423 INFO L241 Difference]: Finished difference. Result has 61 places, 56 transitions, 432 flow [2021-03-25 14:34:48,423 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=432, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2021-03-25 14:34:48,423 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2021-03-25 14:34:48,423 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:48,423 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 56 transitions, 432 flow [2021-03-25 14:34:48,423 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 56 transitions, 432 flow [2021-03-25 14:34:48,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 56 transitions, 432 flow [2021-03-25 14:34:48,450 INFO L129 PetriNetUnfolder]: 64/191 cut-off events. [2021-03-25 14:34:48,450 INFO L130 PetriNetUnfolder]: For 914/935 co-relation queries the response was YES. [2021-03-25 14:34:48,451 INFO L84 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 191 events. 64/191 cut-off events. For 914/935 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 984 event pairs, 7 based on Foata normal form. 15/202 useless extension candidates. Maximal degree in co-relation 749. Up to 67 conditions per place. [2021-03-25 14:34:48,453 INFO L142 LiptonReduction]: Number of co-enabled transitions 668 [2021-03-25 14:34:48,660 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 14:34:49,054 WARN L205 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 14:34:49,167 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 14:34:49,182 INFO L154 LiptonReduction]: Checked pairs total: 1618 [2021-03-25 14:34:49,182 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:34:49,182 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 759 [2021-03-25 14:34:49,182 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 439 flow [2021-03-25 14:34:49,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 161.85714285714286) internal successors, (1133), 7 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:49,183 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:49,183 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:49,183 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:34:49,183 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:49,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1175280168, now seen corresponding path program 1 times [2021-03-25 14:34:49,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:49,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632767425] [2021-03-25 14:34:49,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:49,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:49,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:49,225 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:34:49,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:34:49,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:49,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:49,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:49,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632767425] [2021-03-25 14:34:49,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:49,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:34:49,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523177615] [2021-03-25 14:34:49,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:34:49,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:49,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:34:49,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:34:49,234 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 207 [2021-03-25 14:34:49,235 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 439 flow. Second operand has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:49,235 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:49,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 207 [2021-03-25 14:34:49,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:49,389 INFO L129 PetriNetUnfolder]: 374/737 cut-off events. [2021-03-25 14:34:49,389 INFO L130 PetriNetUnfolder]: For 3031/3396 co-relation queries the response was YES. [2021-03-25 14:34:49,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2573 conditions, 737 events. 374/737 cut-off events. For 3031/3396 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 4730 event pairs, 109 based on Foata normal form. 136/794 useless extension candidates. Maximal degree in co-relation 2548. Up to 389 conditions per place. [2021-03-25 14:34:49,397 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 15 selfloop transitions, 10 changer transitions 0/69 dead transitions. [2021-03-25 14:34:49,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 69 transitions, 515 flow [2021-03-25 14:34:49,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:34:49,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:34:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 882 transitions. [2021-03-25 14:34:49,400 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8521739130434782 [2021-03-25 14:34:49,400 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 882 transitions. [2021-03-25 14:34:49,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 882 transitions. [2021-03-25 14:34:49,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:49,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 882 transitions. [2021-03-25 14:34:49,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 176.4) internal successors, (882), 5 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:49,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:49,404 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:49,404 INFO L185 Difference]: Start difference. First operand has 61 places, 56 transitions, 439 flow. Second operand 5 states and 882 transitions. [2021-03-25 14:34:49,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 69 transitions, 515 flow [2021-03-25 14:34:49,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 477 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-03-25 14:34:49,411 INFO L241 Difference]: Finished difference. Result has 66 places, 65 transitions, 496 flow [2021-03-25 14:34:49,411 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=496, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2021-03-25 14:34:49,411 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 6 predicate places. [2021-03-25 14:34:49,411 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:49,411 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 65 transitions, 496 flow [2021-03-25 14:34:49,411 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 65 transitions, 496 flow [2021-03-25 14:34:49,412 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 65 transitions, 496 flow [2021-03-25 14:34:49,500 INFO L129 PetriNetUnfolder]: 391/762 cut-off events. [2021-03-25 14:34:49,500 INFO L130 PetriNetUnfolder]: For 2875/3171 co-relation queries the response was YES. [2021-03-25 14:34:49,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2979 conditions, 762 events. 391/762 cut-off events. For 2875/3171 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 5074 event pairs, 109 based on Foata normal form. 32/706 useless extension candidates. Maximal degree in co-relation 2952. Up to 438 conditions per place. [2021-03-25 14:34:49,513 INFO L142 LiptonReduction]: Number of co-enabled transitions 920 [2021-03-25 14:34:49,561 INFO L154 LiptonReduction]: Checked pairs total: 654 [2021-03-25 14:34:49,561 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:49,562 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 151 [2021-03-25 14:34:49,562 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 496 flow [2021-03-25 14:34:49,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:49,562 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:49,562 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:49,562 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:34:49,562 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:49,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:49,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1405663372, now seen corresponding path program 1 times [2021-03-25 14:34:49,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:49,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227625056] [2021-03-25 14:34:49,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:49,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:49,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:49,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:49,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:49,611 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:34:49,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:34:49,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:49,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:49,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227625056] [2021-03-25 14:34:49,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:49,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:34:49,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113935242] [2021-03-25 14:34:49,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:34:49,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:49,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:34:49,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:34:49,621 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 207 [2021-03-25 14:34:49,622 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 496 flow. Second operand has 5 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:49,622 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:49,622 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 207 [2021-03-25 14:34:49,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:49,752 INFO L129 PetriNetUnfolder]: 245/545 cut-off events. [2021-03-25 14:34:49,752 INFO L130 PetriNetUnfolder]: For 3306/5106 co-relation queries the response was YES. [2021-03-25 14:34:49,755 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2383 conditions, 545 events. 245/545 cut-off events. For 3306/5106 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 3358 event pairs, 34 based on Foata normal form. 245/733 useless extension candidates. Maximal degree in co-relation 2354. Up to 330 conditions per place. [2021-03-25 14:34:49,758 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 14 selfloop transitions, 19 changer transitions 0/75 dead transitions. [2021-03-25 14:34:49,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 75 transitions, 610 flow [2021-03-25 14:34:49,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:34:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:34:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1235 transitions. [2021-03-25 14:34:49,762 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.852311939268461 [2021-03-25 14:34:49,762 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1235 transitions. [2021-03-25 14:34:49,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1235 transitions. [2021-03-25 14:34:49,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:49,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1235 transitions. [2021-03-25 14:34:49,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 176.42857142857142) internal successors, (1235), 7 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:49,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 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-03-25 14:34:49,768 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 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-03-25 14:34:49,768 INFO L185 Difference]: Start difference. First operand has 66 places, 65 transitions, 496 flow. Second operand 7 states and 1235 transitions. [2021-03-25 14:34:49,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 75 transitions, 610 flow [2021-03-25 14:34:49,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 75 transitions, 601 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 14:34:49,777 INFO L241 Difference]: Finished difference. Result has 74 places, 71 transitions, 609 flow [2021-03-25 14:34:49,778 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=609, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2021-03-25 14:34:49,778 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2021-03-25 14:34:49,778 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:49,778 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 71 transitions, 609 flow [2021-03-25 14:34:49,779 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 71 transitions, 609 flow [2021-03-25 14:34:49,779 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 71 transitions, 609 flow [2021-03-25 14:34:49,840 INFO L129 PetriNetUnfolder]: 256/559 cut-off events. [2021-03-25 14:34:49,840 INFO L130 PetriNetUnfolder]: For 2838/3590 co-relation queries the response was YES. [2021-03-25 14:34:49,844 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2729 conditions, 559 events. 256/559 cut-off events. For 2838/3590 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 3668 event pairs, 21 based on Foata normal form. 34/537 useless extension candidates. Maximal degree in co-relation 2698. Up to 350 conditions per place. [2021-03-25 14:34:49,849 INFO L142 LiptonReduction]: Number of co-enabled transitions 1110 [2021-03-25 14:34:49,865 INFO L154 LiptonReduction]: Checked pairs total: 673 [2021-03-25 14:34:49,865 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:49,866 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 88 [2021-03-25 14:34:49,868 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 609 flow [2021-03-25 14:34:49,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:49,869 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:49,869 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:49,869 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:34:49,869 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:49,869 INFO L82 PathProgramCache]: Analyzing trace with hash 586793918, now seen corresponding path program 1 times [2021-03-25 14:34:49,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:49,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848277971] [2021-03-25 14:34:49,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:49,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:49,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:49,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:49,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:49,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848277971] [2021-03-25 14:34:49,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:49,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:34:49,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937056229] [2021-03-25 14:34:49,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:34:49,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:49,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:34:49,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:34:49,921 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 207 [2021-03-25 14:34:49,921 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 609 flow. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:49,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:49,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 207 [2021-03-25 14:34:49,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:50,028 INFO L129 PetriNetUnfolder]: 392/828 cut-off events. [2021-03-25 14:34:50,029 INFO L130 PetriNetUnfolder]: For 4595/6313 co-relation queries the response was YES. [2021-03-25 14:34:50,034 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4124 conditions, 828 events. 392/828 cut-off events. For 4595/6313 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 5687 event pairs, 59 based on Foata normal form. 58/798 useless extension candidates. Maximal degree in co-relation 4091. Up to 559 conditions per place. [2021-03-25 14:34:50,039 INFO L132 encePairwiseOnDemand]: 204/207 looper letters, 5 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2021-03-25 14:34:50,039 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 631 flow [2021-03-25 14:34:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:34:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:34:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2021-03-25 14:34:50,041 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2021-03-25 14:34:50,042 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2021-03-25 14:34:50,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2021-03-25 14:34:50,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:50,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2021-03-25 14:34:50,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:50,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:50,045 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:50,045 INFO L185 Difference]: Start difference. First operand has 74 places, 71 transitions, 609 flow. Second operand 3 states and 567 transitions. [2021-03-25 14:34:50,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 631 flow [2021-03-25 14:34:50,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 71 transitions, 581 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-25 14:34:50,061 INFO L241 Difference]: Finished difference. Result has 74 places, 71 transitions, 579 flow [2021-03-25 14:34:50,061 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=579, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2021-03-25 14:34:50,062 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2021-03-25 14:34:50,062 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:50,062 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 71 transitions, 579 flow [2021-03-25 14:34:50,062 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 71 transitions, 579 flow [2021-03-25 14:34:50,063 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 71 transitions, 579 flow [2021-03-25 14:34:50,149 INFO L129 PetriNetUnfolder]: 384/819 cut-off events. [2021-03-25 14:34:50,150 INFO L130 PetriNetUnfolder]: For 4227/4530 co-relation queries the response was YES. [2021-03-25 14:34:50,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3630 conditions, 819 events. 384/819 cut-off events. For 4227/4530 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 5850 event pairs, 50 based on Foata normal form. 45/784 useless extension candidates. Maximal degree in co-relation 3599. Up to 475 conditions per place. [2021-03-25 14:34:50,162 INFO L142 LiptonReduction]: Number of co-enabled transitions 1110 [2021-03-25 14:34:50,193 INFO L154 LiptonReduction]: Checked pairs total: 661 [2021-03-25 14:34:50,193 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:50,193 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 131 [2021-03-25 14:34:50,193 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 579 flow [2021-03-25 14:34:50,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:50,194 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:50,194 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:50,194 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:34:50,194 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:50,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:50,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1074412524, now seen corresponding path program 1 times [2021-03-25 14:34:50,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:50,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983071469] [2021-03-25 14:34:50,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:50,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:50,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:50,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:50,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:50,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:50,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:50,301 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:34:50,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:34:50,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:50,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:50,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983071469] [2021-03-25 14:34:50,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:50,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:34:50,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42317426] [2021-03-25 14:34:50,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:34:50,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:50,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:34:50,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:34:50,313 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 207 [2021-03-25 14:34:50,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 579 flow. Second operand has 6 states, 6 states have (on average 172.83333333333334) internal successors, (1037), 6 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:50,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:50,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 207 [2021-03-25 14:34:50,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:50,485 INFO L129 PetriNetUnfolder]: 276/620 cut-off events. [2021-03-25 14:34:50,485 INFO L130 PetriNetUnfolder]: For 4631/7059 co-relation queries the response was YES. [2021-03-25 14:34:50,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 620 events. 276/620 cut-off events. For 4631/7059 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 4108 event pairs, 8 based on Foata normal form. 402/951 useless extension candidates. Maximal degree in co-relation 3012. Up to 370 conditions per place. [2021-03-25 14:34:50,492 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 8 selfloop transitions, 28 changer transitions 4/80 dead transitions. [2021-03-25 14:34:50,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 80 transitions, 732 flow [2021-03-25 14:34:50,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:34:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:34:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1588 transitions. [2021-03-25 14:34:50,497 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8523886205045625 [2021-03-25 14:34:50,497 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1588 transitions. [2021-03-25 14:34:50,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1588 transitions. [2021-03-25 14:34:50,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:50,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1588 transitions. [2021-03-25 14:34:50,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 176.44444444444446) internal successors, (1588), 9 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:50,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:50,505 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:50,505 INFO L185 Difference]: Start difference. First operand has 74 places, 71 transitions, 579 flow. Second operand 9 states and 1588 transitions. [2021-03-25 14:34:50,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 80 transitions, 732 flow [2021-03-25 14:34:50,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 80 transitions, 722 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 14:34:50,513 INFO L241 Difference]: Finished difference. Result has 84 places, 76 transitions, 702 flow [2021-03-25 14:34:50,513 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=702, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2021-03-25 14:34:50,513 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 24 predicate places. [2021-03-25 14:34:50,513 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:50,513 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 76 transitions, 702 flow [2021-03-25 14:34:50,514 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 76 transitions, 702 flow [2021-03-25 14:34:50,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 76 transitions, 702 flow [2021-03-25 14:34:50,576 INFO L129 PetriNetUnfolder]: 273/627 cut-off events. [2021-03-25 14:34:50,576 INFO L130 PetriNetUnfolder]: For 4304/4658 co-relation queries the response was YES. [2021-03-25 14:34:50,580 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3283 conditions, 627 events. 273/627 cut-off events. For 4304/4658 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 4402 event pairs, 4 based on Foata normal form. 23/571 useless extension candidates. Maximal degree in co-relation 3248. Up to 367 conditions per place. [2021-03-25 14:34:50,587 INFO L142 LiptonReduction]: Number of co-enabled transitions 1128 [2021-03-25 14:34:50,597 INFO L154 LiptonReduction]: Checked pairs total: 647 [2021-03-25 14:34:50,597 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:50,598 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 85 [2021-03-25 14:34:50,599 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 702 flow [2021-03-25 14:34:50,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 172.83333333333334) internal successors, (1037), 6 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:50,600 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:50,600 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:50,600 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:34:50,600 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:50,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:50,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1534059088, now seen corresponding path program 1 times [2021-03-25 14:34:50,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:50,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371591636] [2021-03-25 14:34:50,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:50,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:50,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:50,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:50,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:50,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:50,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:50,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:50,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:50,675 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:34:50,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:34:50,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:50,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:50,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371591636] [2021-03-25 14:34:50,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:50,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:34:50,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626832308] [2021-03-25 14:34:50,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:34:50,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:50,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:34:50,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:34:50,687 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 207 [2021-03-25 14:34:50,688 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 702 flow. Second operand has 7 states, 7 states have (on average 172.85714285714286) internal successors, (1210), 7 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:50,689 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:50,689 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 207 [2021-03-25 14:34:50,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:50,872 INFO L129 PetriNetUnfolder]: 241/550 cut-off events. [2021-03-25 14:34:50,873 INFO L130 PetriNetUnfolder]: For 5188/7621 co-relation queries the response was YES. [2021-03-25 14:34:50,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3271 conditions, 550 events. 241/550 cut-off events. For 5188/7621 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 3704 event pairs, 4 based on Foata normal form. 343/822 useless extension candidates. Maximal degree in co-relation 3234. Up to 322 conditions per place. [2021-03-25 14:34:50,882 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 2 selfloop transitions, 33 changer transitions 7/76 dead transitions. [2021-03-25 14:34:50,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 76 transitions, 766 flow [2021-03-25 14:34:50,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 14:34:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 14:34:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1933 transitions. [2021-03-25 14:34:50,887 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8489240228370664 [2021-03-25 14:34:50,887 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1933 transitions. [2021-03-25 14:34:50,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1933 transitions. [2021-03-25 14:34:50,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:50,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1933 transitions. [2021-03-25 14:34:50,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 175.72727272727272) internal successors, (1933), 11 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:50,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 207.0) internal successors, (2484), 12 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:50,908 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 207.0) internal successors, (2484), 12 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:50,908 INFO L185 Difference]: Start difference. First operand has 84 places, 76 transitions, 702 flow. Second operand 11 states and 1933 transitions. [2021-03-25 14:34:50,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 76 transitions, 766 flow [2021-03-25 14:34:50,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 76 transitions, 622 flow, removed 39 selfloop flow, removed 10 redundant places. [2021-03-25 14:34:50,926 INFO L241 Difference]: Finished difference. Result has 87 places, 69 transitions, 561 flow [2021-03-25 14:34:50,926 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=561, PETRI_PLACES=87, PETRI_TRANSITIONS=69} [2021-03-25 14:34:50,927 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 27 predicate places. [2021-03-25 14:34:50,927 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:50,927 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 69 transitions, 561 flow [2021-03-25 14:34:50,927 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 69 transitions, 561 flow [2021-03-25 14:34:50,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 69 transitions, 561 flow [2021-03-25 14:34:50,951 INFO L129 PetriNetUnfolder]: 110/268 cut-off events. [2021-03-25 14:34:50,951 INFO L130 PetriNetUnfolder]: For 1233/1410 co-relation queries the response was YES. [2021-03-25 14:34:50,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 268 events. 110/268 cut-off events. For 1233/1410 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 1524 event pairs, 1 based on Foata normal form. 5/240 useless extension candidates. Maximal degree in co-relation 1123. Up to 70 conditions per place. [2021-03-25 14:34:50,955 INFO L142 LiptonReduction]: Number of co-enabled transitions 968 [2021-03-25 14:34:51,159 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-03-25 14:34:51,337 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-25 14:34:51,491 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-25 14:34:52,200 WARN L205 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 196 [2021-03-25 14:34:52,467 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 14:34:53,956 WARN L205 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 350 DAG size of output: 278 [2021-03-25 14:34:54,570 WARN L205 SmtUtils]: Spent 612.00 ms on a formula simplification that was a NOOP. DAG size: 258 [2021-03-25 14:34:54,578 INFO L154 LiptonReduction]: Checked pairs total: 1701 [2021-03-25 14:34:54,578 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 14:34:54,579 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3652 [2021-03-25 14:34:54,579 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 63 transitions, 521 flow [2021-03-25 14:34:54,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 172.85714285714286) internal successors, (1210), 7 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:54,580 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:54,580 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, 1] [2021-03-25 14:34:54,580 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:34:54,580 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:54,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:54,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1536264958, now seen corresponding path program 1 times [2021-03-25 14:34:54,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:54,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383382306] [2021-03-25 14:34:54,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:54,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:54,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:54,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:54,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:54,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:54,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:54,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383382306] [2021-03-25 14:34:54,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:54,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:34:54,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027977630] [2021-03-25 14:34:54,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:34:54,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:54,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:34:54,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:34:54,630 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 209 [2021-03-25 14:34:54,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 63 transitions, 521 flow. Second operand has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:54,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:54,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 209 [2021-03-25 14:34:54,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:54,686 INFO L129 PetriNetUnfolder]: 79/194 cut-off events. [2021-03-25 14:34:54,686 INFO L130 PetriNetUnfolder]: For 3576/3734 co-relation queries the response was YES. [2021-03-25 14:34:54,687 INFO L84 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 194 events. 79/194 cut-off events. For 3576/3734 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 867 event pairs, 2 based on Foata normal form. 17/186 useless extension candidates. Maximal degree in co-relation 754. Up to 64 conditions per place. [2021-03-25 14:34:54,688 INFO L132 encePairwiseOnDemand]: 206/209 looper letters, 3 selfloop transitions, 1 changer transitions 1/52 dead transitions. [2021-03-25 14:34:54,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 52 transitions, 417 flow [2021-03-25 14:34:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:34:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:34:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions. [2021-03-25 14:34:54,691 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8827751196172249 [2021-03-25 14:34:54,691 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 738 transitions. [2021-03-25 14:34:54,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions. [2021-03-25 14:34:54,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:54,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions. [2021-03-25 14:34:54,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:54,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:54,695 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:54,695 INFO L185 Difference]: Start difference. First operand has 84 places, 63 transitions, 521 flow. Second operand 4 states and 738 transitions. [2021-03-25 14:34:54,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 52 transitions, 417 flow [2021-03-25 14:34:54,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 52 transitions, 321 flow, removed 30 selfloop flow, removed 14 redundant places. [2021-03-25 14:34:54,699 INFO L241 Difference]: Finished difference. Result has 65 places, 51 transitions, 316 flow [2021-03-25 14:34:54,700 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=316, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2021-03-25 14:34:54,700 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2021-03-25 14:34:54,700 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:54,700 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 51 transitions, 316 flow [2021-03-25 14:34:54,700 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 51 transitions, 316 flow [2021-03-25 14:34:54,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 51 transitions, 316 flow [2021-03-25 14:34:54,715 INFO L129 PetriNetUnfolder]: 66/176 cut-off events. [2021-03-25 14:34:54,716 INFO L130 PetriNetUnfolder]: For 741/788 co-relation queries the response was YES. [2021-03-25 14:34:54,717 INFO L84 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 176 events. 66/176 cut-off events. For 741/788 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 811 event pairs, 0 based on Foata normal form. 10/170 useless extension candidates. Maximal degree in co-relation 526. Up to 52 conditions per place. [2021-03-25 14:34:54,718 INFO L142 LiptonReduction]: Number of co-enabled transitions 470 [2021-03-25 14:34:54,808 INFO L154 LiptonReduction]: Checked pairs total: 396 [2021-03-25 14:34:54,808 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:34:54,809 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 109 [2021-03-25 14:34:54,809 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 320 flow [2021-03-25 14:34:54,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:54,809 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:54,809 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:54,809 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:34:54,810 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:54,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:54,810 INFO L82 PathProgramCache]: Analyzing trace with hash -342491361, now seen corresponding path program 1 times [2021-03-25 14:34:54,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:54,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940423594] [2021-03-25 14:34:54,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:54,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:54,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:54,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:54,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:54,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:54,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:54,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940423594] [2021-03-25 14:34:54,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:54,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:34:54,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127926677] [2021-03-25 14:34:54,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:34:54,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:54,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:34:54,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:34:54,869 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 212 [2021-03-25 14:34:54,870 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:54,870 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:54,870 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 212 [2021-03-25 14:34:54,870 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:54,909 INFO L129 PetriNetUnfolder]: 103/263 cut-off events. [2021-03-25 14:34:54,910 INFO L130 PetriNetUnfolder]: For 1517/1600 co-relation queries the response was YES. [2021-03-25 14:34:54,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 263 events. 103/263 cut-off events. For 1517/1600 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1351 event pairs, 3 based on Foata normal form. 21/259 useless extension candidates. Maximal degree in co-relation 804. Up to 76 conditions per place. [2021-03-25 14:34:54,912 INFO L132 encePairwiseOnDemand]: 209/212 looper letters, 3 selfloop transitions, 1 changer transitions 10/51 dead transitions. [2021-03-25 14:34:54,912 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 51 transitions, 332 flow [2021-03-25 14:34:54,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:34:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:34:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 754 transitions. [2021-03-25 14:34:54,914 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8891509433962265 [2021-03-25 14:34:54,914 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 754 transitions. [2021-03-25 14:34:54,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 754 transitions. [2021-03-25 14:34:54,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:54,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 754 transitions. [2021-03-25 14:34:54,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 188.5) internal successors, (754), 4 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:54,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:54,918 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:54,918 INFO L185 Difference]: Start difference. First operand has 63 places, 50 transitions, 320 flow. Second operand 4 states and 754 transitions. [2021-03-25 14:34:54,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 51 transitions, 332 flow [2021-03-25 14:34:54,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 51 transitions, 327 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:34:54,922 INFO L241 Difference]: Finished difference. Result has 66 places, 41 transitions, 248 flow [2021-03-25 14:34:54,922 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=66, PETRI_TRANSITIONS=41} [2021-03-25 14:34:54,922 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 6 predicate places. [2021-03-25 14:34:54,922 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:54,923 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 41 transitions, 248 flow [2021-03-25 14:34:54,923 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 41 transitions, 248 flow [2021-03-25 14:34:54,923 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 41 transitions, 248 flow [2021-03-25 14:34:54,934 INFO L129 PetriNetUnfolder]: 48/132 cut-off events. [2021-03-25 14:34:54,934 INFO L130 PetriNetUnfolder]: For 423/441 co-relation queries the response was YES. [2021-03-25 14:34:54,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 132 events. 48/132 cut-off events. For 423/441 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 550 event pairs, 0 based on Foata normal form. 4/126 useless extension candidates. Maximal degree in co-relation 395. Up to 44 conditions per place. [2021-03-25 14:34:54,936 INFO L142 LiptonReduction]: Number of co-enabled transitions 242 [2021-03-25 14:34:54,969 INFO L154 LiptonReduction]: Checked pairs total: 181 [2021-03-25 14:34:54,969 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:34:54,969 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 47 [2021-03-25 14:34:54,971 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 246 flow [2021-03-25 14:34:54,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:54,972 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:54,972 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:54,972 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 14:34:54,972 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:54,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:54,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1091190009, now seen corresponding path program 1 times [2021-03-25 14:34:54,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:54,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069197482] [2021-03-25 14:34:54,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:55,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:55,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:34:55,054 INFO L142 QuantifierPusher]: treesize reduction 15, result has 53.1 percent of original size [2021-03-25 14:34:55,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:34:55,071 INFO L142 QuantifierPusher]: treesize reduction 20, result has 73.7 percent of original size [2021-03-25 14:34:55,076 INFO L147 QuantifierPusher]: treesize reduction 5, result has 91.1 percent of original size 51 [2021-03-25 14:34:55,086 INFO L142 QuantifierPusher]: treesize reduction 25, result has 68.8 percent of original size [2021-03-25 14:34:55,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-03-25 14:34:55,115 INFO L142 QuantifierPusher]: treesize reduction 15, result has 50.0 percent of original size [2021-03-25 14:34:55,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 14:34:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:55,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069197482] [2021-03-25 14:34:55,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:55,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:34:55,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448279416] [2021-03-25 14:34:55,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:34:55,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:55,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:34:55,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:34:55,130 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 213 [2021-03-25 14:34:55,131 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:55,131 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:55,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 213 [2021-03-25 14:34:55,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:55,196 INFO L129 PetriNetUnfolder]: 69/175 cut-off events. [2021-03-25 14:34:55,196 INFO L130 PetriNetUnfolder]: For 1101/1156 co-relation queries the response was YES. [2021-03-25 14:34:55,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 175 events. 69/175 cut-off events. For 1101/1156 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 771 event pairs, 0 based on Foata normal form. 13/172 useless extension candidates. Maximal degree in co-relation 549. Up to 60 conditions per place. [2021-03-25 14:34:55,198 INFO L132 encePairwiseOnDemand]: 208/213 looper letters, 7 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2021-03-25 14:34:55,198 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 42 transitions, 283 flow [2021-03-25 14:34:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:34:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:34:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2021-03-25 14:34:55,201 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7830985915492957 [2021-03-25 14:34:55,201 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 834 transitions. [2021-03-25 14:34:55,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 834 transitions. [2021-03-25 14:34:55,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:55,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 834 transitions. [2021-03-25 14:34:55,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:55,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:55,206 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:55,206 INFO L185 Difference]: Start difference. First operand has 61 places, 40 transitions, 246 flow. Second operand 5 states and 834 transitions. [2021-03-25 14:34:55,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 42 transitions, 283 flow [2021-03-25 14:34:55,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 42 transitions, 258 flow, removed 8 selfloop flow, removed 9 redundant places. [2021-03-25 14:34:55,211 INFO L241 Difference]: Finished difference. Result has 57 places, 41 transitions, 247 flow [2021-03-25 14:34:55,211 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2021-03-25 14:34:55,211 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2021-03-25 14:34:55,211 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:55,211 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 41 transitions, 247 flow [2021-03-25 14:34:55,212 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 41 transitions, 247 flow [2021-03-25 14:34:55,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 41 transitions, 247 flow [2021-03-25 14:34:55,225 INFO L129 PetriNetUnfolder]: 69/175 cut-off events. [2021-03-25 14:34:55,225 INFO L130 PetriNetUnfolder]: For 317/333 co-relation queries the response was YES. [2021-03-25 14:34:55,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 175 events. 69/175 cut-off events. For 317/333 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 831 event pairs, 0 based on Foata normal form. 4/167 useless extension candidates. Maximal degree in co-relation 521. Up to 60 conditions per place. [2021-03-25 14:34:55,227 INFO L142 LiptonReduction]: Number of co-enabled transitions 192 [2021-03-25 14:34:55,283 INFO L154 LiptonReduction]: Checked pairs total: 22 [2021-03-25 14:34:55,284 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:34:55,284 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 73 [2021-03-25 14:34:55,285 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 253 flow [2021-03-25 14:34:55,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:55,285 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:55,285 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:55,285 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 14:34:55,285 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:55,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:55,286 INFO L82 PathProgramCache]: Analyzing trace with hash 927903500, now seen corresponding path program 1 times [2021-03-25 14:34:55,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:55,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729401969] [2021-03-25 14:34:55,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:34:55,321 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:34:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:34:55,349 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:34:55,391 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:34:55,391 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:34:55,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 14:34:55,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:34:55 BasicIcfg [2021-03-25 14:34:55,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:34:55,501 INFO L168 Benchmark]: Toolchain (without parser) took 26365.16 ms. Allocated memory was 255.9 MB in the beginning and 748.7 MB in the end (delta: 492.8 MB). Free memory was 235.0 MB in the beginning and 514.7 MB in the end (delta: -279.7 MB). Peak memory consumption was 212.5 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:55,501 INFO L168 Benchmark]: CDTParser took 0.79 ms. Allocated memory is still 255.9 MB. Free memory is still 238.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:34:55,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 562.82 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 235.0 MB in the beginning and 308.9 MB in the end (delta: -73.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:55,502 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.58 ms. Allocated memory is still 350.2 MB. Free memory was 308.9 MB in the beginning and 305.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:55,502 INFO L168 Benchmark]: Boogie Preprocessor took 52.53 ms. Allocated memory is still 350.2 MB. Free memory was 305.7 MB in the beginning and 303.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:55,502 INFO L168 Benchmark]: RCFGBuilder took 1641.93 ms. Allocated memory is still 350.2 MB. Free memory was 303.6 MB in the beginning and 231.8 MB in the end (delta: 71.8 MB). Peak memory consumption was 72.3 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:55,502 INFO L168 Benchmark]: TraceAbstraction took 24024.88 ms. Allocated memory was 350.2 MB in the beginning and 748.7 MB in the end (delta: 398.5 MB). Free memory was 231.8 MB in the beginning and 514.7 MB in the end (delta: -282.9 MB). Peak memory consumption was 116.6 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:55,503 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.79 ms. Allocated memory is still 255.9 MB. Free memory is still 238.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 562.82 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 235.0 MB in the beginning and 308.9 MB in the end (delta: -73.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 78.58 ms. Allocated memory is still 350.2 MB. Free memory was 308.9 MB in the beginning and 305.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 52.53 ms. Allocated memory is still 350.2 MB. Free memory was 305.7 MB in the beginning and 303.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1641.93 ms. Allocated memory is still 350.2 MB. Free memory was 303.6 MB in the beginning and 231.8 MB in the end (delta: 71.8 MB). Peak memory consumption was 72.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 24024.88 ms. Allocated memory was 350.2 MB in the beginning and 748.7 MB in the end (delta: 398.5 MB). Free memory was 231.8 MB in the beginning and 514.7 MB in the end (delta: -282.9 MB). Peak memory consumption was 116.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8660.6ms, 124 PlacesBefore, 60 PlacesAfterwards, 113 TransitionsBefore, 48 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 5 FixpointIterations, 28 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 4166 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2239, positive: 2147, positive conditional: 0, positive unconditional: 2147, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1654, positive: 1612, positive conditional: 0, positive unconditional: 1612, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1654, positive: 1612, positive conditional: 0, positive unconditional: 1612, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1654, positive: 1603, positive conditional: 0, positive unconditional: 1603, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 661, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 635, negative conditional: 0, negative unconditional: 635, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2239, positive: 535, positive conditional: 0, positive unconditional: 535, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 1654, unknown conditional: 0, unknown unconditional: 1654] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 163, Positive conditional cache size: 0, Positive unconditional cache size: 163, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3773.7ms, 56 PlacesBefore, 40 PlacesAfterwards, 41 TransitionsBefore, 29 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 3 FixpointIterations, 10 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1274 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 449, positive: 377, positive conditional: 0, positive unconditional: 377, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 79, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 79, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 344, positive: 96, positive conditional: 0, positive unconditional: 96, negative: 248, negative conditional: 0, negative unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 449, positive: 313, positive conditional: 0, positive unconditional: 313, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 79, unknown conditional: 0, unknown unconditional: 79] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1599.7ms, 41 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 25 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1047 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 399, positive: 333, positive conditional: 0, positive unconditional: 333, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 399, positive: 327, positive conditional: 0, positive unconditional: 327, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 179, Positive conditional cache size: 0, Positive unconditional cache size: 179, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 129.1ms, 42 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 398 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 124, positive: 104, positive conditional: 0, positive unconditional: 104, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 112, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 112, negative conditional: 0, negative unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, positive: 97, positive conditional: 0, positive unconditional: 97, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 186, Positive conditional cache size: 0, Positive unconditional cache size: 186, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 116.2ms, 45 PlacesBefore, 45 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 365 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 147, positive: 130, positive conditional: 0, positive unconditional: 130, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 147, positive: 125, positive conditional: 0, positive unconditional: 125, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 191, Positive conditional cache size: 0, Positive unconditional cache size: 191, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.9ms, 48 PlacesBefore, 48 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 390 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 167, positive: 151, positive conditional: 0, positive unconditional: 151, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 167, positive: 149, positive conditional: 0, positive unconditional: 149, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 193, Positive conditional cache size: 0, Positive unconditional cache size: 193, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.2ms, 53 PlacesBefore, 53 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 623 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 277, positive: 251, positive conditional: 0, positive unconditional: 251, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 277, positive: 248, positive conditional: 0, positive unconditional: 248, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 196, Positive conditional cache size: 0, Positive unconditional cache size: 196, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 36.4ms, 57 PlacesBefore, 57 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 632 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 772 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 365, positive: 333, positive conditional: 0, positive unconditional: 333, negative: 32, negative conditional: 0, negative unconditional: 32, 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: 365, positive: 333, positive conditional: 0, positive unconditional: 333, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 196, Positive conditional cache size: 0, Positive unconditional cache size: 196, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 758.4ms, 61 PlacesBefore, 61 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 668 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1618 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 742, positive: 676, positive conditional: 0, positive unconditional: 676, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 742, positive: 661, positive conditional: 0, positive unconditional: 661, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 209, Positive conditional cache size: 0, Positive unconditional cache size: 209, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 150.1ms, 66 PlacesBefore, 66 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 654 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 172, positive: 153, positive conditional: 0, positive unconditional: 153, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 172, positive: 150, positive conditional: 0, positive unconditional: 150, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 212, Positive conditional cache size: 0, Positive unconditional cache size: 212, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 86.7ms, 74 PlacesBefore, 74 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 673 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 187, positive: 170, positive conditional: 0, positive unconditional: 170, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 187, positive: 164, positive conditional: 0, positive unconditional: 164, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 218, Positive conditional cache size: 0, Positive unconditional cache size: 218, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 130.8ms, 74 PlacesBefore, 74 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 661 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 264, positive: 248, positive conditional: 0, positive unconditional: 248, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 264, positive: 247, positive conditional: 0, positive unconditional: 247, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 247, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 83.7ms, 84 PlacesBefore, 84 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 1128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 647 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 256, positive: 241, positive conditional: 0, positive unconditional: 241, negative: 15, negative conditional: 0, negative unconditional: 15, 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: 256, positive: 241, positive conditional: 0, positive unconditional: 241, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 247, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3651.3ms, 87 PlacesBefore, 84 PlacesAfterwards, 69 TransitionsBefore, 63 TransitionsAfterwards, 968 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 1701 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 499, positive: 454, positive conditional: 0, positive unconditional: 454, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 499, positive: 448, positive conditional: 0, positive unconditional: 448, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 186, Positive conditional cache size: 0, Positive unconditional cache size: 186, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 108.2ms, 65 PlacesBefore, 63 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 396 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 241, positive: 225, positive conditional: 0, positive unconditional: 225, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 241, positive: 224, positive conditional: 0, positive unconditional: 224, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 176, Positive conditional cache size: 0, Positive unconditional cache size: 176, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 46.0ms, 66 PlacesBefore, 61 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 181 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.9ms, 57 PlacesBefore, 57 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 22 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 0, positive unconditional: 22, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 22, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 135, Positive conditional cache size: 0, Positive unconditional cache size: 135, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1221; [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1222; [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1223; [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1224; [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 23821.2ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2095.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8734.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 54 SDtfs, 30 SDslu, 22 SDs, 0 SdLazy, 400 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 490.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 659.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=702occurred in iteration=12, InterpolantAutomatonStates: 81, 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: 50.1ms SsaConstructionTime, 528.0ms SatisfiabilityAnalysisTime, 1296.9ms InterpolantComputationTime, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 1874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...