/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 15:48:43,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 15:48:43,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 15:48:43,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 15:48:43,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 15:48:43,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 15:48:43,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 15:48:43,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 15:48:43,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 15:48:43,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 15:48:43,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 15:48:43,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 15:48:43,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 15:48:43,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 15:48:43,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 15:48:43,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 15:48:43,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 15:48:43,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 15:48:43,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 15:48:43,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 15:48:43,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 15:48:43,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 15:48:43,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 15:48:43,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 15:48:43,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 15:48:43,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 15:48:43,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 15:48:43,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 15:48:43,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 15:48:43,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 15:48:43,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 15:48:43,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 15:48:43,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 15:48:43,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 15:48:43,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 15:48:43,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 15:48:43,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 15:48:43,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 15:48:43,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 15:48:43,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 15:48:43,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 15:48:43,114 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-06-11 15:48:43,151 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 15:48:43,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 15:48:43,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 15:48:43,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 15:48:43,154 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 15:48:43,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 15:48:43,154 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 15:48:43,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 15:48:43,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 15:48:43,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 15:48:43,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 15:48:43,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 15:48:43,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 15:48:43,156 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 15:48:43,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 15:48:43,157 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 15:48:43,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 15:48:43,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 15:48:43,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 15:48:43,157 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 15:48:43,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 15:48:43,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:48:43,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 15:48:43,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 15:48:43,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 15:48:43,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 15:48:43,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 15:48:43,159 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 15:48:43,159 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 15:48:43,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 15:48:43,159 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-11 15:48:43,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 15:48:43,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 15:48:43,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 15:48:43,498 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 15:48:43,499 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 15:48:43,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i [2021-06-11 15:48:43,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a58c13ea/7190256f8f4c488ab16f36b1409c9de6/FLAGc7c5c00b9 [2021-06-11 15:48:44,096 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 15:48:44,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i [2021-06-11 15:48:44,111 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a58c13ea/7190256f8f4c488ab16f36b1409c9de6/FLAGc7c5c00b9 [2021-06-11 15:48:44,409 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a58c13ea/7190256f8f4c488ab16f36b1409c9de6 [2021-06-11 15:48:44,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 15:48:44,412 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 15:48:44,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 15:48:44,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 15:48:44,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 15:48:44,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:48:44" (1/1) ... [2021-06-11 15:48:44,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b09d566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:44, skipping insertion in model container [2021-06-11 15:48:44,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:48:44" (1/1) ... [2021-06-11 15:48:44,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 15:48:44,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 15:48:44,695 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/mix045_tso.opt.i[948,961] [2021-06-11 15:48:44,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:48:44,910 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 15:48:44,919 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/mix045_tso.opt.i[948,961] [2021-06-11 15:48:44,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:48:45,021 INFO L208 MainTranslator]: Completed translation [2021-06-11 15:48:45,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:45 WrapperNode [2021-06-11 15:48:45,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 15:48:45,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 15:48:45,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 15:48:45,025 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 15:48:45,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:45" (1/1) ... [2021-06-11 15:48:45,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:45" (1/1) ... [2021-06-11 15:48:45,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 15:48:45,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 15:48:45,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 15:48:45,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 15:48:45,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:45" (1/1) ... [2021-06-11 15:48:45,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:45" (1/1) ... [2021-06-11 15:48:45,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:45" (1/1) ... [2021-06-11 15:48:45,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:45" (1/1) ... [2021-06-11 15:48:45,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:45" (1/1) ... [2021-06-11 15:48:45,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:45" (1/1) ... [2021-06-11 15:48:45,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:45" (1/1) ... [2021-06-11 15:48:45,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 15:48:45,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 15:48:45,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 15:48:45,159 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 15:48:45,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:48:45,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 15:48:45,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 15:48:45,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 15:48:45,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 15:48:45,235 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 15:48:45,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 15:48:45,235 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 15:48:45,236 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 15:48:45,236 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 15:48:45,236 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 15:48:45,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 15:48:45,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 15:48:45,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 15:48:45,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 15:48:45,238 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 15:48:46,783 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 15:48:46,783 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 15:48:46,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:48:46 BoogieIcfgContainer [2021-06-11 15:48:46,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 15:48:46,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 15:48:46,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 15:48:46,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 15:48:46,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 03:48:44" (1/3) ... [2021-06-11 15:48:46,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638782ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:48:46, skipping insertion in model container [2021-06-11 15:48:46,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:45" (2/3) ... [2021-06-11 15:48:46,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638782ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:48:46, skipping insertion in model container [2021-06-11 15:48:46,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:48:46" (3/3) ... [2021-06-11 15:48:46,791 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_tso.opt.i [2021-06-11 15:48:46,796 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 15:48:46,799 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 15:48:46,799 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 15:48:46,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,826 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,826 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,826 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,826 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,827 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,827 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,828 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,828 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,831 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,831 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,831 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,831 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,832 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,832 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,832 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,832 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,837 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,837 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,839 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,840 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,842 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,842 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,842 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,842 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,842 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,842 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,842 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,842 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:46,845 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 15:48:46,860 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 15:48:46,876 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 15:48:46,876 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 15:48:46,876 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 15:48:46,876 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 15:48:46,876 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 15:48:46,877 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 15:48:46,877 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 15:48:46,877 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 15:48:46,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2021-06-11 15:48:46,916 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-06-11 15:48:46,916 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:48:46,919 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-06-11 15:48:46,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 100 transitions, 215 flow [2021-06-11 15:48:46,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 203 flow [2021-06-11 15:48:46,924 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:46,935 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 203 flow [2021-06-11 15:48:46,938 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 203 flow [2021-06-11 15:48:46,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 203 flow [2021-06-11 15:48:46,956 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-06-11 15:48:46,956 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:48:46,957 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-06-11 15:48:46,959 INFO L151 LiptonReduction]: Number of co-enabled transitions 1738 [2021-06-11 15:48:47,890 WARN L205 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-06-11 15:48:48,248 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-06-11 15:48:49,618 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-06-11 15:48:50,177 WARN L205 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-06-11 15:48:50,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:50,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:50,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:50,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:50,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:50,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:50,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:50,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:50,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:50,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:50,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,468 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:50,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:50,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:50,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:50,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,580 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 15:48:50,581 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:48:50,605 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:50,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:50,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:50,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:50,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:50,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:50,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,938 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:50,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:50,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:50,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:51,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,142 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:51,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:51,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:51,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,188 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:51,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:51,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:51,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,315 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 15:48:51,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:51,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:51,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:52,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:52,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:52,261 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 15:48:52,663 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 15:48:52,780 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 15:48:52,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:52,805 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:52,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:52,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:48:52,809 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:52,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:52,812 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-11 15:48:52,812 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:48:52,815 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:52,817 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-11 15:48:52,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:52,819 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-11 15:48:52,820 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-11 15:48:52,820 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:48:52,822 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:52,825 INFO L147 QuantifierPusher]: treesize reduction 100, result has 38.7 percent of original size 63 [2021-06-11 15:48:52,826 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-11 15:48:52,826 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:48:52,827 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:52,830 INFO L147 QuantifierPusher]: treesize reduction 176, result has 33.3 percent of original size 88 [2021-06-11 15:48:52,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:52,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:53,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:53,107 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:53,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:53,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:53,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:53,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:53,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:53,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:53,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:53,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:53,282 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:53,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:53,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:53,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:53,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:53,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:53,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:53,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:53,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:53,416 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 15:48:53,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:53,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:53,997 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-06-11 15:48:54,315 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-06-11 15:48:55,519 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 268 DAG size of output: 267 [2021-06-11 15:48:56,125 WARN L205 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-06-11 15:48:56,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:56,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:56,532 WARN L205 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-06-11 15:48:56,843 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-06-11 15:48:58,033 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 276 DAG size of output: 275 [2021-06-11 15:48:58,667 WARN L205 SmtUtils]: Spent 632.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-06-11 15:48:58,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:58,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:58,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:58,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:58,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:58,898 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:58,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:58,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:58,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:59,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:59,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:59,444 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2021-06-11 15:48:59,747 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2021-06-11 15:49:00,451 WARN L205 SmtUtils]: Spent 702.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2021-06-11 15:49:01,160 WARN L205 SmtUtils]: Spent 707.00 ms on a formula simplification that was a NOOP. DAG size: 277 [2021-06-11 15:49:01,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:01,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:01,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:01,406 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:01,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:01,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:01,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:02,083 WARN L205 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2021-06-11 15:49:02,499 WARN L205 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-06-11 15:49:03,338 WARN L205 SmtUtils]: Spent 837.00 ms on a formula simplification that was a NOOP. DAG size: 283 [2021-06-11 15:49:03,984 WARN L205 SmtUtils]: Spent 643.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2021-06-11 15:49:04,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:04,193 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:04,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:04,194 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:04,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:04,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 15:49:04,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:04,196 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:04,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:04,197 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:04,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:04,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 15:49:04,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 15:49:04,199 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:04,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:04,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 15:49:04,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:49:04,653 WARN L205 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-06-11 15:49:04,810 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-11 15:49:05,121 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-06-11 15:49:05,265 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-11 15:49:05,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,280 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:05,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:05,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:05,294 INFO L163 LiptonReduction]: Checked pairs total: 4835 [2021-06-11 15:49:05,295 INFO L165 LiptonReduction]: Total number of compositions: 92 [2021-06-11 15:49:05,297 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18374 [2021-06-11 15:49:05,303 INFO L129 PetriNetUnfolder]: 2/16 cut-off events. [2021-06-11 15:49:05,303 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:49:05,304 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:05,304 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:05,304 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:49:05,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:05,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1730178591, now seen corresponding path program 1 times [2021-06-11 15:49:05,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:05,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93920843] [2021-06-11 15:49:05,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:05,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:49:05,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93920843] [2021-06-11 15:49:05,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:05,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:49:05,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452711048] [2021-06-11 15:49:05,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:49:05,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:05,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:49:05,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:49:05,499 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 192 [2021-06-11 15:49:05,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:05,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:05,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 192 [2021-06-11 15:49:05,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:05,598 INFO L129 PetriNetUnfolder]: 23/67 cut-off events. [2021-06-11 15:49:05,598 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:49:05,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 67 events. 23/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 219 event pairs, 9 based on Foata normal form. 6/63 useless extension candidates. Maximal degree in co-relation 115. Up to 37 conditions per place. [2021-06-11 15:49:05,600 INFO L132 encePairwiseOnDemand]: 186/192 looper letters, 7 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2021-06-11 15:49:05,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 85 flow [2021-06-11 15:49:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:49:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:49:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2021-06-11 15:49:05,610 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2021-06-11 15:49:05,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2021-06-11 15:49:05,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2021-06-11 15:49:05,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:05,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2021-06-11 15:49:05,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:05,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:05,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:05,627 INFO L185 Difference]: Start difference. First operand has 35 places, 27 transitions, 63 flow. Second operand 3 states and 480 transitions. [2021-06-11 15:49:05,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 85 flow [2021-06-11 15:49:05,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 15:49:05,630 INFO L241 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2021-06-11 15:49:05,632 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2021-06-11 15:49:05,632 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2021-06-11 15:49:05,633 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:05,633 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 22 transitions, 54 flow [2021-06-11 15:49:05,633 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 22 transitions, 54 flow [2021-06-11 15:49:05,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 54 flow [2021-06-11 15:49:05,638 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-06-11 15:49:05,639 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:49:05,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 15:49:05,640 INFO L151 LiptonReduction]: Number of co-enabled transitions 230 [2021-06-11 15:49:05,727 INFO L163 LiptonReduction]: Checked pairs total: 266 [2021-06-11 15:49:05,727 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:05,727 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 94 [2021-06-11 15:49:05,728 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2021-06-11 15:49:05,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:05,728 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:05,728 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:05,729 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 15:49:05,729 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:49:05,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:05,729 INFO L82 PathProgramCache]: Analyzing trace with hash -549215079, now seen corresponding path program 1 times [2021-06-11 15:49:05,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:05,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156550106] [2021-06-11 15:49:05,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:05,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:49:05,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156550106] [2021-06-11 15:49:05,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:05,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:49:05,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554862768] [2021-06-11 15:49:05,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:49:05,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:05,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:49:05,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:49:05,854 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 192 [2021-06-11 15:49:05,855 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:05,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:05,855 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 192 [2021-06-11 15:49:05,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:05,864 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-06-11 15:49:05,864 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:49:05,865 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 15:49:05,865 INFO L132 encePairwiseOnDemand]: 189/192 looper letters, 1 selfloop transitions, 2 changer transitions 1/22 dead transitions. [2021-06-11 15:49:05,865 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 22 transitions, 60 flow [2021-06-11 15:49:05,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:49:05,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:49:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2021-06-11 15:49:05,868 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8350694444444444 [2021-06-11 15:49:05,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 481 transitions. [2021-06-11 15:49:05,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 481 transitions. [2021-06-11 15:49:05,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:05,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 481 transitions. [2021-06-11 15:49:05,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:05,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:05,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:05,874 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 481 transitions. [2021-06-11 15:49:05,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 22 transitions, 60 flow [2021-06-11 15:49:05,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 22 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:49:05,874 INFO L241 Difference]: Finished difference. Result has 32 places, 21 transitions, 56 flow [2021-06-11 15:49:05,874 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2021-06-11 15:49:05,875 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2021-06-11 15:49:05,875 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:05,875 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 56 flow [2021-06-11 15:49:05,875 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 56 flow [2021-06-11 15:49:05,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2021-06-11 15:49:05,879 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-06-11 15:49:05,879 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:49:05,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 15:49:05,879 INFO L151 LiptonReduction]: Number of co-enabled transitions 202 [2021-06-11 15:49:06,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,106 INFO L163 LiptonReduction]: Checked pairs total: 441 [2021-06-11 15:49:06,106 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 15:49:06,106 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 231 [2021-06-11 15:49:06,107 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2021-06-11 15:49:06,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:06,107 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:06,107 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:06,108 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 15:49:06,108 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:49:06,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:06,108 INFO L82 PathProgramCache]: Analyzing trace with hash 485260065, now seen corresponding path program 1 times [2021-06-11 15:49:06,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:06,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471047749] [2021-06-11 15:49:06,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:06,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:49:06,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471047749] [2021-06-11 15:49:06,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:06,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:49:06,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121308116] [2021-06-11 15:49:06,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:49:06,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:06,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:49:06,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:49:06,173 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2021-06-11 15:49:06,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:06,174 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:06,174 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2021-06-11 15:49:06,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:06,186 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-06-11 15:49:06,186 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-06-11 15:49:06,186 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 32 events. 3/32 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 1 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2021-06-11 15:49:06,186 INFO L132 encePairwiseOnDemand]: 189/193 looper letters, 3 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2021-06-11 15:49:06,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 22 transitions, 70 flow [2021-06-11 15:49:06,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:49:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:49:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2021-06-11 15:49:06,189 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8411053540587219 [2021-06-11 15:49:06,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2021-06-11 15:49:06,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2021-06-11 15:49:06,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:06,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2021-06-11 15:49:06,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:06,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:06,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:06,192 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 3 states and 487 transitions. [2021-06-11 15:49:06,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 22 transitions, 70 flow [2021-06-11 15:49:06,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 22 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:49:06,193 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 69 flow [2021-06-11 15:49:06,193 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2021-06-11 15:49:06,194 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2021-06-11 15:49:06,194 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:06,194 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 22 transitions, 69 flow [2021-06-11 15:49:06,194 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 69 flow [2021-06-11 15:49:06,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 69 flow [2021-06-11 15:49:06,199 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-06-11 15:49:06,199 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-06-11 15:49:06,199 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 28 events. 3/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2021-06-11 15:49:06,200 INFO L151 LiptonReduction]: Number of co-enabled transitions 210 [2021-06-11 15:49:06,201 INFO L163 LiptonReduction]: Checked pairs total: 165 [2021-06-11 15:49:06,201 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:06,201 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-06-11 15:49:06,202 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 69 flow [2021-06-11 15:49:06,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:06,203 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:06,203 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:06,203 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 15:49:06,203 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:49:06,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:06,203 INFO L82 PathProgramCache]: Analyzing trace with hash -853661349, now seen corresponding path program 1 times [2021-06-11 15:49:06,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:06,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971298201] [2021-06-11 15:49:06,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:06,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:06,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:49:06,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:49:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:49:06,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971298201] [2021-06-11 15:49:06,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:06,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:49:06,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096819660] [2021-06-11 15:49:06,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:49:06,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:06,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:49:06,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:49:06,319 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 193 [2021-06-11 15:49:06,320 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 69 flow. Second operand has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:06,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:06,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 193 [2021-06-11 15:49:06,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:06,395 INFO L129 PetriNetUnfolder]: 47/122 cut-off events. [2021-06-11 15:49:06,395 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-11 15:49:06,396 INFO L84 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 122 events. 47/122 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 27 based on Foata normal form. 1/115 useless extension candidates. Maximal degree in co-relation 248. Up to 77 conditions per place. [2021-06-11 15:49:06,398 INFO L132 encePairwiseOnDemand]: 188/193 looper letters, 8 selfloop transitions, 5 changer transitions 0/28 dead transitions. [2021-06-11 15:49:06,398 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 108 flow [2021-06-11 15:49:06,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:49:06,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:49:06,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2021-06-11 15:49:06,401 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7383419689119171 [2021-06-11 15:49:06,401 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2021-06-11 15:49:06,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2021-06-11 15:49:06,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:06,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2021-06-11 15:49:06,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:06,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:06,405 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:06,405 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 69 flow. Second operand 4 states and 570 transitions. [2021-06-11 15:49:06,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 108 flow [2021-06-11 15:49:06,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 105 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:49:06,407 INFO L241 Difference]: Finished difference. Result has 35 places, 26 transitions, 99 flow [2021-06-11 15:49:06,407 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2021-06-11 15:49:06,407 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2021-06-11 15:49:06,407 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:06,407 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 99 flow [2021-06-11 15:49:06,408 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 99 flow [2021-06-11 15:49:06,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 99 flow [2021-06-11 15:49:06,414 INFO L129 PetriNetUnfolder]: 6/41 cut-off events. [2021-06-11 15:49:06,414 INFO L130 PetriNetUnfolder]: For 22/25 co-relation queries the response was YES. [2021-06-11 15:49:06,414 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 41 events. 6/41 cut-off events. For 22/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 100 event pairs, 2 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 79. Up to 13 conditions per place. [2021-06-11 15:49:06,415 INFO L151 LiptonReduction]: Number of co-enabled transitions 244 [2021-06-11 15:49:06,474 INFO L163 LiptonReduction]: Checked pairs total: 137 [2021-06-11 15:49:06,474 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:06,474 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 67 [2021-06-11 15:49:06,475 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 99 flow [2021-06-11 15:49:06,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:06,475 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:06,476 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:06,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 15:49:06,476 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:49:06,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:06,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2115457615, now seen corresponding path program 1 times [2021-06-11 15:49:06,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:06,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862247107] [2021-06-11 15:49:06,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:06,557 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-06-11 15:49:06,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 15:49:06,582 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-06-11 15:49:06,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:49:06,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 15:49:06,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:49:06,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862247107] [2021-06-11 15:49:06,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:06,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:49:06,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390370677] [2021-06-11 15:49:06,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:49:06,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:06,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:49:06,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:49:06,638 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 193 [2021-06-11 15:49:06,639 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:06,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:06,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 193 [2021-06-11 15:49:06,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:06,744 INFO L129 PetriNetUnfolder]: 42/116 cut-off events. [2021-06-11 15:49:06,745 INFO L130 PetriNetUnfolder]: For 61/63 co-relation queries the response was YES. [2021-06-11 15:49:06,745 INFO L84 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 116 events. 42/116 cut-off events. For 61/63 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 3 based on Foata normal form. 4/113 useless extension candidates. Maximal degree in co-relation 286. Up to 49 conditions per place. [2021-06-11 15:49:06,746 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 10 selfloop transitions, 9 changer transitions 0/34 dead transitions. [2021-06-11 15:49:06,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 158 flow [2021-06-11 15:49:06,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 15:49:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 15:49:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 871 transitions. [2021-06-11 15:49:06,750 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7521588946459413 [2021-06-11 15:49:06,750 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 871 transitions. [2021-06-11 15:49:06,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 871 transitions. [2021-06-11 15:49:06,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:06,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 871 transitions. [2021-06-11 15:49:06,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 145.16666666666666) internal successors, (871), 6 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-06-11 15:49:06,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:06,755 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:06,755 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 99 flow. Second operand 6 states and 871 transitions. [2021-06-11 15:49:06,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 158 flow [2021-06-11 15:49:06,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 158 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 15:49:06,757 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 141 flow [2021-06-11 15:49:06,758 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2021-06-11 15:49:06,758 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2021-06-11 15:49:06,758 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:06,758 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 141 flow [2021-06-11 15:49:06,758 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 141 flow [2021-06-11 15:49:06,759 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 141 flow [2021-06-11 15:49:06,766 INFO L129 PetriNetUnfolder]: 11/53 cut-off events. [2021-06-11 15:49:06,766 INFO L130 PetriNetUnfolder]: For 53/56 co-relation queries the response was YES. [2021-06-11 15:49:06,767 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 53 events. 11/53 cut-off events. For 53/56 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 164 event pairs, 5 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 131. Up to 19 conditions per place. [2021-06-11 15:49:06,767 INFO L151 LiptonReduction]: Number of co-enabled transitions 280 [2021-06-11 15:49:06,909 INFO L163 LiptonReduction]: Checked pairs total: 157 [2021-06-11 15:49:06,909 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:06,909 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 151 [2021-06-11 15:49:06,910 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 141 flow [2021-06-11 15:49:06,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:06,910 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:06,911 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:06,911 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 15:49:06,911 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:49:06,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:06,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1822145108, now seen corresponding path program 1 times [2021-06-11 15:49:06,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:06,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378935551] [2021-06-11 15:49:06,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:06,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:06,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:06,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 15:49:06,995 INFO L142 QuantifierPusher]: treesize reduction 8, result has 63.6 percent of original size [2021-06-11 15:49:06,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:07,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:49:07,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378935551] [2021-06-11 15:49:07,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:07,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:49:07,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144770975] [2021-06-11 15:49:07,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:49:07,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:07,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:49:07,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:49:07,022 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 193 [2021-06-11 15:49:07,023 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,023 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:07,023 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 193 [2021-06-11 15:49:07,023 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:07,119 INFO L129 PetriNetUnfolder]: 46/130 cut-off events. [2021-06-11 15:49:07,119 INFO L130 PetriNetUnfolder]: For 143/145 co-relation queries the response was YES. [2021-06-11 15:49:07,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 130 events. 46/130 cut-off events. For 143/145 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 598 event pairs, 3 based on Foata normal form. 4/126 useless extension candidates. Maximal degree in co-relation 385. Up to 49 conditions per place. [2021-06-11 15:49:07,120 INFO L132 encePairwiseOnDemand]: 186/193 looper letters, 9 selfloop transitions, 12 changer transitions 0/36 dead transitions. [2021-06-11 15:49:07,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 207 flow [2021-06-11 15:49:07,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:49:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:49:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2021-06-11 15:49:07,123 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7492227979274612 [2021-06-11 15:49:07,123 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2021-06-11 15:49:07,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2021-06-11 15:49:07,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:07,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2021-06-11 15:49:07,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.6) internal successors, (723), 5 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,128 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,128 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 141 flow. Second operand 5 states and 723 transitions. [2021-06-11 15:49:07,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 207 flow [2021-06-11 15:49:07,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 189 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-06-11 15:49:07,130 INFO L241 Difference]: Finished difference. Result has 45 places, 34 transitions, 187 flow [2021-06-11 15:49:07,131 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2021-06-11 15:49:07,131 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2021-06-11 15:49:07,131 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:07,131 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 187 flow [2021-06-11 15:49:07,131 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 34 transitions, 187 flow [2021-06-11 15:49:07,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 187 flow [2021-06-11 15:49:07,142 INFO L129 PetriNetUnfolder]: 18/74 cut-off events. [2021-06-11 15:49:07,142 INFO L130 PetriNetUnfolder]: For 88/92 co-relation queries the response was YES. [2021-06-11 15:49:07,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 74 events. 18/74 cut-off events. For 88/92 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 272 event pairs, 4 based on Foata normal form. 2/69 useless extension candidates. Maximal degree in co-relation 209. Up to 22 conditions per place. [2021-06-11 15:49:07,143 INFO L151 LiptonReduction]: Number of co-enabled transitions 304 [2021-06-11 15:49:07,146 INFO L163 LiptonReduction]: Checked pairs total: 146 [2021-06-11 15:49:07,147 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:07,147 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-06-11 15:49:07,147 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 187 flow [2021-06-11 15:49:07,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,148 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:07,148 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:07,148 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 15:49:07,148 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:49:07,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:07,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1822040948, now seen corresponding path program 2 times [2021-06-11 15:49:07,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:07,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016410487] [2021-06-11 15:49:07,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:07,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:49:07,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 15:49:07,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 15:49:07,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-06-11 15:49:07,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 15:49:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:49:07,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016410487] [2021-06-11 15:49:07,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:07,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:49:07,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169738449] [2021-06-11 15:49:07,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:49:07,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:07,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:49:07,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:49:07,270 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 193 [2021-06-11 15:49:07,271 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,271 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:07,271 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 193 [2021-06-11 15:49:07,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:07,353 INFO L129 PetriNetUnfolder]: 54/152 cut-off events. [2021-06-11 15:49:07,353 INFO L130 PetriNetUnfolder]: For 209/219 co-relation queries the response was YES. [2021-06-11 15:49:07,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 152 events. 54/152 cut-off events. For 209/219 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 761 event pairs, 3 based on Foata normal form. 8/152 useless extension candidates. Maximal degree in co-relation 528. Up to 74 conditions per place. [2021-06-11 15:49:07,355 INFO L132 encePairwiseOnDemand]: 186/193 looper letters, 14 selfloop transitions, 10 changer transitions 0/39 dead transitions. [2021-06-11 15:49:07,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 267 flow [2021-06-11 15:49:07,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:49:07,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:49:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2021-06-11 15:49:07,358 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7378238341968912 [2021-06-11 15:49:07,358 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2021-06-11 15:49:07,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2021-06-11 15:49:07,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:07,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2021-06-11 15:49:07,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,362 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,362 INFO L185 Difference]: Start difference. First operand has 45 places, 34 transitions, 187 flow. Second operand 5 states and 712 transitions. [2021-06-11 15:49:07,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 267 flow [2021-06-11 15:49:07,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 254 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-06-11 15:49:07,365 INFO L241 Difference]: Finished difference. Result has 49 places, 36 transitions, 220 flow [2021-06-11 15:49:07,365 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2021-06-11 15:49:07,365 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2021-06-11 15:49:07,366 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:07,366 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 36 transitions, 220 flow [2021-06-11 15:49:07,366 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 36 transitions, 220 flow [2021-06-11 15:49:07,366 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 36 transitions, 220 flow [2021-06-11 15:49:07,377 INFO L129 PetriNetUnfolder]: 21/85 cut-off events. [2021-06-11 15:49:07,377 INFO L130 PetriNetUnfolder]: For 159/166 co-relation queries the response was YES. [2021-06-11 15:49:07,378 INFO L84 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 85 events. 21/85 cut-off events. For 159/166 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 341 event pairs, 6 based on Foata normal form. 5/83 useless extension candidates. Maximal degree in co-relation 251. Up to 28 conditions per place. [2021-06-11 15:49:07,379 INFO L151 LiptonReduction]: Number of co-enabled transitions 326 [2021-06-11 15:49:07,382 INFO L163 LiptonReduction]: Checked pairs total: 178 [2021-06-11 15:49:07,383 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:07,383 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-06-11 15:49:07,383 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 220 flow [2021-06-11 15:49:07,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,384 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:07,384 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:07,384 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 15:49:07,384 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:49:07,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:07,384 INFO L82 PathProgramCache]: Analyzing trace with hash 542276876, now seen corresponding path program 3 times [2021-06-11 15:49:07,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:07,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101400228] [2021-06-11 15:49:07,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:07,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 15:49:07,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 15:49:07,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 15:49:07,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 15:49:07,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:07,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:49:07,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101400228] [2021-06-11 15:49:07,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:07,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:49:07,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265618932] [2021-06-11 15:49:07,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:49:07,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:07,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:49:07,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:49:07,532 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 193 [2021-06-11 15:49:07,533 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 139.85714285714286) internal successors, (979), 7 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,533 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:07,533 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 193 [2021-06-11 15:49:07,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:07,652 INFO L129 PetriNetUnfolder]: 51/147 cut-off events. [2021-06-11 15:49:07,653 INFO L130 PetriNetUnfolder]: For 310/320 co-relation queries the response was YES. [2021-06-11 15:49:07,653 INFO L84 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 147 events. 51/147 cut-off events. For 310/320 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 734 event pairs, 3 based on Foata normal form. 8/147 useless extension candidates. Maximal degree in co-relation 522. Up to 47 conditions per place. [2021-06-11 15:49:07,654 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 9 selfloop transitions, 14 changer transitions 0/38 dead transitions. [2021-06-11 15:49:07,654 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 38 transitions, 274 flow [2021-06-11 15:49:07,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:49:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:49:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 711 transitions. [2021-06-11 15:49:07,658 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7367875647668394 [2021-06-11 15:49:07,658 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 711 transitions. [2021-06-11 15:49:07,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 711 transitions. [2021-06-11 15:49:07,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:07,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 711 transitions. [2021-06-11 15:49:07,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,662 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,668 INFO L185 Difference]: Start difference. First operand has 49 places, 36 transitions, 220 flow. Second operand 5 states and 711 transitions. [2021-06-11 15:49:07,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 38 transitions, 274 flow [2021-06-11 15:49:07,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 38 transitions, 255 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-11 15:49:07,672 INFO L241 Difference]: Finished difference. Result has 51 places, 36 transitions, 241 flow [2021-06-11 15:49:07,673 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2021-06-11 15:49:07,673 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2021-06-11 15:49:07,673 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:07,673 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 36 transitions, 241 flow [2021-06-11 15:49:07,673 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 36 transitions, 241 flow [2021-06-11 15:49:07,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 36 transitions, 241 flow [2021-06-11 15:49:07,688 INFO L129 PetriNetUnfolder]: 17/79 cut-off events. [2021-06-11 15:49:07,688 INFO L130 PetriNetUnfolder]: For 196/203 co-relation queries the response was YES. [2021-06-11 15:49:07,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 79 events. 17/79 cut-off events. For 196/203 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 314 event pairs, 5 based on Foata normal form. 5/79 useless extension candidates. Maximal degree in co-relation 251. Up to 23 conditions per place. [2021-06-11 15:49:07,690 INFO L151 LiptonReduction]: Number of co-enabled transitions 324 [2021-06-11 15:49:07,693 INFO L163 LiptonReduction]: Checked pairs total: 172 [2021-06-11 15:49:07,693 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:07,693 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-06-11 15:49:07,694 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 241 flow [2021-06-11 15:49:07,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 139.85714285714286) internal successors, (979), 7 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,694 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:07,694 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:07,695 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 15:49:07,695 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:49:07,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:07,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1749805368, now seen corresponding path program 1 times [2021-06-11 15:49:07,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:07,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115330871] [2021-06-11 15:49:07,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:07,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:07,783 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:49:07,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:07,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:49:07,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115330871] [2021-06-11 15:49:07,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:07,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:49:07,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984978397] [2021-06-11 15:49:07,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:49:07,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:07,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:49:07,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:49:07,797 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 193 [2021-06-11 15:49:07,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:07,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 193 [2021-06-11 15:49:07,799 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:07,859 INFO L129 PetriNetUnfolder]: 87/240 cut-off events. [2021-06-11 15:49:07,859 INFO L130 PetriNetUnfolder]: For 386/405 co-relation queries the response was YES. [2021-06-11 15:49:07,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 240 events. 87/240 cut-off events. For 386/405 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1393 event pairs, 26 based on Foata normal form. 38/256 useless extension candidates. Maximal degree in co-relation 691. Up to 117 conditions per place. [2021-06-11 15:49:07,861 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 9 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2021-06-11 15:49:07,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 46 transitions, 295 flow [2021-06-11 15:49:07,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:49:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:49:07,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 778 transitions. [2021-06-11 15:49:07,864 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8062176165803109 [2021-06-11 15:49:07,864 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 778 transitions. [2021-06-11 15:49:07,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 778 transitions. [2021-06-11 15:49:07,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:07,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 778 transitions. [2021-06-11 15:49:07,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.6) internal successors, (778), 5 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,870 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,870 INFO L185 Difference]: Start difference. First operand has 51 places, 36 transitions, 241 flow. Second operand 5 states and 778 transitions. [2021-06-11 15:49:07,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 46 transitions, 295 flow [2021-06-11 15:49:07,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 263 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-06-11 15:49:07,873 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 273 flow [2021-06-11 15:49:07,873 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2021-06-11 15:49:07,873 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2021-06-11 15:49:07,873 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:07,873 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 273 flow [2021-06-11 15:49:07,873 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 273 flow [2021-06-11 15:49:07,874 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 273 flow [2021-06-11 15:49:07,894 INFO L129 PetriNetUnfolder]: 75/190 cut-off events. [2021-06-11 15:49:07,894 INFO L130 PetriNetUnfolder]: For 270/290 co-relation queries the response was YES. [2021-06-11 15:49:07,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 190 events. 75/190 cut-off events. For 270/290 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 992 event pairs, 23 based on Foata normal form. 6/175 useless extension candidates. Maximal degree in co-relation 593. Up to 102 conditions per place. [2021-06-11 15:49:07,897 INFO L151 LiptonReduction]: Number of co-enabled transitions 440 [2021-06-11 15:49:07,900 INFO L163 LiptonReduction]: Checked pairs total: 158 [2021-06-11 15:49:07,900 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:07,900 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 27 [2021-06-11 15:49:07,901 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 273 flow [2021-06-11 15:49:07,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:07,901 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:07,902 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:07,902 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 15:49:07,902 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:49:07,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:07,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1894108876, now seen corresponding path program 1 times [2021-06-11 15:49:07,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:07,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413181800] [2021-06-11 15:49:07,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:07,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:07,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:07,976 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:49:07,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:07,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:07,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:49:07,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413181800] [2021-06-11 15:49:07,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:07,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:49:07,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788541605] [2021-06-11 15:49:07,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:49:07,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:07,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:49:07,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:49:07,985 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 193 [2021-06-11 15:49:07,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 273 flow. Second operand has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 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-06-11 15:49:07,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:07,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 193 [2021-06-11 15:49:07,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:08,059 INFO L129 PetriNetUnfolder]: 50/175 cut-off events. [2021-06-11 15:49:08,059 INFO L130 PetriNetUnfolder]: For 424/740 co-relation queries the response was YES. [2021-06-11 15:49:08,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 175 events. 50/175 cut-off events. For 424/740 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 955 event pairs, 3 based on Foata normal form. 105/267 useless extension candidates. Maximal degree in co-relation 648. Up to 98 conditions per place. [2021-06-11 15:49:08,061 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 5 selfloop transitions, 15 changer transitions 3/50 dead transitions. [2021-06-11 15:49:08,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 50 transitions, 352 flow [2021-06-11 15:49:08,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:49:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:49:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1089 transitions. [2021-06-11 15:49:08,064 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8060695780903034 [2021-06-11 15:49:08,064 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1089 transitions. [2021-06-11 15:49:08,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1089 transitions. [2021-06-11 15:49:08,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:08,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1089 transitions. [2021-06-11 15:49:08,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,069 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,070 INFO L185 Difference]: Start difference. First operand has 54 places, 43 transitions, 273 flow. Second operand 7 states and 1089 transitions. [2021-06-11 15:49:08,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 50 transitions, 352 flow [2021-06-11 15:49:08,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 50 transitions, 340 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 15:49:08,072 INFO L241 Difference]: Finished difference. Result has 60 places, 47 transitions, 335 flow [2021-06-11 15:49:08,072 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=335, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2021-06-11 15:49:08,073 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2021-06-11 15:49:08,073 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:08,073 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 47 transitions, 335 flow [2021-06-11 15:49:08,073 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 47 transitions, 335 flow [2021-06-11 15:49:08,074 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 47 transitions, 335 flow [2021-06-11 15:49:08,091 INFO L129 PetriNetUnfolder]: 37/128 cut-off events. [2021-06-11 15:49:08,091 INFO L130 PetriNetUnfolder]: For 373/414 co-relation queries the response was YES. [2021-06-11 15:49:08,092 INFO L84 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 128 events. 37/128 cut-off events. For 373/414 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 630 event pairs, 3 based on Foata normal form. 4/119 useless extension candidates. Maximal degree in co-relation 519. Up to 76 conditions per place. [2021-06-11 15:49:08,093 INFO L151 LiptonReduction]: Number of co-enabled transitions 484 [2021-06-11 15:49:08,098 INFO L163 LiptonReduction]: Checked pairs total: 182 [2021-06-11 15:49:08,099 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:08,099 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-06-11 15:49:08,100 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 335 flow [2021-06-11 15:49:08,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 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-06-11 15:49:08,100 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:08,101 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:08,101 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 15:49:08,101 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:49:08,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:08,101 INFO L82 PathProgramCache]: Analyzing trace with hash -980002781, now seen corresponding path program 1 times [2021-06-11 15:49:08,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:08,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455571952] [2021-06-11 15:49:08,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:08,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:08,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:49:08,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455571952] [2021-06-11 15:49:08,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:08,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:49:08,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944081314] [2021-06-11 15:49:08,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:49:08,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:08,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:49:08,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:49:08,155 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2021-06-11 15:49:08,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 335 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:08,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2021-06-11 15:49:08,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:08,191 INFO L129 PetriNetUnfolder]: 68/229 cut-off events. [2021-06-11 15:49:08,191 INFO L130 PetriNetUnfolder]: For 883/1243 co-relation queries the response was YES. [2021-06-11 15:49:08,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 229 events. 68/229 cut-off events. For 883/1243 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1429 event pairs, 4 based on Foata normal form. 11/216 useless extension candidates. Maximal degree in co-relation 975. Up to 147 conditions per place. [2021-06-11 15:49:08,194 INFO L132 encePairwiseOnDemand]: 190/193 looper letters, 3 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2021-06-11 15:49:08,194 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 47 transitions, 347 flow [2021-06-11 15:49:08,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:49:08,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:49:08,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2021-06-11 15:49:08,196 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8393782383419689 [2021-06-11 15:49:08,196 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2021-06-11 15:49:08,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2021-06-11 15:49:08,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:08,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2021-06-11 15:49:08,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,199 INFO L185 Difference]: Start difference. First operand has 60 places, 47 transitions, 335 flow. Second operand 3 states and 486 transitions. [2021-06-11 15:49:08,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 47 transitions, 347 flow [2021-06-11 15:49:08,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 47 transitions, 312 flow, removed 13 selfloop flow, removed 2 redundant places. [2021-06-11 15:49:08,204 INFO L241 Difference]: Finished difference. Result has 61 places, 47 transitions, 311 flow [2021-06-11 15:49:08,204 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2021-06-11 15:49:08,205 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2021-06-11 15:49:08,205 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:08,205 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 47 transitions, 311 flow [2021-06-11 15:49:08,205 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 47 transitions, 311 flow [2021-06-11 15:49:08,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 47 transitions, 311 flow [2021-06-11 15:49:08,270 INFO L129 PetriNetUnfolder]: 62/205 cut-off events. [2021-06-11 15:49:08,270 INFO L130 PetriNetUnfolder]: For 447/462 co-relation queries the response was YES. [2021-06-11 15:49:08,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 205 events. 62/205 cut-off events. For 447/462 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1232 event pairs, 4 based on Foata normal form. 7/196 useless extension candidates. Maximal degree in co-relation 709. Up to 63 conditions per place. [2021-06-11 15:49:08,273 INFO L151 LiptonReduction]: Number of co-enabled transitions 484 [2021-06-11 15:49:08,277 INFO L163 LiptonReduction]: Checked pairs total: 182 [2021-06-11 15:49:08,277 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:08,278 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 73 [2021-06-11 15:49:08,280 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 311 flow [2021-06-11 15:49:08,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,280 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:08,280 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:08,281 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 15:49:08,281 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:49:08,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:08,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1714520558, now seen corresponding path program 1 times [2021-06-11 15:49:08,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:08,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637308606] [2021-06-11 15:49:08,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:08,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:08,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:08,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:49:08,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637308606] [2021-06-11 15:49:08,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:08,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:49:08,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159570669] [2021-06-11 15:49:08,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:49:08,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:08,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:49:08,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:49:08,360 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 193 [2021-06-11 15:49:08,360 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 311 flow. Second operand has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,360 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:08,360 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 193 [2021-06-11 15:49:08,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:08,427 INFO L129 PetriNetUnfolder]: 128/404 cut-off events. [2021-06-11 15:49:08,428 INFO L130 PetriNetUnfolder]: For 982/1034 co-relation queries the response was YES. [2021-06-11 15:49:08,430 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1443 conditions, 404 events. 128/404 cut-off events. For 982/1034 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 2961 event pairs, 8 based on Foata normal form. 13/377 useless extension candidates. Maximal degree in co-relation 1414. Up to 135 conditions per place. [2021-06-11 15:49:08,431 INFO L132 encePairwiseOnDemand]: 190/193 looper letters, 4 selfloop transitions, 1 changer transitions 1/49 dead transitions. [2021-06-11 15:49:08,431 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 49 transitions, 335 flow [2021-06-11 15:49:08,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:49:08,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:49:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 643 transitions. [2021-06-11 15:49:08,434 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.832901554404145 [2021-06-11 15:49:08,434 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 643 transitions. [2021-06-11 15:49:08,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 643 transitions. [2021-06-11 15:49:08,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:08,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 643 transitions. [2021-06-11 15:49:08,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,437 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,438 INFO L185 Difference]: Start difference. First operand has 61 places, 47 transitions, 311 flow. Second operand 4 states and 643 transitions. [2021-06-11 15:49:08,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 49 transitions, 335 flow [2021-06-11 15:49:08,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 49 transitions, 330 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-11 15:49:08,447 INFO L241 Difference]: Finished difference. Result has 65 places, 47 transitions, 313 flow [2021-06-11 15:49:08,447 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=313, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2021-06-11 15:49:08,447 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2021-06-11 15:49:08,447 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:08,448 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 47 transitions, 313 flow [2021-06-11 15:49:08,448 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 47 transitions, 313 flow [2021-06-11 15:49:08,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 47 transitions, 313 flow [2021-06-11 15:49:08,477 INFO L129 PetriNetUnfolder]: 71/257 cut-off events. [2021-06-11 15:49:08,477 INFO L130 PetriNetUnfolder]: For 553/568 co-relation queries the response was YES. [2021-06-11 15:49:08,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 257 events. 71/257 cut-off events. For 553/568 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1740 event pairs, 4 based on Foata normal form. 6/246 useless extension candidates. Maximal degree in co-relation 885. Up to 83 conditions per place. [2021-06-11 15:49:08,481 INFO L151 LiptonReduction]: Number of co-enabled transitions 460 [2021-06-11 15:49:08,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:08,546 INFO L163 LiptonReduction]: Checked pairs total: 66 [2021-06-11 15:49:08,546 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 15:49:08,547 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 100 [2021-06-11 15:49:08,547 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 314 flow [2021-06-11 15:49:08,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,547 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:08,548 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:08,548 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 15:49:08,548 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:49:08,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:08,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1228486662, now seen corresponding path program 2 times [2021-06-11 15:49:08,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:08,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861005554] [2021-06-11 15:49:08,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:08,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:08,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:08,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:08,609 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:49:08,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:08,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:49:08,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861005554] [2021-06-11 15:49:08,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:08,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:49:08,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001073660] [2021-06-11 15:49:08,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:49:08,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:08,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:49:08,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:49:08,624 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 195 [2021-06-11 15:49:08,624 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 314 flow. Second operand has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,625 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:08,625 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 195 [2021-06-11 15:49:08,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:08,730 INFO L129 PetriNetUnfolder]: 69/245 cut-off events. [2021-06-11 15:49:08,730 INFO L130 PetriNetUnfolder]: For 895/1171 co-relation queries the response was YES. [2021-06-11 15:49:08,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 245 events. 69/245 cut-off events. For 895/1171 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 1605 event pairs, 0 based on Foata normal form. 160/384 useless extension candidates. Maximal degree in co-relation 993. Up to 90 conditions per place. [2021-06-11 15:49:08,732 INFO L132 encePairwiseOnDemand]: 189/195 looper letters, 2 selfloop transitions, 17 changer transitions 14/50 dead transitions. [2021-06-11 15:49:08,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 50 transitions, 392 flow [2021-06-11 15:49:08,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 15:49:08,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 15:49:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1412 transitions. [2021-06-11 15:49:08,736 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8045584045584045 [2021-06-11 15:49:08,736 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1412 transitions. [2021-06-11 15:49:08,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1412 transitions. [2021-06-11 15:49:08,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:08,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1412 transitions. [2021-06-11 15:49:08,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 156.88888888888889) internal successors, (1412), 9 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,742 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,742 INFO L185 Difference]: Start difference. First operand has 63 places, 46 transitions, 314 flow. Second operand 9 states and 1412 transitions. [2021-06-11 15:49:08,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 50 transitions, 392 flow [2021-06-11 15:49:08,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 50 transitions, 369 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-06-11 15:49:08,747 INFO L241 Difference]: Finished difference. Result has 70 places, 36 transitions, 273 flow [2021-06-11 15:49:08,747 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=273, PETRI_PLACES=70, PETRI_TRANSITIONS=36} [2021-06-11 15:49:08,747 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 35 predicate places. [2021-06-11 15:49:08,747 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:08,748 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 36 transitions, 273 flow [2021-06-11 15:49:08,748 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 36 transitions, 273 flow [2021-06-11 15:49:08,748 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 36 transitions, 273 flow [2021-06-11 15:49:08,756 INFO L129 PetriNetUnfolder]: 13/70 cut-off events. [2021-06-11 15:49:08,756 INFO L130 PetriNetUnfolder]: For 181/189 co-relation queries the response was YES. [2021-06-11 15:49:08,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 70 events. 13/70 cut-off events. For 181/189 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 246 event pairs, 0 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 272. Up to 23 conditions per place. [2021-06-11 15:49:08,757 INFO L151 LiptonReduction]: Number of co-enabled transitions 162 [2021-06-11 15:49:08,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:08,918 INFO L163 LiptonReduction]: Checked pairs total: 6 [2021-06-11 15:49:08,918 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 15:49:08,918 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 171 [2021-06-11 15:49:08,919 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 35 transitions, 271 flow [2021-06-11 15:49:08,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:08,919 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:08,919 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:08,919 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 15:49:08,919 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:49:08,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:08,920 INFO L82 PathProgramCache]: Analyzing trace with hash 25851900, now seen corresponding path program 1 times [2021-06-11 15:49:08,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:08,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374749268] [2021-06-11 15:49:08,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:49:08,949 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:49:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:49:08,980 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:49:09,019 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 15:49:09,020 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 15:49:09,020 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 15:49:09,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 03:49:09 BasicIcfg [2021-06-11 15:49:09,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 15:49:09,121 INFO L168 Benchmark]: Toolchain (without parser) took 24704.53 ms. Allocated memory was 348.1 MB in the beginning and 736.1 MB in the end (delta: 388.0 MB). Free memory was 310.6 MB in the beginning and 499.3 MB in the end (delta: -188.7 MB). Peak memory consumption was 199.8 MB. Max. memory is 16.0 GB. [2021-06-11 15:49:09,122 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 348.1 MB. Free memory was 329.0 MB in the beginning and 328.9 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:49:09,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 593.46 ms. Allocated memory is still 348.1 MB. Free memory was 310.4 MB in the beginning and 307.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-06-11 15:49:09,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.83 ms. Allocated memory is still 348.1 MB. Free memory was 307.1 MB in the beginning and 304.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:49:09,122 INFO L168 Benchmark]: Boogie Preprocessor took 51.63 ms. Allocated memory is still 348.1 MB. Free memory was 304.0 MB in the beginning and 301.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:49:09,122 INFO L168 Benchmark]: RCFGBuilder took 1626.69 ms. Allocated memory is still 348.1 MB. Free memory was 300.9 MB in the beginning and 262.3 MB in the end (delta: 38.5 MB). Peak memory consumption was 140.3 MB. Max. memory is 16.0 GB. [2021-06-11 15:49:09,122 INFO L168 Benchmark]: TraceAbstraction took 22330.04 ms. Allocated memory was 348.1 MB in the beginning and 736.1 MB in the end (delta: 388.0 MB). Free memory was 262.3 MB in the beginning and 499.3 MB in the end (delta: -237.0 MB). Peak memory consumption was 151.0 MB. Max. memory is 16.0 GB. [2021-06-11 15:49:09,123 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.16 ms. Allocated memory is still 348.1 MB. Free memory was 329.0 MB in the beginning and 328.9 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 593.46 ms. Allocated memory is still 348.1 MB. Free memory was 310.4 MB in the beginning and 307.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 82.83 ms. Allocated memory is still 348.1 MB. Free memory was 307.1 MB in the beginning and 304.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 51.63 ms. Allocated memory is still 348.1 MB. Free memory was 304.0 MB in the beginning and 301.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1626.69 ms. Allocated memory is still 348.1 MB. Free memory was 300.9 MB in the beginning and 262.3 MB in the end (delta: 38.5 MB). Peak memory consumption was 140.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 22330.04 ms. Allocated memory was 348.1 MB in the beginning and 736.1 MB in the end (delta: 388.0 MB). Free memory was 262.3 MB in the beginning and 499.3 MB in the end (delta: -237.0 MB). Peak memory consumption was 151.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18356.6ms, 105 PlacesBefore, 35 PlacesAfterwards, 97 TransitionsBefore, 27 TransitionsAfterwards, 1738 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, 4835 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2377, positive: 2214, positive conditional: 2214, positive unconditional: 0, negative: 163, negative conditional: 163, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2377, positive: 2214, positive conditional: 0, positive unconditional: 2214, negative: 163, negative conditional: 0, negative unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2377, positive: 2214, positive conditional: 0, positive unconditional: 2214, negative: 163, negative conditional: 0, negative unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1444, positive: 1398, positive conditional: 0, positive unconditional: 1398, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1444, positive: 1377, positive conditional: 0, positive unconditional: 1377, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 67, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 911, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 755, negative conditional: 0, negative unconditional: 755, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2377, positive: 816, positive conditional: 0, positive unconditional: 816, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 1444, unknown conditional: 0, unknown unconditional: 1444] , Statistics on independence cache: Total cache size (in pairs): 1444, Positive cache size: 1398, Positive conditional cache size: 0, Positive unconditional cache size: 1398, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 94.2ms, 32 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 266 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, positive: 96, positive conditional: 96, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, positive: 96, positive conditional: 9, positive unconditional: 87, negative: 20, negative conditional: 2, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, positive: 96, positive conditional: 9, positive unconditional: 87, negative: 20, negative conditional: 2, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 5, negative conditional: 2, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 2, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 83, negative conditional: 39, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, positive: 87, positive conditional: 9, positive unconditional: 78, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 14, unknown conditional: 2, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 1458, Positive cache size: 1407, Positive conditional cache size: 0, Positive unconditional cache size: 1407, Negative cache size: 51, Negative conditional cache size: 2, Negative unconditional cache size: 49, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 230.6ms, 32 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 441 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 187, positive: 152, positive conditional: 152, positive unconditional: 0, negative: 35, negative conditional: 35, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 187, positive: 152, positive conditional: 0, positive unconditional: 152, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 187, positive: 152, positive conditional: 0, positive unconditional: 152, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 71, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 187, positive: 147, positive conditional: 0, positive unconditional: 147, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 1466, Positive cache size: 1412, Positive conditional cache size: 0, Positive unconditional cache size: 1412, Negative cache size: 54, Negative conditional cache size: 2, Negative unconditional cache size: 52, Eliminated conditions: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3ms, 31 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 165 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, positive: 57, positive conditional: 57, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 70, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1470, Positive cache size: 1416, Positive conditional cache size: 0, Positive unconditional cache size: 1416, Negative cache size: 54, Negative conditional cache size: 2, Negative unconditional cache size: 52, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 66.5ms, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 137 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, positive: 52, positive conditional: 5, positive unconditional: 47, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, positive: 52, positive conditional: 5, positive unconditional: 47, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, positive: 56, positive conditional: 56, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, positive: 49, positive conditional: 2, positive unconditional: 47, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1473, Positive cache size: 1419, Positive conditional cache size: 3, Positive unconditional cache size: 1416, Negative cache size: 54, Negative conditional cache size: 2, Negative unconditional cache size: 52, Eliminated conditions: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 150.7ms, 41 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 157 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, positive: 71, positive conditional: 71, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, positive: 71, positive conditional: 21, positive unconditional: 50, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, positive: 71, positive conditional: 21, positive unconditional: 50, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 9, 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: 10, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 138, positive: 138, positive conditional: 138, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, positive: 61, positive conditional: 12, positive unconditional: 49, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 10, unknown conditional: 9, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1483, Positive cache size: 1429, Positive conditional cache size: 12, Positive unconditional cache size: 1417, Negative cache size: 54, Negative conditional cache size: 2, Negative unconditional cache size: 52, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.2ms, 45 PlacesBefore, 45 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, positive: 28, positive conditional: 10, positive unconditional: 18, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, positive: 28, positive conditional: 10, positive unconditional: 18, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 36, positive: 28, positive conditional: 10, positive unconditional: 18, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1483, Positive cache size: 1429, Positive conditional cache size: 12, Positive unconditional cache size: 1417, Negative cache size: 54, Negative conditional cache size: 2, Negative unconditional cache size: 52, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.6ms, 49 PlacesBefore, 49 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 178 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, positive: 36, positive conditional: 16, positive unconditional: 20, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 36, positive conditional: 16, positive unconditional: 20, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, positive: 33, positive conditional: 13, positive unconditional: 20, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1486, Positive cache size: 1432, Positive conditional cache size: 15, Positive unconditional cache size: 1417, Negative cache size: 54, Negative conditional cache size: 2, Negative unconditional cache size: 52, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.9ms, 51 PlacesBefore, 51 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 172 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, positive: 44, positive conditional: 20, positive unconditional: 24, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, positive: 44, positive conditional: 20, positive unconditional: 24, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, 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: 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: 54, positive: 43, positive conditional: 19, positive unconditional: 24, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1487, Positive cache size: 1433, Positive conditional cache size: 16, Positive unconditional cache size: 1417, Negative cache size: 54, Negative conditional cache size: 2, Negative unconditional cache size: 52, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.9ms, 54 PlacesBefore, 54 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 158 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, positive: 24, positive conditional: 14, positive unconditional: 10, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 24, positive conditional: 14, positive unconditional: 10, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 32, positive: 24, positive conditional: 14, positive unconditional: 10, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1487, Positive cache size: 1433, Positive conditional cache size: 16, Positive unconditional cache size: 1417, Negative cache size: 54, Negative conditional cache size: 2, Negative unconditional cache size: 52, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.3ms, 60 PlacesBefore, 60 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 182 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, positive: 30, positive conditional: 22, positive unconditional: 8, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 30, positive conditional: 22, positive unconditional: 8, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 38, positive: 30, positive conditional: 22, positive unconditional: 8, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1487, Positive cache size: 1433, Positive conditional cache size: 16, Positive unconditional cache size: 1417, Negative cache size: 54, Negative conditional cache size: 2, Negative unconditional cache size: 52, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 72.3ms, 61 PlacesBefore, 61 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 182 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, positive: 26, positive conditional: 16, positive unconditional: 10, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, positive: 26, positive conditional: 16, positive unconditional: 10, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 34, positive: 26, positive conditional: 16, positive unconditional: 10, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1487, Positive cache size: 1433, Positive conditional cache size: 16, Positive unconditional cache size: 1417, Negative cache size: 54, Negative conditional cache size: 2, Negative unconditional cache size: 52, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 98.5ms, 65 PlacesBefore, 63 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 460 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 66 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, positive: 66, positive conditional: 66, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, positive: 66, positive conditional: 40, positive unconditional: 26, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 66, positive conditional: 40, positive unconditional: 26, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 66, positive: 66, positive conditional: 40, positive unconditional: 26, 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): 1487, Positive cache size: 1433, Positive conditional cache size: 16, Positive unconditional cache size: 1417, Negative cache size: 54, Negative conditional cache size: 2, Negative unconditional cache size: 52, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 170.1ms, 70 PlacesBefore, 65 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 6 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, 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: 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: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1493, Positive cache size: 1439, Positive conditional cache size: 22, Positive unconditional cache size: 1417, Negative cache size: 54, Negative conditional cache size: 2, Negative unconditional cache size: 52, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1214; [L824] FCALL, FORK 0 pthread_create(&t1214, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1215; [L826] FCALL, FORK 0 pthread_create(&t1215, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1216; [L828] FCALL, FORK 0 pthread_create(&t1216, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 22147.5ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1172.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 18423.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 46 SDtfs, 18 SDslu, 16 SDs, 0 SdLazy, 232 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 313.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 500.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=10, InterpolantAutomatonStates: 62, 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: 38.9ms SsaConstructionTime, 341.5ms SatisfiabilityAnalysisTime, 920.2ms InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 1063 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...