/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_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:34:49,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:34:49,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:34:49,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:34:49,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:34:49,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:34:49,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:34:49,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:34:49,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:34:49,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:34:49,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:34:49,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:34:49,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:34:49,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:34:49,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:34:49,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:34:49,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:34:49,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:34:49,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:34:49,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:34:49,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:34:49,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:34:49,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:34:49,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:34:49,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:34:49,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:34:49,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:34:49,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:34:49,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:34:49,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:34:49,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:34:49,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:34:49,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:34:49,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:34:49,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:34:49,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:34:49,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:34:49,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:34:49,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:34:49,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:34:49,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:34:49,518 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:49,549 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:34:49,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:34:49,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:34:49,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:34:49,552 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:34:49,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:34:49,553 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:34:49,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:34:49,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:34:49,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:34:49,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:34:49,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:34:49,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:34:49,554 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:34:49,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:34:49,554 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:34:49,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:34:49,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:34:49,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:34:49,555 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:34:49,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:34:49,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:34:49,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:34:49,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:34:49,555 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:34:49,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:34:49,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:34:49,556 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:34:49,556 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:34:49,556 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:49,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:34:49,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:34:49,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:34:49,877 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:34:49,878 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:34:49,878 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_rmo.opt.i [2021-03-25 14:34:49,948 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5378663e7/e853cbe23a5649fdb5e891986e669759/FLAGb09a4d12d [2021-03-25 14:34:50,481 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:34:50,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_rmo.opt.i [2021-03-25 14:34:50,492 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5378663e7/e853cbe23a5649fdb5e891986e669759/FLAGb09a4d12d [2021-03-25 14:34:50,913 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5378663e7/e853cbe23a5649fdb5e891986e669759 [2021-03-25 14:34:50,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:34:50,916 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:34:50,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:34:50,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:34:50,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:34:50,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:34:50" (1/1) ... [2021-03-25 14:34:50,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34d4b9d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:50, skipping insertion in model container [2021-03-25 14:34:50,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:34:50" (1/1) ... [2021-03-25 14:34:50,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:34:50,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:34:51,119 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_rmo.opt.i[948,961] [2021-03-25 14:34:51,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:34:51,338 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:34:51,348 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_rmo.opt.i[948,961] [2021-03-25 14:34:51,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:34:51,484 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:34:51,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:51 WrapperNode [2021-03-25 14:34:51,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:34:51,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:34:51,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:34:51,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:34:51,493 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:51" (1/1) ... [2021-03-25 14:34:51,529 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:51" (1/1) ... [2021-03-25 14:34:51,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:34:51,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:34:51,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:34:51,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:34:51,577 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:51" (1/1) ... [2021-03-25 14:34:51,578 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:51" (1/1) ... [2021-03-25 14:34:51,590 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:51" (1/1) ... [2021-03-25 14:34:51,591 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:51" (1/1) ... [2021-03-25 14:34:51,601 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:51" (1/1) ... [2021-03-25 14:34:51,604 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:51" (1/1) ... [2021-03-25 14:34:51,606 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:51" (1/1) ... [2021-03-25 14:34:51,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:34:51,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:34:51,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:34:51,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:34:51,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:51" (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:51,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:34:51,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:34:51,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:34:51,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:34:51,687 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:34:51,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:34:51,688 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:34:51,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:34:51,689 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:34:51,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:34:51,689 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:34:51,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:34:51,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:34:51,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:34:51,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:34:51,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:34:51,691 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:53,278 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:34:53,278 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:34:53,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:34:53 BoogieIcfgContainer [2021-03-25 14:34:53,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:34:53,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:34:53,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:34:53,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:34:53,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:34:50" (1/3) ... [2021-03-25 14:34:53,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe7f5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:34:53, skipping insertion in model container [2021-03-25 14:34:53,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:51" (2/3) ... [2021-03-25 14:34:53,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe7f5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:34:53, skipping insertion in model container [2021-03-25 14:34:53,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:34:53" (3/3) ... [2021-03-25 14:34:53,286 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_rmo.opt.i [2021-03-25 14:34:53,292 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:34:53,295 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:34:53,296 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:34:53,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,338 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,338 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,338 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,338 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,339 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,339 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,340 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,340 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,341 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,341 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,342 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,342 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,346 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,346 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,346 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,346 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,346 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,346 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,346 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,346 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:53,346 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,347 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:53,347 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,347 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:53,347 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,347 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:53,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,353 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,353 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,355 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,355 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,356 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,357 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,368 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,369 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,369 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:53,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,370 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:53,371 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:34:53,387 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:34:53,408 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:34:53,408 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:34:53,408 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:34:53,408 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:34:53,408 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:34:53,408 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:34:53,408 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:34:53,408 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:34:53,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 14:34:53,456 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:34:53,456 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:34:53,460 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:53,460 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 14:34:53,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-25 14:34:53,465 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:53,475 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 14:34:53,477 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 14:34:53,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-25 14:34:53,498 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:34:53,498 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:34:53,499 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:53,502 INFO L142 LiptonReduction]: Number of co-enabled transitions 2598 [2021-03-25 14:34:54,947 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:34:55,408 WARN L205 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-25 14:34:55,585 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 14:34:56,265 WARN L205 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-25 14:34:56,539 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 14:34:57,874 WARN L205 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 314 DAG size of output: 269 [2021-03-25 14:34:58,424 WARN L205 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 14:35:00,076 WARN L205 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 189 [2021-03-25 14:35:00,379 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 14:35:01,003 WARN L205 SmtUtils]: Spent 621.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:35:01,584 WARN L205 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:35:01,796 INFO L154 LiptonReduction]: Checked pairs total: 4166 [2021-03-25 14:35:01,796 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-25 14:35:01,816 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8352 [2021-03-25 14:35:01,833 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-25 14:35:01,833 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:35:01,833 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:01,834 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:35:01,834 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:35:01,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:01,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1459371111, now seen corresponding path program 1 times [2021-03-25 14:35:01,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:01,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528719971] [2021-03-25 14:35:01,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:02,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:02,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:35:02,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:02,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:02,104 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:35:02,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528719971] [2021-03-25 14:35:02,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:02,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:35:02,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916324379] [2021-03-25 14:35:02,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:35:02,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:02,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:35:02,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:35:02,124 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 191 [2021-03-25 14:35:02,127 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:35:02,128 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:02,128 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 191 [2021-03-25 14:35:02,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:02,208 INFO L129 PetriNetUnfolder]: 23/111 cut-off events. [2021-03-25 14:35:02,208 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:35:02,210 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:35:02,211 INFO L132 encePairwiseOnDemand]: 187/191 looper letters, 7 selfloop transitions, 2 changer transitions 5/49 dead transitions. [2021-03-25 14:35:02,211 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 132 flow [2021-03-25 14:35:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:35:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:35:02,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2021-03-25 14:35:02,228 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9144851657940664 [2021-03-25 14:35:02,229 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2021-03-25 14:35:02,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2021-03-25 14:35:02,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:02,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2021-03-25 14:35:02,240 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:35:02,256 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:35:02,257 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:35:02,258 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:35:02,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 132 flow [2021-03-25 14:35:02,261 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:35:02,262 INFO L241 Difference]: Finished difference. Result has 56 places, 41 transitions, 94 flow [2021-03-25 14:35:02,268 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:35:02,269 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2021-03-25 14:35:02,269 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:02,269 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 41 transitions, 94 flow [2021-03-25 14:35:02,270 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 41 transitions, 94 flow [2021-03-25 14:35:02,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 94 flow [2021-03-25 14:35:02,283 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-25 14:35:02,283 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:35:02,283 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:35:02,284 INFO L142 LiptonReduction]: Number of co-enabled transitions 392 [2021-03-25 14:35:02,655 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-25 14:35:02,971 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-25 14:35:03,688 WARN L205 SmtUtils]: Spent 714.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 14:35:04,346 WARN L205 SmtUtils]: Spent 657.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 14:35:05,406 INFO L154 LiptonReduction]: Checked pairs total: 1274 [2021-03-25 14:35:05,406 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 14:35:05,407 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3138 [2021-03-25 14:35:05,407 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-25 14:35:05,408 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:35:05,408 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:05,408 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:35:05,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:35:05,408 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:35:05,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:05,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1826671133, now seen corresponding path program 1 times [2021-03-25 14:35:05,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:05,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788774398] [2021-03-25 14:35:05,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:05,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:05,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:35:05,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:05,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:05,566 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:35:05,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:35:05,571 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:35:05,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788774398] [2021-03-25 14:35:05,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:05,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:35:05,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720376584] [2021-03-25 14:35:05,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:35:05,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:05,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:35:05,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:35:05,577 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 203 [2021-03-25 14:35:05,577 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:35:05,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:05,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 203 [2021-03-25 14:35:05,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:05,595 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-25 14:35:05,595 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:35:05,595 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:35:05,595 INFO L132 encePairwiseOnDemand]: 200/203 looper letters, 1 selfloop transitions, 2 changer transitions 1/29 dead transitions. [2021-03-25 14:35:05,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 29 transitions, 76 flow [2021-03-25 14:35:05,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:35:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:35:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2021-03-25 14:35:05,597 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8883415435139573 [2021-03-25 14:35:05,597 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2021-03-25 14:35:05,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2021-03-25 14:35:05,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:05,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2021-03-25 14:35:05,599 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:35:05,602 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:35:05,602 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:35:05,602 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:35:05,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 29 transitions, 76 flow [2021-03-25 14:35:05,603 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:35:05,604 INFO L241 Difference]: Finished difference. Result has 41 places, 28 transitions, 72 flow [2021-03-25 14:35:05,604 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:35:05,604 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -19 predicate places. [2021-03-25 14:35:05,604 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:05,604 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 72 flow [2021-03-25 14:35:05,605 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 72 flow [2021-03-25 14:35:05,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 72 flow [2021-03-25 14:35:05,610 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-25 14:35:05,610 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:35:05,611 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:35:05,611 INFO L142 LiptonReduction]: Number of co-enabled transitions 304 [2021-03-25 14:35:05,727 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-03-25 14:35:06,420 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:35:06,573 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:35:06,901 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 14:35:07,127 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:35:07,131 INFO L154 LiptonReduction]: Checked pairs total: 1047 [2021-03-25 14:35:07,131 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:35:07,131 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1527 [2021-03-25 14:35:07,132 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2021-03-25 14:35:07,133 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:35:07,133 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:07,133 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:35:07,133 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:35:07,133 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:35:07,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:07,134 INFO L82 PathProgramCache]: Analyzing trace with hash 504597834, now seen corresponding path program 1 times [2021-03-25 14:35:07,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:07,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538176038] [2021-03-25 14:35:07,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:07,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:07,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:35:07,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:07,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:35:07,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:07,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:35:07,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:07,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:35:07,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:07,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:35:07,284 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:35:07,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538176038] [2021-03-25 14:35:07,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:07,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:35:07,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596403299] [2021-03-25 14:35:07,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:35:07,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:07,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:35:07,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:35:07,286 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 206 [2021-03-25 14:35:07,288 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:35:07,288 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:07,288 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 206 [2021-03-25 14:35:07,288 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:07,397 INFO L129 PetriNetUnfolder]: 102/213 cut-off events. [2021-03-25 14:35:07,398 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-03-25 14:35:07,399 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:35:07,400 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 9 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2021-03-25 14:35:07,400 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 131 flow [2021-03-25 14:35:07,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:35:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:35:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 837 transitions. [2021-03-25 14:35:07,403 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8126213592233009 [2021-03-25 14:35:07,403 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 837 transitions. [2021-03-25 14:35:07,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 837 transitions. [2021-03-25 14:35:07,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:07,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 837 transitions. [2021-03-25 14:35:07,406 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:35:07,408 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:35:07,408 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:35:07,408 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:35:07,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 131 flow [2021-03-25 14:35:07,409 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:35:07,410 INFO L241 Difference]: Finished difference. Result has 42 places, 35 transitions, 134 flow [2021-03-25 14:35:07,410 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:35:07,410 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -18 predicate places. [2021-03-25 14:35:07,410 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:07,410 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 35 transitions, 134 flow [2021-03-25 14:35:07,411 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 134 flow [2021-03-25 14:35:07,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 134 flow [2021-03-25 14:35:07,424 INFO L129 PetriNetUnfolder]: 21/102 cut-off events. [2021-03-25 14:35:07,424 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-03-25 14:35:07,425 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:35:07,426 INFO L142 LiptonReduction]: Number of co-enabled transitions 408 [2021-03-25 14:35:07,556 INFO L154 LiptonReduction]: Checked pairs total: 398 [2021-03-25 14:35:07,557 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:35:07,557 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 147 [2021-03-25 14:35:07,558 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 134 flow [2021-03-25 14:35:07,558 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:35:07,558 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:07,558 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:35:07,559 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:35:07,559 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:35:07,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:07,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1641857895, now seen corresponding path program 1 times [2021-03-25 14:35:07,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:07,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476515774] [2021-03-25 14:35:07,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:07,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:07,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:07,602 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:35:07,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476515774] [2021-03-25 14:35:07,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:07,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:35:07,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429381248] [2021-03-25 14:35:07,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:35:07,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:07,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:35:07,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:35:07,604 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 206 [2021-03-25 14:35:07,605 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:35:07,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:07,605 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 206 [2021-03-25 14:35:07,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:07,623 INFO L129 PetriNetUnfolder]: 26/104 cut-off events. [2021-03-25 14:35:07,623 INFO L130 PetriNetUnfolder]: For 71/74 co-relation queries the response was YES. [2021-03-25 14:35:07,624 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:35:07,624 INFO L132 encePairwiseOnDemand]: 202/206 looper letters, 4 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2021-03-25 14:35:07,624 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 164 flow [2021-03-25 14:35:07,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:35:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:35:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2021-03-25 14:35:07,626 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9142394822006472 [2021-03-25 14:35:07,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 565 transitions. [2021-03-25 14:35:07,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 565 transitions. [2021-03-25 14:35:07,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:07,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 565 transitions. [2021-03-25 14:35:07,628 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:35:07,629 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:35:07,630 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:35:07,630 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:35:07,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 164 flow [2021-03-25 14:35:07,631 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:35:07,632 INFO L241 Difference]: Finished difference. Result has 45 places, 37 transitions, 169 flow [2021-03-25 14:35:07,632 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:35:07,632 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -15 predicate places. [2021-03-25 14:35:07,632 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:07,633 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 37 transitions, 169 flow [2021-03-25 14:35:07,633 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 37 transitions, 169 flow [2021-03-25 14:35:07,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 37 transitions, 169 flow [2021-03-25 14:35:07,645 INFO L129 PetriNetUnfolder]: 31/111 cut-off events. [2021-03-25 14:35:07,646 INFO L130 PetriNetUnfolder]: For 87/90 co-relation queries the response was YES. [2021-03-25 14:35:07,646 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:35:07,647 INFO L142 LiptonReduction]: Number of co-enabled transitions 436 [2021-03-25 14:35:07,703 INFO L154 LiptonReduction]: Checked pairs total: 365 [2021-03-25 14:35:07,703 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:35:07,703 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 71 [2021-03-25 14:35:07,704 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 169 flow [2021-03-25 14:35:07,704 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:35:07,704 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:07,704 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:35:07,704 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:35:07,705 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:35:07,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:07,705 INFO L82 PathProgramCache]: Analyzing trace with hash -678100871, now seen corresponding path program 1 times [2021-03-25 14:35:07,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:07,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971548084] [2021-03-25 14:35:07,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:07,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:07,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 14:35:07,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:07,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:35:07,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:07,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:35:07,840 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:35:07,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971548084] [2021-03-25 14:35:07,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:07,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:35:07,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735670471] [2021-03-25 14:35:07,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:35:07,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:07,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:35:07,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:35:07,845 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 206 [2021-03-25 14:35:07,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 169 flow. Second operand has 5 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:35:07,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:07,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 206 [2021-03-25 14:35:07,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:07,932 INFO L129 PetriNetUnfolder]: 74/182 cut-off events. [2021-03-25 14:35:07,932 INFO L130 PetriNetUnfolder]: For 240/243 co-relation queries the response was YES. [2021-03-25 14:35:07,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 182 events. 74/182 cut-off events. For 240/243 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 806 event pairs, 20 based on Foata normal form. 5/183 useless extension candidates. Maximal degree in co-relation 513. Up to 92 conditions per place. [2021-03-25 14:35:07,934 INFO L132 encePairwiseOnDemand]: 201/206 looper letters, 10 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2021-03-25 14:35:07,934 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 230 flow [2021-03-25 14:35:07,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:35:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:35:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 678 transitions. [2021-03-25 14:35:07,937 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8228155339805825 [2021-03-25 14:35:07,937 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 678 transitions. [2021-03-25 14:35:07,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 678 transitions. [2021-03-25 14:35:07,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:07,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 678 transitions. [2021-03-25 14:35:07,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.5) internal successors, (678), 4 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have 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:35:07,940 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:35:07,941 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:35:07,941 INFO L185 Difference]: Start difference. First operand has 45 places, 37 transitions, 169 flow. Second operand 4 states and 678 transitions. [2021-03-25 14:35:07,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 230 flow [2021-03-25 14:35:07,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 217 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:35:07,945 INFO L241 Difference]: Finished difference. Result has 48 places, 41 transitions, 203 flow [2021-03-25 14:35:07,945 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2021-03-25 14:35:07,945 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -12 predicate places. [2021-03-25 14:35:07,945 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:07,945 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 41 transitions, 203 flow [2021-03-25 14:35:07,946 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 41 transitions, 203 flow [2021-03-25 14:35:07,946 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 41 transitions, 203 flow [2021-03-25 14:35:07,960 INFO L129 PetriNetUnfolder]: 37/128 cut-off events. [2021-03-25 14:35:07,960 INFO L130 PetriNetUnfolder]: For 126/135 co-relation queries the response was YES. [2021-03-25 14:35:07,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 128 events. 37/128 cut-off events. For 126/135 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 578 event pairs, 5 based on Foata normal form. 4/122 useless extension candidates. Maximal degree in co-relation 335. Up to 48 conditions per place. [2021-03-25 14:35:07,962 INFO L142 LiptonReduction]: Number of co-enabled transitions 490 [2021-03-25 14:35:07,967 INFO L154 LiptonReduction]: Checked pairs total: 386 [2021-03-25 14:35:07,967 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:35:07,967 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-25 14:35:07,969 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 203 flow [2021-03-25 14:35:07,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 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:35:07,970 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:07,970 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:35:07,970 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:35:07,970 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:35:07,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:07,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1216570359, now seen corresponding path program 1 times [2021-03-25 14:35:07,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:07,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260848764] [2021-03-25 14:35:07,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:08,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:08,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:08,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:35:08,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:35:08,070 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:35:08,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260848764] [2021-03-25 14:35:08,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:08,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:35:08,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033994298] [2021-03-25 14:35:08,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:35:08,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:08,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:35:08,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:35:08,073 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-25 14:35:08,074 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have 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:35:08,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:08,074 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-25 14:35:08,074 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:08,156 INFO L129 PetriNetUnfolder]: 90/214 cut-off events. [2021-03-25 14:35:08,156 INFO L130 PetriNetUnfolder]: For 350/353 co-relation queries the response was YES. [2021-03-25 14:35:08,157 INFO L84 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 214 events. 90/214 cut-off events. For 350/353 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 990 event pairs, 19 based on Foata normal form. 4/214 useless extension candidates. Maximal degree in co-relation 685. Up to 114 conditions per place. [2021-03-25 14:35:08,159 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 13 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2021-03-25 14:35:08,159 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 296 flow [2021-03-25 14:35:08,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:35:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:35:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 871 transitions. [2021-03-25 14:35:08,162 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.845631067961165 [2021-03-25 14:35:08,162 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 871 transitions. [2021-03-25 14:35:08,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 871 transitions. [2021-03-25 14:35:08,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:08,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 871 transitions. [2021-03-25 14:35:08,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.2) internal successors, (871), 5 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have 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:35:08,166 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:35:08,166 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:35:08,166 INFO L185 Difference]: Start difference. First operand has 48 places, 41 transitions, 203 flow. Second operand 5 states and 871 transitions. [2021-03-25 14:35:08,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 296 flow [2021-03-25 14:35:08,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 296 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 14:35:08,170 INFO L241 Difference]: Finished difference. Result has 54 places, 48 transitions, 287 flow [2021-03-25 14:35:08,171 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2021-03-25 14:35:08,171 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2021-03-25 14:35:08,171 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:08,171 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 48 transitions, 287 flow [2021-03-25 14:35:08,171 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 48 transitions, 287 flow [2021-03-25 14:35:08,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 48 transitions, 287 flow [2021-03-25 14:35:08,197 INFO L129 PetriNetUnfolder]: 83/206 cut-off events. [2021-03-25 14:35:08,197 INFO L130 PetriNetUnfolder]: For 446/463 co-relation queries the response was YES. [2021-03-25 14:35:08,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 206 events. 83/206 cut-off events. For 446/463 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 996 event pairs, 6 based on Foata normal form. 5/203 useless extension candidates. Maximal degree in co-relation 696. Up to 64 conditions per place. [2021-03-25 14:35:08,200 INFO L142 LiptonReduction]: Number of co-enabled transitions 586 [2021-03-25 14:35:08,212 INFO L154 LiptonReduction]: Checked pairs total: 518 [2021-03-25 14:35:08,212 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:35:08,212 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 41 [2021-03-25 14:35:08,217 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 287 flow [2021-03-25 14:35:08,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have 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:35:08,217 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:08,217 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:35:08,218 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:35:08,218 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:35:08,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:08,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1561932661, now seen corresponding path program 2 times [2021-03-25 14:35:08,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:08,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082045076] [2021-03-25 14:35:08,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:08,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:08,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:08,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:35:08,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:35:08,313 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:35:08,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082045076] [2021-03-25 14:35:08,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:08,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:35:08,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547049764] [2021-03-25 14:35:08,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:35:08,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:08,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:35:08,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:35:08,315 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-25 14:35:08,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have 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:35:08,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:08,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-25 14:35:08,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:08,377 INFO L129 PetriNetUnfolder]: 81/205 cut-off events. [2021-03-25 14:35:08,378 INFO L130 PetriNetUnfolder]: For 553/558 co-relation queries the response was YES. [2021-03-25 14:35:08,378 INFO L84 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 205 events. 81/205 cut-off events. For 553/558 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 967 event pairs, 19 based on Foata normal form. 12/213 useless extension candidates. Maximal degree in co-relation 789. Up to 98 conditions per place. [2021-03-25 14:35:08,380 INFO L132 encePairwiseOnDemand]: 201/206 looper letters, 16 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2021-03-25 14:35:08,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 355 flow [2021-03-25 14:35:08,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:35:08,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:35:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 696 transitions. [2021-03-25 14:35:08,382 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8446601941747572 [2021-03-25 14:35:08,382 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 696 transitions. [2021-03-25 14:35:08,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 696 transitions. [2021-03-25 14:35:08,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:08,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 696 transitions. [2021-03-25 14:35:08,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have 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:35:08,385 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:35:08,385 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:35:08,385 INFO L185 Difference]: Start difference. First operand has 54 places, 48 transitions, 287 flow. Second operand 4 states and 696 transitions. [2021-03-25 14:35:08,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 355 flow [2021-03-25 14:35:08,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 51 transitions, 342 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-03-25 14:35:08,391 INFO L241 Difference]: Finished difference. Result has 57 places, 49 transitions, 308 flow [2021-03-25 14:35:08,391 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2021-03-25 14:35:08,391 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2021-03-25 14:35:08,392 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:08,392 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 49 transitions, 308 flow [2021-03-25 14:35:08,392 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 49 transitions, 308 flow [2021-03-25 14:35:08,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 49 transitions, 308 flow [2021-03-25 14:35:08,415 INFO L129 PetriNetUnfolder]: 73/198 cut-off events. [2021-03-25 14:35:08,415 INFO L130 PetriNetUnfolder]: For 602/625 co-relation queries the response was YES. [2021-03-25 14:35:08,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 198 events. 73/198 cut-off events. For 602/625 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 980 event pairs, 12 based on Foata normal form. 7/195 useless extension candidates. Maximal degree in co-relation 725. Up to 63 conditions per place. [2021-03-25 14:35:08,419 INFO L142 LiptonReduction]: Number of co-enabled transitions 594 [2021-03-25 14:35:08,430 INFO L154 LiptonReduction]: Checked pairs total: 554 [2021-03-25 14:35:08,430 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:35:08,430 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-03-25 14:35:08,430 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 308 flow [2021-03-25 14:35:08,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have 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:35:08,431 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:08,431 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:35:08,431 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:35:08,431 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:35:08,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:08,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1172156608, now seen corresponding path program 1 times [2021-03-25 14:35:08,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:08,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926079176] [2021-03-25 14:35:08,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:08,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:35:08,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:35:08,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:35:08,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:35:08,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:35:08,549 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:35:08,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926079176] [2021-03-25 14:35:08,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:08,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:35:08,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035201781] [2021-03-25 14:35:08,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:35:08,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:08,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:35:08,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:35:08,552 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 206 [2021-03-25 14:35:08,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have 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:35:08,553 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:08,553 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 206 [2021-03-25 14:35:08,553 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:08,669 INFO L129 PetriNetUnfolder]: 85/217 cut-off events. [2021-03-25 14:35:08,670 INFO L130 PetriNetUnfolder]: For 714/718 co-relation queries the response was YES. [2021-03-25 14:35:08,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 952 conditions, 217 events. 85/217 cut-off events. For 714/718 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1057 event pairs, 7 based on Foata normal form. 6/219 useless extension candidates. Maximal degree in co-relation 928. Up to 113 conditions per place. [2021-03-25 14:35:08,672 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 21 selfloop transitions, 11 changer transitions 0/57 dead transitions. [2021-03-25 14:35:08,672 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 436 flow [2021-03-25 14:35:08,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:35:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:35:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 822 transitions. [2021-03-25 14:35:08,675 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7980582524271844 [2021-03-25 14:35:08,675 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 822 transitions. [2021-03-25 14:35:08,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 822 transitions. [2021-03-25 14:35:08,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:08,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 822 transitions. [2021-03-25 14:35:08,677 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:35:08,679 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:35:08,679 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:35:08,679 INFO L185 Difference]: Start difference. First operand has 57 places, 49 transitions, 308 flow. Second operand 5 states and 822 transitions. [2021-03-25 14:35:08,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 436 flow [2021-03-25 14:35:08,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 412 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-25 14:35:08,683 INFO L241 Difference]: Finished difference. Result has 60 places, 54 transitions, 370 flow [2021-03-25 14:35:08,683 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2021-03-25 14:35:08,683 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2021-03-25 14:35:08,683 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:08,683 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 54 transitions, 370 flow [2021-03-25 14:35:08,684 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 54 transitions, 370 flow [2021-03-25 14:35:08,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 54 transitions, 370 flow [2021-03-25 14:35:08,710 INFO L129 PetriNetUnfolder]: 78/210 cut-off events. [2021-03-25 14:35:08,710 INFO L130 PetriNetUnfolder]: For 665/678 co-relation queries the response was YES. [2021-03-25 14:35:08,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 210 events. 78/210 cut-off events. For 665/678 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1049 event pairs, 9 based on Foata normal form. 2/207 useless extension candidates. Maximal degree in co-relation 825. Up to 65 conditions per place. [2021-03-25 14:35:08,713 INFO L142 LiptonReduction]: Number of co-enabled transitions 656 [2021-03-25 14:35:08,726 INFO L154 LiptonReduction]: Checked pairs total: 739 [2021-03-25 14:35:08,726 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:35:08,727 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44 [2021-03-25 14:35:08,727 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 370 flow [2021-03-25 14:35:08,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have 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:35:08,727 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:08,728 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:35:08,728 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:35:08,728 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:35:08,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:08,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1473573204, now seen corresponding path program 2 times [2021-03-25 14:35:08,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:08,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557063605] [2021-03-25 14:35:08,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:08,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:35:08,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:35:08,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 14:35:08,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:35:08,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:08,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 14:35:08,889 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:35:08,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557063605] [2021-03-25 14:35:08,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:08,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:35:08,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832693166] [2021-03-25 14:35:08,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:35:08,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:08,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:35:08,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:35:08,892 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 206 [2021-03-25 14:35:08,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 370 flow. Second operand has 7 states, 7 states have (on average 162.85714285714286) internal successors, (1140), 7 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have 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:35:08,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:08,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 206 [2021-03-25 14:35:08,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:08,996 INFO L129 PetriNetUnfolder]: 83/220 cut-off events. [2021-03-25 14:35:08,996 INFO L130 PetriNetUnfolder]: For 824/830 co-relation queries the response was YES. [2021-03-25 14:35:08,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 220 events. 83/220 cut-off events. For 824/830 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1097 event pairs, 7 based on Foata normal form. 8/224 useless extension candidates. Maximal degree in co-relation 986. Up to 109 conditions per place. [2021-03-25 14:35:08,999 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 20 selfloop transitions, 13 changer transitions 0/58 dead transitions. [2021-03-25 14:35:08,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 58 transitions, 475 flow [2021-03-25 14:35:09,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:35:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:35:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 991 transitions. [2021-03-25 14:35:09,005 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.801779935275081 [2021-03-25 14:35:09,005 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 991 transitions. [2021-03-25 14:35:09,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 991 transitions. [2021-03-25 14:35:09,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:09,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 991 transitions. [2021-03-25 14:35:09,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 165.16666666666666) internal successors, (991), 6 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have 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:35:09,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have 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:35:09,009 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have 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:35:09,009 INFO L185 Difference]: Start difference. First operand has 60 places, 54 transitions, 370 flow. Second operand 6 states and 991 transitions. [2021-03-25 14:35:09,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 58 transitions, 475 flow [2021-03-25 14:35:09,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 58 transitions, 453 flow, removed 7 selfloop flow, removed 1 redundant places. [2021-03-25 14:35:09,013 INFO L241 Difference]: Finished difference. Result has 65 places, 55 transitions, 400 flow [2021-03-25 14:35:09,013 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=400, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2021-03-25 14:35:09,013 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2021-03-25 14:35:09,013 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:09,014 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 55 transitions, 400 flow [2021-03-25 14:35:09,014 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 55 transitions, 400 flow [2021-03-25 14:35:09,014 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 55 transitions, 400 flow [2021-03-25 14:35:09,040 INFO L129 PetriNetUnfolder]: 76/209 cut-off events. [2021-03-25 14:35:09,040 INFO L130 PetriNetUnfolder]: For 895/920 co-relation queries the response was YES. [2021-03-25 14:35:09,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 209 events. 76/209 cut-off events. For 895/920 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1057 event pairs, 9 based on Foata normal form. 7/210 useless extension candidates. Maximal degree in co-relation 844. Up to 63 conditions per place. [2021-03-25 14:35:09,044 INFO L142 LiptonReduction]: Number of co-enabled transitions 668 [2021-03-25 14:35:09,056 INFO L154 LiptonReduction]: Checked pairs total: 666 [2021-03-25 14:35:09,057 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:35:09,057 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44 [2021-03-25 14:35:09,059 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 400 flow [2021-03-25 14:35:09,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 162.85714285714286) internal successors, (1140), 7 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have 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:35:09,059 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:09,059 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:35:09,059 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:35:09,060 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:35:09,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:09,060 INFO L82 PathProgramCache]: Analyzing trace with hash 940923038, now seen corresponding path program 3 times [2021-03-25 14:35:09,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:09,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85434892] [2021-03-25 14:35:09,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:09,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:09,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:35:09,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:09,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:35:09,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:09,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:35:09,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:09,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:35:09,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:09,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:35:09,178 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:35:09,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85434892] [2021-03-25 14:35:09,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:09,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:35:09,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543743212] [2021-03-25 14:35:09,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:35:09,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:09,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:35:09,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:35:09,180 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 206 [2021-03-25 14:35:09,181 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 400 flow. Second operand has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have 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:35:09,181 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:09,181 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 206 [2021-03-25 14:35:09,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:09,276 INFO L129 PetriNetUnfolder]: 87/233 cut-off events. [2021-03-25 14:35:09,276 INFO L130 PetriNetUnfolder]: For 1042/1048 co-relation queries the response was YES. [2021-03-25 14:35:09,277 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 233 events. 87/233 cut-off events. For 1042/1048 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1207 event pairs, 6 based on Foata normal form. 8/237 useless extension candidates. Maximal degree in co-relation 1066. Up to 96 conditions per place. [2021-03-25 14:35:09,279 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 19 selfloop transitions, 19 changer transitions 0/63 dead transitions. [2021-03-25 14:35:09,279 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 63 transitions, 542 flow [2021-03-25 14:35:09,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:35:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:35:09,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 853 transitions. [2021-03-25 14:35:09,281 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8281553398058252 [2021-03-25 14:35:09,281 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 853 transitions. [2021-03-25 14:35:09,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 853 transitions. [2021-03-25 14:35:09,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:09,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 853 transitions. [2021-03-25 14:35:09,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.6) internal successors, (853), 5 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have 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:35:09,285 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:35:09,286 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:35:09,286 INFO L185 Difference]: Start difference. First operand has 65 places, 55 transitions, 400 flow. Second operand 5 states and 853 transitions. [2021-03-25 14:35:09,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 63 transitions, 542 flow [2021-03-25 14:35:09,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 509 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-03-25 14:35:09,290 INFO L241 Difference]: Finished difference. Result has 66 places, 58 transitions, 457 flow [2021-03-25 14:35:09,291 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=457, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2021-03-25 14:35:09,291 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 6 predicate places. [2021-03-25 14:35:09,291 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:09,291 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 58 transitions, 457 flow [2021-03-25 14:35:09,291 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 58 transitions, 457 flow [2021-03-25 14:35:09,292 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 58 transitions, 457 flow [2021-03-25 14:35:09,323 INFO L129 PetriNetUnfolder]: 80/221 cut-off events. [2021-03-25 14:35:09,323 INFO L130 PetriNetUnfolder]: For 1056/1072 co-relation queries the response was YES. [2021-03-25 14:35:09,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 221 events. 80/221 cut-off events. For 1056/1072 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1142 event pairs, 9 based on Foata normal form. 13/230 useless extension candidates. Maximal degree in co-relation 954. Up to 69 conditions per place. [2021-03-25 14:35:09,327 INFO L142 LiptonReduction]: Number of co-enabled transitions 706 [2021-03-25 14:35:09,344 INFO L154 LiptonReduction]: Checked pairs total: 911 [2021-03-25 14:35:09,344 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:35:09,344 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 53 [2021-03-25 14:35:09,346 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 457 flow [2021-03-25 14:35:09,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have 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:35:09,346 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:09,346 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:35:09,346 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:35:09,346 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:35:09,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:09,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1467186196, now seen corresponding path program 4 times [2021-03-25 14:35:09,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:09,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802195638] [2021-03-25 14:35:09,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:09,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:09,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:35:09,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:09,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:35:09,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:09,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:35:09,448 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-25 14:35:09,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 14:35:09,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:09,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:35:09,484 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:35:09,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802195638] [2021-03-25 14:35:09,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:09,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:35:09,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81508088] [2021-03-25 14:35:09,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:35:09,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:09,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:35:09,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:35:09,487 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 206 [2021-03-25 14:35:09,488 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 457 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:35:09,488 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:09,488 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 206 [2021-03-25 14:35:09,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:09,585 INFO L129 PetriNetUnfolder]: 87/236 cut-off events. [2021-03-25 14:35:09,585 INFO L130 PetriNetUnfolder]: For 1265/1271 co-relation queries the response was YES. [2021-03-25 14:35:09,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 236 events. 87/236 cut-off events. For 1265/1271 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1227 event pairs, 9 based on Foata normal form. 8/240 useless extension candidates. Maximal degree in co-relation 1184. Up to 117 conditions per place. [2021-03-25 14:35:09,588 INFO L132 encePairwiseOnDemand]: 200/206 looper letters, 24 selfloop transitions, 15 changer transitions 0/64 dead transitions. [2021-03-25 14:35:09,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 602 flow [2021-03-25 14:35:09,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:35:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:35:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2021-03-25 14:35:09,591 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7970873786407767 [2021-03-25 14:35:09,591 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 821 transitions. [2021-03-25 14:35:09,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 821 transitions. [2021-03-25 14:35:09,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:09,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 821 transitions. [2021-03-25 14:35:09,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.2) internal successors, (821), 5 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have 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:35:09,594 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:35:09,595 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:35:09,595 INFO L185 Difference]: Start difference. First operand has 66 places, 58 transitions, 457 flow. Second operand 5 states and 821 transitions. [2021-03-25 14:35:09,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 602 flow [2021-03-25 14:35:09,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 568 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-25 14:35:09,600 INFO L241 Difference]: Finished difference. Result has 69 places, 62 transitions, 523 flow [2021-03-25 14:35:09,600 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=523, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2021-03-25 14:35:09,600 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2021-03-25 14:35:09,600 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:09,600 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 62 transitions, 523 flow [2021-03-25 14:35:09,601 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 62 transitions, 523 flow [2021-03-25 14:35:09,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 62 transitions, 523 flow [2021-03-25 14:35:09,628 INFO L129 PetriNetUnfolder]: 79/224 cut-off events. [2021-03-25 14:35:09,628 INFO L130 PetriNetUnfolder]: For 1172/1184 co-relation queries the response was YES. [2021-03-25 14:35:09,629 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 224 events. 79/224 cut-off events. For 1172/1184 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1184 event pairs, 12 based on Foata normal form. 6/225 useless extension candidates. Maximal degree in co-relation 1000. Up to 71 conditions per place. [2021-03-25 14:35:09,632 INFO L142 LiptonReduction]: Number of co-enabled transitions 752 [2021-03-25 14:35:09,653 INFO L154 LiptonReduction]: Checked pairs total: 1146 [2021-03-25 14:35:09,653 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:35:09,653 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 53 [2021-03-25 14:35:09,654 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 523 flow [2021-03-25 14:35:09,654 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:35:09,654 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:09,654 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:35:09,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:35:09,655 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:35:09,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:09,655 INFO L82 PathProgramCache]: Analyzing trace with hash 944146108, now seen corresponding path program 1 times [2021-03-25 14:35:09,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:09,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946375798] [2021-03-25 14:35:09,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:09,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:09,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:09,711 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:35:09,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:35:09,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:09,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:35:09,719 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:35:09,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946375798] [2021-03-25 14:35:09,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:09,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:35:09,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474050028] [2021-03-25 14:35:09,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:35:09,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:09,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:35:09,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:35:09,722 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-25 14:35:09,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 523 flow. Second operand has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have 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:35:09,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:09,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-25 14:35:09,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:09,888 INFO L129 PetriNetUnfolder]: 443/871 cut-off events. [2021-03-25 14:35:09,889 INFO L130 PetriNetUnfolder]: For 4144/4551 co-relation queries the response was YES. [2021-03-25 14:35:09,894 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3390 conditions, 871 events. 443/871 cut-off events. For 4144/4551 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 5843 event pairs, 142 based on Foata normal form. 150/931 useless extension candidates. Maximal degree in co-relation 3360. Up to 443 conditions per place. [2021-03-25 14:35:09,899 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 15 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2021-03-25 14:35:09,899 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 75 transitions, 599 flow [2021-03-25 14:35:09,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:35:09,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:35:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 877 transitions. [2021-03-25 14:35:09,902 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8514563106796117 [2021-03-25 14:35:09,902 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 877 transitions. [2021-03-25 14:35:09,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 877 transitions. [2021-03-25 14:35:09,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:09,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 877 transitions. [2021-03-25 14:35:09,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.4) internal successors, (877), 5 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have 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:35:09,906 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:35:09,906 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:35:09,906 INFO L185 Difference]: Start difference. First operand has 69 places, 62 transitions, 523 flow. Second operand 5 states and 877 transitions. [2021-03-25 14:35:09,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 75 transitions, 599 flow [2021-03-25 14:35:09,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 75 transitions, 579 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-25 14:35:09,914 INFO L241 Difference]: Finished difference. Result has 75 places, 71 transitions, 598 flow [2021-03-25 14:35:09,914 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=598, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2021-03-25 14:35:09,914 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 15 predicate places. [2021-03-25 14:35:09,914 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:09,914 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 71 transitions, 598 flow [2021-03-25 14:35:09,914 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 71 transitions, 598 flow [2021-03-25 14:35:09,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 71 transitions, 598 flow [2021-03-25 14:35:10,009 INFO L129 PetriNetUnfolder]: 458/865 cut-off events. [2021-03-25 14:35:10,009 INFO L130 PetriNetUnfolder]: For 3893/4315 co-relation queries the response was YES. [2021-03-25 14:35:10,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3606 conditions, 865 events. 458/865 cut-off events. For 3893/4315 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 5684 event pairs, 140 based on Foata normal form. 37/784 useless extension candidates. Maximal degree in co-relation 3574. Up to 519 conditions per place. [2021-03-25 14:35:10,025 INFO L142 LiptonReduction]: Number of co-enabled transitions 1064 [2021-03-25 14:35:10,137 INFO L154 LiptonReduction]: Checked pairs total: 700 [2021-03-25 14:35:10,137 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:35:10,137 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 223 [2021-03-25 14:35:10,137 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 598 flow [2021-03-25 14:35:10,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have 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:35:10,138 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:10,138 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:35:10,138 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:35:10,138 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:35:10,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:10,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1405663372, now seen corresponding path program 1 times [2021-03-25 14:35:10,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:10,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346523361] [2021-03-25 14:35:10,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:10,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:10,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:10,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:10,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:10,202 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:35:10,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:35:10,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:10,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:35:10,209 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:35:10,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346523361] [2021-03-25 14:35:10,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:10,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:35:10,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835405244] [2021-03-25 14:35:10,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:35:10,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:10,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:35:10,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:35:10,211 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-25 14:35:10,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 598 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have 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:35:10,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:10,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-25 14:35:10,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:10,353 INFO L129 PetriNetUnfolder]: 290/636 cut-off events. [2021-03-25 14:35:10,353 INFO L130 PetriNetUnfolder]: For 4368/5960 co-relation queries the response was YES. [2021-03-25 14:35:10,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2987 conditions, 636 events. 290/636 cut-off events. For 4368/5960 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4123 event pairs, 42 based on Foata normal form. 284/857 useless extension candidates. Maximal degree in co-relation 2953. Up to 375 conditions per place. [2021-03-25 14:35:10,362 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 14 selfloop transitions, 19 changer transitions 0/83 dead transitions. [2021-03-25 14:35:10,362 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 83 transitions, 731 flow [2021-03-25 14:35:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:35:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:35:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1228 transitions. [2021-03-25 14:35:10,365 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8515950069348127 [2021-03-25 14:35:10,365 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1228 transitions. [2021-03-25 14:35:10,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1228 transitions. [2021-03-25 14:35:10,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:10,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1228 transitions. [2021-03-25 14:35:10,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 175.42857142857142) internal successors, (1228), 7 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have 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:35:10,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have 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:35:10,370 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have 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:35:10,371 INFO L185 Difference]: Start difference. First operand has 75 places, 71 transitions, 598 flow. Second operand 7 states and 1228 transitions. [2021-03-25 14:35:10,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 83 transitions, 731 flow [2021-03-25 14:35:10,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 83 transitions, 724 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 14:35:10,380 INFO L241 Difference]: Finished difference. Result has 83 places, 79 transitions, 732 flow [2021-03-25 14:35:10,380 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=732, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2021-03-25 14:35:10,380 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 23 predicate places. [2021-03-25 14:35:10,380 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:10,380 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 79 transitions, 732 flow [2021-03-25 14:35:10,380 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 79 transitions, 732 flow [2021-03-25 14:35:10,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 79 transitions, 732 flow [2021-03-25 14:35:10,457 INFO L129 PetriNetUnfolder]: 301/648 cut-off events. [2021-03-25 14:35:10,458 INFO L130 PetriNetUnfolder]: For 4191/5174 co-relation queries the response was YES. [2021-03-25 14:35:10,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3358 conditions, 648 events. 301/648 cut-off events. For 4191/5174 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 4379 event pairs, 33 based on Foata normal form. 35/617 useless extension candidates. Maximal degree in co-relation 3322. Up to 398 conditions per place. [2021-03-25 14:35:10,470 INFO L142 LiptonReduction]: Number of co-enabled transitions 1240 [2021-03-25 14:35:10,488 INFO L154 LiptonReduction]: Checked pairs total: 708 [2021-03-25 14:35:10,488 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:35:10,488 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 108 [2021-03-25 14:35:10,489 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 732 flow [2021-03-25 14:35:10,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have 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:35:10,489 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:10,489 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:35:10,489 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:35:10,489 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:35:10,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:10,490 INFO L82 PathProgramCache]: Analyzing trace with hash -692239796, now seen corresponding path program 1 times [2021-03-25 14:35:10,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:10,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168156972] [2021-03-25 14:35:10,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:10,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:10,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:35:10,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:10,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:10,544 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:35:10,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168156972] [2021-03-25 14:35:10,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:10,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:35:10,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274654869] [2021-03-25 14:35:10,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:35:10,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:10,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:35:10,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:35:10,546 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 206 [2021-03-25 14:35:10,547 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have 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:35:10,547 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:10,547 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 206 [2021-03-25 14:35:10,547 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:10,674 INFO L129 PetriNetUnfolder]: 467/969 cut-off events. [2021-03-25 14:35:10,674 INFO L130 PetriNetUnfolder]: For 6444/7836 co-relation queries the response was YES. [2021-03-25 14:35:10,681 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5109 conditions, 969 events. 467/969 cut-off events. For 6444/7836 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 6741 event pairs, 74 based on Foata normal form. 63/925 useless extension candidates. Maximal degree in co-relation 5071. Up to 634 conditions per place. [2021-03-25 14:35:10,686 INFO L132 encePairwiseOnDemand]: 203/206 looper letters, 5 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2021-03-25 14:35:10,686 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 79 transitions, 754 flow [2021-03-25 14:35:10,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:35:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:35:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2021-03-25 14:35:10,688 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2021-03-25 14:35:10,688 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 564 transitions. [2021-03-25 14:35:10,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 564 transitions. [2021-03-25 14:35:10,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:10,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 564 transitions. [2021-03-25 14:35:10,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:35:10,702 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:35:10,703 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:35:10,703 INFO L185 Difference]: Start difference. First operand has 83 places, 79 transitions, 732 flow. Second operand 3 states and 564 transitions. [2021-03-25 14:35:10,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 79 transitions, 754 flow [2021-03-25 14:35:10,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 79 transitions, 704 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-25 14:35:10,719 INFO L241 Difference]: Finished difference. Result has 83 places, 79 transitions, 702 flow [2021-03-25 14:35:10,719 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2021-03-25 14:35:10,719 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 23 predicate places. [2021-03-25 14:35:10,719 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:10,720 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 79 transitions, 702 flow [2021-03-25 14:35:10,720 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 79 transitions, 702 flow [2021-03-25 14:35:10,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 79 transitions, 702 flow [2021-03-25 14:35:10,874 INFO L129 PetriNetUnfolder]: 454/935 cut-off events. [2021-03-25 14:35:10,874 INFO L130 PetriNetUnfolder]: For 5884/6288 co-relation queries the response was YES. [2021-03-25 14:35:10,880 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4430 conditions, 935 events. 454/935 cut-off events. For 5884/6288 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 6546 event pairs, 56 based on Foata normal form. 42/870 useless extension candidates. Maximal degree in co-relation 4394. Up to 535 conditions per place. [2021-03-25 14:35:10,895 INFO L142 LiptonReduction]: Number of co-enabled transitions 1240 [2021-03-25 14:35:10,940 INFO L154 LiptonReduction]: Checked pairs total: 708 [2021-03-25 14:35:10,940 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:35:10,941 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 222 [2021-03-25 14:35:10,941 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 702 flow [2021-03-25 14:35:10,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have 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:35:10,941 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:10,941 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:35:10,941 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:35:10,942 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:35:10,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:10,942 INFO L82 PathProgramCache]: Analyzing trace with hash 152371164, now seen corresponding path program 1 times [2021-03-25 14:35:10,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:10,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093220104] [2021-03-25 14:35:10,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:10,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:10,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:11,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:11,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:11,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:11,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:11,012 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:35:11,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:35:11,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:11,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:35:11,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:35:11,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093220104] [2021-03-25 14:35:11,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:11,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:35:11,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040480496] [2021-03-25 14:35:11,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:35:11,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:11,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:35:11,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:35:11,021 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-25 14:35:11,022 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 702 flow. Second operand has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have 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:35:11,022 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:11,022 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-25 14:35:11,022 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:11,195 INFO L129 PetriNetUnfolder]: 316/702 cut-off events. [2021-03-25 14:35:11,196 INFO L130 PetriNetUnfolder]: For 6201/8334 co-relation queries the response was YES. [2021-03-25 14:35:11,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3549 conditions, 702 events. 316/702 cut-off events. For 6201/8334 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 4737 event pairs, 10 based on Foata normal form. 452/1067 useless extension candidates. Maximal degree in co-relation 3511. Up to 414 conditions per place. [2021-03-25 14:35:11,205 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 8 selfloop transitions, 28 changer transitions 4/83 dead transitions. [2021-03-25 14:35:11,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 83 transitions, 796 flow [2021-03-25 14:35:11,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:35:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:35:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1579 transitions. [2021-03-25 14:35:11,208 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8516720604099245 [2021-03-25 14:35:11,208 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1579 transitions. [2021-03-25 14:35:11,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1579 transitions. [2021-03-25 14:35:11,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:11,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1579 transitions. [2021-03-25 14:35:11,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 175.44444444444446) internal successors, (1579), 9 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have 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:35:11,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 206.0) internal successors, (2060), 10 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have 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:35:11,215 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 206.0) internal successors, (2060), 10 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have 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:35:11,215 INFO L185 Difference]: Start difference. First operand has 83 places, 79 transitions, 702 flow. Second operand 9 states and 1579 transitions. [2021-03-25 14:35:11,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 83 transitions, 796 flow [2021-03-25 14:35:11,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 83 transitions, 765 flow, removed 3 selfloop flow, removed 6 redundant places. [2021-03-25 14:35:11,224 INFO L241 Difference]: Finished difference. Result has 88 places, 79 transitions, 745 flow [2021-03-25 14:35:11,224 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=745, PETRI_PLACES=88, PETRI_TRANSITIONS=79} [2021-03-25 14:35:11,225 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 28 predicate places. [2021-03-25 14:35:11,225 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:11,225 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 79 transitions, 745 flow [2021-03-25 14:35:11,225 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 79 transitions, 745 flow [2021-03-25 14:35:11,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 79 transitions, 745 flow [2021-03-25 14:35:11,296 INFO L129 PetriNetUnfolder]: 329/718 cut-off events. [2021-03-25 14:35:11,297 INFO L130 PetriNetUnfolder]: For 6080/6812 co-relation queries the response was YES. [2021-03-25 14:35:11,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3906 conditions, 718 events. 329/718 cut-off events. For 6080/6812 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 4959 event pairs, 7 based on Foata normal form. 22/651 useless extension candidates. Maximal degree in co-relation 3869. Up to 428 conditions per place. [2021-03-25 14:35:11,311 INFO L142 LiptonReduction]: Number of co-enabled transitions 1286 [2021-03-25 14:35:11,520 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 14:35:11,903 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 14:35:12,013 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 14:35:12,025 INFO L154 LiptonReduction]: Checked pairs total: 1336 [2021-03-25 14:35:12,026 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:35:12,026 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 801 [2021-03-25 14:35:12,026 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 79 transitions, 750 flow [2021-03-25 14:35:12,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have 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:35:12,027 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:12,027 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:35:12,027 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 14:35:12,027 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:35:12,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:12,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2016283596, now seen corresponding path program 1 times [2021-03-25 14:35:12,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:12,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303195692] [2021-03-25 14:35:12,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:12,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:12,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:35:12,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:12,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:12,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:12,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:12,090 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:35:12,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303195692] [2021-03-25 14:35:12,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:12,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:35:12,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406389708] [2021-03-25 14:35:12,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:35:12,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:12,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:35:12,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:35:12,094 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 207 [2021-03-25 14:35:12,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 79 transitions, 750 flow. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have 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:35:12,094 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:12,094 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 207 [2021-03-25 14:35:12,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:12,281 INFO L129 PetriNetUnfolder]: 584/1281 cut-off events. [2021-03-25 14:35:12,281 INFO L130 PetriNetUnfolder]: For 11448/13338 co-relation queries the response was YES. [2021-03-25 14:35:12,291 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6921 conditions, 1281 events. 584/1281 cut-off events. For 11448/13338 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 10200 event pairs, 24 based on Foata normal form. 38/1071 useless extension candidates. Maximal degree in co-relation 6882. Up to 775 conditions per place. [2021-03-25 14:35:12,299 INFO L132 encePairwiseOnDemand]: 204/207 looper letters, 4 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2021-03-25 14:35:12,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 81 transitions, 782 flow [2021-03-25 14:35:12,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:35:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:35:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 735 transitions. [2021-03-25 14:35:12,302 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8876811594202898 [2021-03-25 14:35:12,302 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 735 transitions. [2021-03-25 14:35:12,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 735 transitions. [2021-03-25 14:35:12,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:12,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 735 transitions. [2021-03-25 14:35:12,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 183.75) internal successors, (735), 4 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have 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:35:12,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have 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:35:12,305 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have 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:35:12,305 INFO L185 Difference]: Start difference. First operand has 88 places, 79 transitions, 750 flow. Second operand 4 states and 735 transitions. [2021-03-25 14:35:12,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 81 transitions, 782 flow [2021-03-25 14:35:12,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 81 transitions, 675 flow, removed 39 selfloop flow, removed 4 redundant places. [2021-03-25 14:35:12,384 INFO L241 Difference]: Finished difference. Result has 89 places, 80 transitions, 656 flow [2021-03-25 14:35:12,384 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=656, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2021-03-25 14:35:12,384 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 29 predicate places. [2021-03-25 14:35:12,384 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:12,384 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 80 transitions, 656 flow [2021-03-25 14:35:12,385 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 80 transitions, 656 flow [2021-03-25 14:35:12,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 80 transitions, 656 flow [2021-03-25 14:35:12,517 INFO L129 PetriNetUnfolder]: 583/1284 cut-off events. [2021-03-25 14:35:12,517 INFO L130 PetriNetUnfolder]: For 6559/6930 co-relation queries the response was YES. [2021-03-25 14:35:12,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5057 conditions, 1284 events. 583/1284 cut-off events. For 6559/6930 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 10479 event pairs, 22 based on Foata normal form. 29/1095 useless extension candidates. Maximal degree in co-relation 5018. Up to 367 conditions per place. [2021-03-25 14:35:12,545 INFO L142 LiptonReduction]: Number of co-enabled transitions 1358 [2021-03-25 14:35:12,568 INFO L154 LiptonReduction]: Checked pairs total: 418 [2021-03-25 14:35:12,569 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:35:12,569 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 185 [2021-03-25 14:35:12,569 INFO L480 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 656 flow [2021-03-25 14:35:12,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have 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:35:12,570 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:12,570 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:35:12,570 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 14:35:12,570 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:35:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:12,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1534059088, now seen corresponding path program 1 times [2021-03-25 14:35:12,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:12,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077905740] [2021-03-25 14:35:12,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:12,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:12,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:12,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:12,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:12,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:12,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:12,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:12,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:12,646 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:35:12,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:35:12,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:12,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:35:12,659 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:35:12,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077905740] [2021-03-25 14:35:12,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:12,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:35:12,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235334995] [2021-03-25 14:35:12,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:35:12,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:12,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:35:12,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:35:12,662 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 207 [2021-03-25 14:35:12,663 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 656 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:35:12,663 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:12,663 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 207 [2021-03-25 14:35:12,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:12,908 INFO L129 PetriNetUnfolder]: 536/1171 cut-off events. [2021-03-25 14:35:12,908 INFO L130 PetriNetUnfolder]: For 8207/12453 co-relation queries the response was YES. [2021-03-25 14:35:12,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5244 conditions, 1171 events. 536/1171 cut-off events. For 8207/12453 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 9293 event pairs, 8 based on Foata normal form. 697/1629 useless extension candidates. Maximal degree in co-relation 5203. Up to 340 conditions per place. [2021-03-25 14:35:12,921 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 2 selfloop transitions, 33 changer transitions 8/81 dead transitions. [2021-03-25 14:35:12,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 81 transitions, 739 flow [2021-03-25 14:35:12,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 14:35:12,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 14:35:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1933 transitions. [2021-03-25 14:35:12,926 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8489240228370664 [2021-03-25 14:35:12,926 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1933 transitions. [2021-03-25 14:35:12,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1933 transitions. [2021-03-25 14:35:12,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:12,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1933 transitions. [2021-03-25 14:35:12,931 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:35:12,934 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:35:12,934 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:35:12,934 INFO L185 Difference]: Start difference. First operand has 89 places, 80 transitions, 656 flow. Second operand 11 states and 1933 transitions. [2021-03-25 14:35:12,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 81 transitions, 739 flow [2021-03-25 14:35:12,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 81 transitions, 701 flow, removed 9 selfloop flow, removed 5 redundant places. [2021-03-25 14:35:12,971 INFO L241 Difference]: Finished difference. Result has 97 places, 73 transitions, 634 flow [2021-03-25 14:35:12,971 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=634, PETRI_PLACES=97, PETRI_TRANSITIONS=73} [2021-03-25 14:35:12,972 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 37 predicate places. [2021-03-25 14:35:12,972 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:12,972 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 73 transitions, 634 flow [2021-03-25 14:35:12,972 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 73 transitions, 634 flow [2021-03-25 14:35:12,973 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 95 places, 73 transitions, 634 flow [2021-03-25 14:35:13,010 INFO L129 PetriNetUnfolder]: 178/448 cut-off events. [2021-03-25 14:35:13,010 INFO L130 PetriNetUnfolder]: For 2323/2631 co-relation queries the response was YES. [2021-03-25 14:35:13,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1982 conditions, 448 events. 178/448 cut-off events. For 2323/2631 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 3026 event pairs, 2 based on Foata normal form. 15/407 useless extension candidates. Maximal degree in co-relation 1949. Up to 125 conditions per place. [2021-03-25 14:35:13,019 INFO L142 LiptonReduction]: Number of co-enabled transitions 1048 [2021-03-25 14:35:13,396 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-25 14:35:13,546 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-25 14:35:14,192 WARN L205 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 196 [2021-03-25 14:35:14,440 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 14:35:15,839 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 350 DAG size of output: 278 [2021-03-25 14:35:16,395 WARN L205 SmtUtils]: Spent 553.00 ms on a formula simplification that was a NOOP. DAG size: 258 [2021-03-25 14:35:16,401 INFO L154 LiptonReduction]: Checked pairs total: 1050 [2021-03-25 14:35:16,401 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-25 14:35:16,401 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3429 [2021-03-25 14:35:16,402 INFO L480 AbstractCegarLoop]: Abstraction has has 92 places, 66 transitions, 596 flow [2021-03-25 14:35:16,402 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:35:16,402 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:16,402 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:35:16,402 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 14:35:16,402 INFO L428 AbstractCegarLoop]: === Iteration 18 === [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:35:16,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:16,403 INFO L82 PathProgramCache]: Analyzing trace with hash -757242032, now seen corresponding path program 1 times [2021-03-25 14:35:16,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:16,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432878510] [2021-03-25 14:35:16,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:16,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:16,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:35:16,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:16,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:16,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:16,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:35:16,443 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:35:16,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432878510] [2021-03-25 14:35:16,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:16,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:35:16,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928521690] [2021-03-25 14:35:16,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:35:16,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:16,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:35:16,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:35:16,445 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 212 [2021-03-25 14:35:16,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 66 transitions, 596 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:35:16,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:16,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 212 [2021-03-25 14:35:16,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:16,493 INFO L129 PetriNetUnfolder]: 117/293 cut-off events. [2021-03-25 14:35:16,493 INFO L130 PetriNetUnfolder]: For 8225/8456 co-relation queries the response was YES. [2021-03-25 14:35:16,495 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 293 events. 117/293 cut-off events. For 8225/8456 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1573 event pairs, 3 based on Foata normal form. 52/316 useless extension candidates. Maximal degree in co-relation 1228. Up to 94 conditions per place. [2021-03-25 14:35:16,496 INFO L132 encePairwiseOnDemand]: 209/212 looper letters, 3 selfloop transitions, 1 changer transitions 11/55 dead transitions. [2021-03-25 14:35:16,496 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 55 transitions, 492 flow [2021-03-25 14:35:16,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:35:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:35:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 754 transitions. [2021-03-25 14:35:16,499 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8891509433962265 [2021-03-25 14:35:16,499 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 754 transitions. [2021-03-25 14:35:16,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 754 transitions. [2021-03-25 14:35:16,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:16,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 754 transitions. [2021-03-25 14:35:16,500 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:35:16,501 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:35:16,502 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:35:16,502 INFO L185 Difference]: Start difference. First operand has 92 places, 66 transitions, 596 flow. Second operand 4 states and 754 transitions. [2021-03-25 14:35:16,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 55 transitions, 492 flow [2021-03-25 14:35:16,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 55 transitions, 373 flow, removed 36 selfloop flow, removed 17 redundant places. [2021-03-25 14:35:16,508 INFO L241 Difference]: Finished difference. Result has 70 places, 44 transitions, 282 flow [2021-03-25 14:35:16,508 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=282, PETRI_PLACES=70, PETRI_TRANSITIONS=44} [2021-03-25 14:35:16,508 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 10 predicate places. [2021-03-25 14:35:16,508 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:16,508 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 44 transitions, 282 flow [2021-03-25 14:35:16,509 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 44 transitions, 282 flow [2021-03-25 14:35:16,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 44 transitions, 282 flow [2021-03-25 14:35:16,519 INFO L129 PetriNetUnfolder]: 50/138 cut-off events. [2021-03-25 14:35:16,519 INFO L130 PetriNetUnfolder]: For 712/738 co-relation queries the response was YES. [2021-03-25 14:35:16,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 138 events. 50/138 cut-off events. For 712/738 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 566 event pairs, 0 based on Foata normal form. 11/140 useless extension candidates. Maximal degree in co-relation 433. Up to 44 conditions per place. [2021-03-25 14:35:16,521 INFO L142 LiptonReduction]: Number of co-enabled transitions 280 [2021-03-25 14:35:16,583 INFO L154 LiptonReduction]: Checked pairs total: 62 [2021-03-25 14:35:16,583 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:35:16,583 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 75 [2021-03-25 14:35:16,584 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 280 flow [2021-03-25 14:35:16,584 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:35:16,584 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:16,584 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:35:16,584 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 14:35:16,584 INFO L428 AbstractCegarLoop]: === Iteration 19 === [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:35:16,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:16,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1492346555, now seen corresponding path program 1 times [2021-03-25 14:35:16,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:16,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559554684] [2021-03-25 14:35:16,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:35:16,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:16,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:35:16,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:16,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:35:16,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:16,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:35:16,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:35:16,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:35:16,669 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:35:16,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559554684] [2021-03-25 14:35:16,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:35:16,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:35:16,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444082366] [2021-03-25 14:35:16,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:35:16,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:35:16,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:35:16,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:35:16,672 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 213 [2021-03-25 14:35:16,673 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 280 flow. Second operand has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have 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:35:16,673 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:35:16,673 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 213 [2021-03-25 14:35:16,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:35:16,732 INFO L129 PetriNetUnfolder]: 69/175 cut-off events. [2021-03-25 14:35:16,733 INFO L130 PetriNetUnfolder]: For 1221/1281 co-relation queries the response was YES. [2021-03-25 14:35:16,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 175 events. 69/175 cut-off events. For 1221/1281 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 765 event pairs, 0 based on Foata normal form. 16/176 useless extension candidates. Maximal degree in co-relation 569. Up to 60 conditions per place. [2021-03-25 14:35:16,734 INFO L132 encePairwiseOnDemand]: 209/213 looper letters, 8 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2021-03-25 14:35:16,734 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 43 transitions, 306 flow [2021-03-25 14:35:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:35:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:35:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 693 transitions. [2021-03-25 14:35:16,737 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8133802816901409 [2021-03-25 14:35:16,737 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 693 transitions. [2021-03-25 14:35:16,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 693 transitions. [2021-03-25 14:35:16,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:35:16,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 693 transitions. [2021-03-25 14:35:16,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have 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:35:16,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have 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:35:16,740 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have 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:35:16,740 INFO L185 Difference]: Start difference. First operand has 65 places, 43 transitions, 280 flow. Second operand 4 states and 693 transitions. [2021-03-25 14:35:16,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 43 transitions, 306 flow [2021-03-25 14:35:16,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 43 transitions, 286 flow, removed 3 selfloop flow, removed 8 redundant places. [2021-03-25 14:35:16,744 INFO L241 Difference]: Finished difference. Result has 61 places, 43 transitions, 276 flow [2021-03-25 14:35:16,744 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=276, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2021-03-25 14:35:16,744 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2021-03-25 14:35:16,744 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:35:16,745 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 43 transitions, 276 flow [2021-03-25 14:35:16,747 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 43 transitions, 276 flow [2021-03-25 14:35:16,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 43 transitions, 276 flow [2021-03-25 14:35:16,759 INFO L129 PetriNetUnfolder]: 64/164 cut-off events. [2021-03-25 14:35:16,759 INFO L130 PetriNetUnfolder]: For 526/546 co-relation queries the response was YES. [2021-03-25 14:35:16,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 164 events. 64/164 cut-off events. For 526/546 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 737 event pairs, 0 based on Foata normal form. 7/158 useless extension candidates. Maximal degree in co-relation 511. Up to 54 conditions per place. [2021-03-25 14:35:16,761 INFO L142 LiptonReduction]: Number of co-enabled transitions 218 [2021-03-25 14:35:16,762 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:35:16,762 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:35:16,762 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-25 14:35:16,764 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 276 flow [2021-03-25 14:35:16,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have 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:35:16,764 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:35:16,764 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:35:16,764 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-25 14:35:16,764 INFO L428 AbstractCegarLoop]: === Iteration 20 === [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:35:16,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:35:16,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1124417008, now seen corresponding path program 1 times [2021-03-25 14:35:16,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:35:16,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27316542] [2021-03-25 14:35:16,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:35:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:35:16,798 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:35:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:35:16,822 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:35:16,861 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:35:16,861 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:35:16,861 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-25 14:35:16,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:35:16 BasicIcfg [2021-03-25 14:35:16,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:35:16,971 INFO L168 Benchmark]: Toolchain (without parser) took 26055.08 ms. Allocated memory was 367.0 MB in the beginning and 767.6 MB in the end (delta: 400.6 MB). Free memory was 329.9 MB in the beginning and 645.7 MB in the end (delta: -315.8 MB). Peak memory consumption was 85.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:35:16,971 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 367.0 MB. Free memory was 348.4 MB in the beginning and 348.3 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:35:16,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 569.13 ms. Allocated memory is still 367.0 MB. Free memory was 329.8 MB in the beginning and 326.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:35:16,971 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.28 ms. Allocated memory is still 367.0 MB. Free memory was 326.7 MB in the beginning and 323.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:35:16,972 INFO L168 Benchmark]: Boogie Preprocessor took 51.97 ms. Allocated memory is still 367.0 MB. Free memory was 323.6 MB in the beginning and 321.5 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:35:16,972 INFO L168 Benchmark]: RCFGBuilder took 1658.09 ms. Allocated memory is still 367.0 MB. Free memory was 321.5 MB in the beginning and 287.6 MB in the end (delta: 33.8 MB). Peak memory consumption was 156.5 MB. Max. memory is 16.0 GB. [2021-03-25 14:35:16,972 INFO L168 Benchmark]: TraceAbstraction took 23689.04 ms. Allocated memory was 367.0 MB in the beginning and 767.6 MB in the end (delta: 400.6 MB). Free memory was 287.6 MB in the beginning and 645.7 MB in the end (delta: -358.1 MB). Peak memory consumption was 42.5 MB. Max. memory is 16.0 GB. [2021-03-25 14:35:16,973 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.12 ms. Allocated memory is still 367.0 MB. Free memory was 348.4 MB in the beginning and 348.3 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 569.13 ms. Allocated memory is still 367.0 MB. Free memory was 329.8 MB in the beginning and 326.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 82.28 ms. Allocated memory is still 367.0 MB. Free memory was 326.7 MB in the beginning and 323.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 51.97 ms. Allocated memory is still 367.0 MB. Free memory was 323.6 MB in the beginning and 321.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1658.09 ms. Allocated memory is still 367.0 MB. Free memory was 321.5 MB in the beginning and 287.6 MB in the end (delta: 33.8 MB). Peak memory consumption was 156.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 23689.04 ms. Allocated memory was 367.0 MB in the beginning and 767.6 MB in the end (delta: 400.6 MB). Free memory was 287.6 MB in the beginning and 645.7 MB in the end (delta: -358.1 MB). Peak memory consumption was 42.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8319.2ms, 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: 664, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 633, negative conditional: 0, negative unconditional: 633, 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: 3136.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: 243, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 194, negative conditional: 0, negative unconditional: 194, 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: 1525.6ms, 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: 146.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: 127, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 127, negative conditional: 0, negative unconditional: 127, 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: 70.1ms, 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: 51, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 51, negative conditional: 0, negative unconditional: 51, 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: 21.6ms, 48 PlacesBefore, 48 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 386 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 118, positive: 102, positive conditional: 0, positive unconditional: 102, 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: 118, positive: 100, positive conditional: 0, positive unconditional: 100, 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: 40.4ms, 54 PlacesBefore, 54 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 586 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 518 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 243, positive: 225, positive conditional: 0, positive unconditional: 225, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 243, positive: 220, positive conditional: 0, positive unconditional: 220, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 198, Positive conditional cache size: 0, Positive unconditional cache size: 198, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37.8ms, 57 PlacesBefore, 57 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 594 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 554 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 213, positive: 193, positive conditional: 0, positive unconditional: 193, 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: 0, 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: 213, positive: 193, positive conditional: 0, positive unconditional: 193, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 198, Positive conditional cache size: 0, Positive unconditional cache size: 198, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.8ms, 60 PlacesBefore, 60 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 739 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 213, positive: 188, positive conditional: 0, positive unconditional: 188, negative: 25, negative conditional: 0, negative unconditional: 25, 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: 213, positive: 187, positive conditional: 0, positive unconditional: 187, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 199, Positive conditional cache size: 0, Positive unconditional cache size: 199, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 43.0ms, 65 PlacesBefore, 65 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 668 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 666 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 226, positive: 205, positive conditional: 0, positive unconditional: 205, negative: 21, negative conditional: 0, negative unconditional: 21, 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: 226, positive: 205, positive conditional: 0, positive unconditional: 205, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 199, Positive conditional cache size: 0, Positive unconditional cache size: 199, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 53.0ms, 66 PlacesBefore, 66 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 706 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 911 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 422, positive: 393, positive conditional: 0, positive unconditional: 393, negative: 29, negative conditional: 0, negative unconditional: 29, 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: 422, positive: 393, positive conditional: 0, positive unconditional: 393, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 199, Positive conditional cache size: 0, Positive unconditional cache size: 199, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52.8ms, 69 PlacesBefore, 69 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 752 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 433, positive: 393, positive conditional: 0, positive unconditional: 393, negative: 40, negative conditional: 0, negative unconditional: 40, 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: 433, positive: 391, positive conditional: 0, positive unconditional: 391, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 201, Positive conditional cache size: 0, Positive unconditional cache size: 201, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 222.4ms, 75 PlacesBefore, 75 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1064 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 700 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 218, positive: 200, positive conditional: 0, positive unconditional: 200, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 218, positive: 193, positive conditional: 0, positive unconditional: 193, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 208, Positive conditional cache size: 0, Positive unconditional cache size: 208, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 107.9ms, 83 PlacesBefore, 83 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1240 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 708 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: 0, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 208, Positive conditional cache size: 0, Positive unconditional cache size: 208, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 220.7ms, 83 PlacesBefore, 83 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1240 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 708 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 153, positive: 136, positive conditional: 0, positive unconditional: 136, 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: 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: 153, positive: 135, positive conditional: 0, positive unconditional: 135, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 209, Positive conditional cache size: 0, Positive unconditional cache size: 209, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 800.5ms, 88 PlacesBefore, 88 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1336 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 341, positive: 311, positive conditional: 0, positive unconditional: 311, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 341, positive: 304, positive conditional: 0, positive unconditional: 304, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 214, Positive conditional cache size: 0, Positive unconditional cache size: 214, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 183.9ms, 89 PlacesBefore, 89 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1358 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 418 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 122, positive: 112, positive conditional: 0, positive unconditional: 112, negative: 10, negative conditional: 0, negative unconditional: 10, 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: 122, positive: 112, positive conditional: 0, positive unconditional: 112, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 214, Positive conditional cache size: 0, Positive unconditional cache size: 214, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3428.6ms, 97 PlacesBefore, 92 PlacesAfterwards, 73 TransitionsBefore, 66 TransitionsAfterwards, 1048 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 1050 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 357, positive: 330, positive conditional: 0, positive unconditional: 330, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 357, positive: 322, positive conditional: 0, positive unconditional: 322, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 172, Positive conditional cache size: 0, Positive unconditional cache size: 172, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 74.4ms, 70 PlacesBefore, 65 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 62 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 52, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 5, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 5, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 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] ], Cache Queries: [ total: 52, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 133, Positive conditional cache size: 0, Positive unconditional cache size: 133, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.5ms, 61 PlacesBefore, 61 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 133, Positive conditional cache size: 0, Positive unconditional cache size: 133, 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 t1237; [L847] FCALL, FORK 0 pthread_create(&t1237, ((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 t1238; [L849] FCALL, FORK 0 pthread_create(&t1238, ((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 t1239; [L851] FCALL, FORK 0 pthread_create(&t1239, ((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 t1240; [L853] FCALL, FORK 0 pthread_create(&t1240, ((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] EXPR 0 !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] 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] EXPR 0 !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] 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] EXPR 0 !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] 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] EXPR 0 !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] 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] EXPR 0 !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] 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] EXPR 0 !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] 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=0, 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: 6.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 23457.4ms, OverallIterations: 20, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2576.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8418.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 69 SDtfs, 43 SDslu, 26 SDs, 0 SdLazy, 466 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 542.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 542.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=750occurred in iteration=15, InterpolantAutomatonStates: 95, 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: 59.9ms SsaConstructionTime, 530.7ms SatisfiabilityAnalysisTime, 1306.6ms InterpolantComputationTime, 353 NumberOfCodeBlocks, 353 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 1859 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...